Dynamic Reentrant Scheduling Simulation for Assembly and Test Production Line in Semiconductor Industry

2010 ◽  
Vol 97-101 ◽  
pp. 2418-2422 ◽  
Author(s):  
Ai Jun Liu ◽  
Yu Yang ◽  
Xue Dong Liang ◽  
Ming Hua Zhu ◽  
Hao Yao
Keyword(s):  
Production Scheduling ◽  
Production Line ◽  
Dynamic Scheduling ◽  
Semiconductor Industry ◽  
Product Variety ◽  
Maximum Output ◽  
Resource Conflict ◽  
Conflict Resolution Strategies ◽  
Scheduling Models ◽  
Semiconductor Production

Production scheduling in semiconductor production line is a complex combinatorial optimization problem. It is featured by reentrant production, product variety, frequent machine breakdown and especially reentrant phenomenon and dynamic randomness, which conduces enormous complexity to production line scheduling and management. Based on the resource conflict resolution strategies, dynamic scheduling models for a semiconductor production system are proposed here, aiming at finding maximum machine utilization, optimal man-machine ratio (MMR) and maximum output. Then the validity of the model is illustrated by a simulation case.

scholarly journals Dynamic Scheduling of a Semiconductor Production Line Based on a Composite Rule Set

2017 ◽  
Vol 7 (10) ◽  
pp. 1052 ◽  
Author(s):  
Yumin Ma ◽  
Fei Qiao ◽  
Fu Zhao ◽  
John Sutherland
Keyword(s):  
Production Line ◽  
Dynamic Scheduling ◽  
Rule Set ◽  
Semiconductor Production

scholarly journals Dynamic Scheduling of a Semiconductor Production Line Based on Composite Rule Set

2017 ◽  
Author(s):  
Yumin Ma ◽  
Fei Qiao ◽  
Fu Zhao ◽  
John W. Sutherland
Keyword(s):  
Production Line ◽  
Dynamic Scheduling ◽  
Production Performance ◽  
Support Vector ◽  
Dispatching Rule ◽  
Production Schedule ◽  
Rule Based ◽  
Rule Set ◽  
Key Variables ◽  
Semiconductor Production

Various factors and constraints should be considered when developing a manufacturing production schedule, and such a schedule is often based on rules. This paper develops a composite dispatching rule based on heuristic rules that comprehensively consider various factors in a semiconductor production line. The composite rule is obtained by exploring various states of a semiconductor production line (machine status, queue size, etc.), where such indicators as makespan and equipment efficiency are used to judge performance. A model of the response surface, as a function of key variables, is then developed to find the optimized parameters of a composite rule for various production states. Further, dynamic scheduling of semiconductor manufacturing is studied based on support vector regression (SVR). This approach dynamically obtains a composite dispatching rule (i.e. parameters of the composite dispatching rule) that can be used to optimize production performance according to real-time production line state. Following optimization, the proposed dynamic scheduling approach is tested in a real semiconductor production line to validate the effectiveness of the proposed composite rule set.

The Scheduling Frame Research Facing Rapid Response Manufacturing

2012 ◽  
Vol 220-223 ◽  
pp. 78-82
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li
Keyword(s):  
Dynamic Scheduling ◽  
Current Situation ◽  
Rapid Response ◽  
Practical Situation ◽  
Manufacturing Information ◽  
Technical Function ◽  
Function Base ◽  
Scheduling Models ◽  
Automatic Scheduling

The current environment is experiencing a transformation from multi varieties and little batch to multi varieties and batch, this situation has result that companies’ management do not suite it. According to this the scheduling frame research facing rapid response manufacturing has been proposed. At first through this analyzing the problem in current situation, the whole scheduling frame is researched. Secondly, many models that can be used in this frame have been discussed such as manufacturing information, disturbance events, automatic scheduling and dynamic scheduling models. Finally the whole scheduling platforms which can be used in practical situation has been proposed and make a technical function base for current manufacturers.

Linear Rail Space Dynamic Scheduling Technology for Multi-Tasking Hybrid Assembly Sections

2012 ◽  
Vol 271-272 ◽  
pp. 650-656
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li
Keyword(s):  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Real Data ◽  
Utilization Rate ◽  
Filter Method ◽  
Scheduling Problem ◽  
Rule Based ◽  
Comprehensive Utilization ◽  
Space Production

For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example， the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.

Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling

2012 ◽  
pp. 816-827
Author(s):  
Virginia M. Miori ◽  
Brian Segulin
Keyword(s):  
Dynamic Programming ◽  
Supply Chain ◽  
Production Scheduling ◽  
Production Line ◽  
Dairy Industry ◽  
Dairy Production ◽  
Final Solution ◽  
Lagrange Relaxation ◽  
Optimal Methods ◽  
Single Production

The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming.

A FMS Dynamic Scheduling Optimization Strategy and Simulation Research

2013 ◽  
Vol 389 ◽  
pp. 692-697
Author(s):  
Ji Zhuang Hui ◽  
Xiang Ding ◽  
Kai Gao
Keyword(s):  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Scheduling Problems ◽  
Optimization Strategy ◽  
Scheduling Optimization ◽  
Simulation Research ◽  
Scheduling Strategy ◽  
Machine Failure ◽  
Rolling Window ◽  
Scheduling Optimization Algorithm

This paper studied the FMS dynamic scheduling problem which was based on Petri net FMS static scheduling optimization algorithm, which in accorder to solve the FMS actual production scheduling problems. A rolling window dynamic re-scheduling strategy was proposed which based on event driven and cycle driven. Then take the emergency machine failure often appearing in the actual workshop for example, this scheduling strategy was analyzed and applied to dynamic simulation and finally the effectiveness of the dynamic scheduling strategy was verified.

Sign in / Sign up

Export Citation Format

Share Document