CN103092690A - Batch scheduling method of achieving minimum maximum delay based on product family sequencing - Google Patents
Batch scheduling method of achieving minimum maximum delay based on product family sequencing Download PDFInfo
- Publication number
- CN103092690A CN103092690A CN2013100225759A CN201310022575A CN103092690A CN 103092690 A CN103092690 A CN 103092690A CN 2013100225759 A CN2013100225759 A CN 2013100225759A CN 201310022575 A CN201310022575 A CN 201310022575A CN 103092690 A CN103092690 A CN 103092690A
- Authority
- CN
- China
- Prior art keywords
- batch
- product
- family
- minimax
- delay
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Abstract
A batch scheduling method of achieving minimum maximum delay based on product family sequencing is used for being reentrant in a production line. An objective function is the minimum maximum delay of scheduling batch. Different product families in a buffer in front of a reentrant batch processing machine are firstly used as research objects according to model decomposition, and then workpieces in the product families with the highest priority are used as the research objects. Implementation is achieved step by step through a full batch rule, a maximum full batch quantity priority rule, a maximum reentrant time priority rule and the earliest construction period priority rule. All scheduling periodic tasks are implemented under a rolling time domain strategy. The batch scheduling method of achieving the minimum maximum delay based on the product family sequencing does not need to sequence all group batches of the workpieces and batches under the normal condition, but the batch scheduling method of achieving the minimum maximum delay based on the product family sequencing directly sequences the product families. The batch scheduling method of achieving the minimum maximum delay based on the product family sequencing has the advantages of being capable of greatly reducing time complexity of an algorithm, achieving real-time optimal scheduling of the reentrant batch processing machine through the accurate algorithm and meeting manufacturing requirements with the goal of the minimum maximum delay in a semiconductor industry, simple in design, convenient to achievement, and beneficial for popularization and application of reentrant industries such as the semiconductor industry.
Description
Affiliated technical field
The present invention relates to the to reentry batch processor scheduling of production line relates in particular to a kind of product-based family sequence for Re-entrant lines and realizes that minimax incurs loss through delay batch dispatching method of target.
Background technology
Re-entrant lines (re-entrant) is at the beginning of the nineties at the end of the eighties in last century, the concept that is proposed for the production characteristics of the industries such as semi-conductor chip, film by U.S. Kumar professor, and classify it as be different from line production (Flow-shop) and different order operation (Job-shop) the 3rd class reentry type production line.So-called reentry refers to that the product of not completing processing adds man-hour along production line, might be for several times processed at same worktable, each work status that adds man-hour is different, each Product Status be called a product family (family) (
Annotate:Product family's concept is different from product type, and the quantity of supposing product type is N, and the number of times of product needed reentry batch processor is K, the quantity F=N*K of product family).Batch processing referring to when being no more than the maximum working ability of worktable, and once can process a plurality of products of not completing processing, a plurality of converted products of not completing of each actual processing are called one batch (Batch).As, in the boiler tube district of semiconductor core slice assembly line leading portion, this machine table belongs to the batch processor that can be multiple enters, and has long processing time, is the bottleneck board of production system, needs the characteristics such as multilayer reentry processing and equipment price are more expensive.In order to improve batch dispatching efficiency in boiler tube district, there is multiple regulation goal to weigh, wherein the minimax delay is a kind of measurement target.can not the mixing group criticize (incompatible job families) take the minimax delay as the multi-product family of weighing target, the rational management control that product has different time of arrival the batch processor (re-entrant batch processing machine) of the Re-entrant lines of (dynamic job arrivals) is that batch scheduling is the difficult problem (NP-hard) of a nonpolynomial with control research, it is restricting the Whole Performance of semiconductor producing system, the rational management control research of carrying out take the minimax delay as the batch processor of measurement target is significant to the performance of improving the semiconductor core slice assembly line, academia and one of study hotspot of using the boundary always.
At present, from the situation of the semi-conductor chip production of China and even various countries, the speed of renewal of the equipment and product up-gradation is very fast, and the Research of Scheduling Method of production line does not catch up with the needs of its practical development far away.On the semiconductor Re-entrant lines, with minimax incur loss through delay (
Lmax) in the batch processor production run scheduling of weighing target, conventional dispatching method is: when batch processor is idle available, to the workpiece of the different phase product family in the impact damper before batch processor by certain rule group batch, organize batch again by take the minimax delay as the optimal sequencing of weighing target and the scheduling medium priority the highest batch be assigned to idle available batch processor.But the continuous increase along with the workpiece quantity in the impact damper before batch processor, also corresponding increase of the lot number amount of organizing, cause take the minimax delay as the scale of weighing the target scheduling problem and increase, the difficulty of Solve problems increases, and makes elongated and precision that time complexity impact batch dispatching algorithm is conciliate of the time of finding the solution.
Summary of the invention
the present invention is directed to the technical matters that exists in above-mentioned prior art, provide a kind of product-based family sequence for Re-entrant lines to realize batch dispatching method that minimax is incured loss through delay, overcome in the dynamic Real-Time Scheduling process of batch processor of the semiconductor core slice assembly line with the characteristic of can reentrying, continuous increase along with the workpiece quantity in the impact damper before batch processor, also corresponding increase of the lot number amount of organizing, cause take the minimax delay as the scale of weighing the target scheduling problem and increase, the difficulty of Solve problems increases, make elongated and precision that time complexity impact batch dispatching algorithm is conciliate of the time of finding the solution.
The present invention specifically solves the technical solution that its technical matters adopts:
The sequence of a kind of product-based family realizes batch dispatching method that minimax is incured loss through delay, first in the impact damper before the batch processor of can reentrying different product family as research object, again in the right of priority the highest product family workpiece as research object, the multi-product family that requires to process on batch processing equipment can not the mixing group criticizes, product has different time of arrival, whenever the reentrant batch processor of studying occurs idle when available, the sequence of enforcement product-based family realizes batch dispatching method that minimax is incured loss through delay, and during by rolling, domain policy is completed the whole Real-Time Scheduling of defined.Main terms is explained: " the maximum delay " refers to the product family of all researchs or the worst condition that workpiece is incured loss through delay relative delivery date, order
C i Expression the
iThe product family of individual all researchs or workpiece completion date,
d i Expression the
iThe product family of individual all researchs or workpiece delivery date,
L i Represent the product family of i all researchs or the delay of workpiece, have
L i =
C i -
d i ,
LmaxExpression is owned
L i Middle maximal value, order are always total
nIndividual research object, namely
Lmax=max{
L i |
i=1,2 .., n}; " granted full rule " refers to carry out the workpiece group when criticizing, the workpiece quantity in last batch more than or equal to batch minimum capacity, the max cap. that in all the other each batches, workpiece quantity must equal batch; " maximum granted full quantity priority rule " refers to that all product families preferentially sort by the principle that do not subtract of the lot number amount that calculates under the granted full rule; When " maximum degree of reentrancy priority rule " refers to occur equating by the lot number amount that calculates under the granted full rule in maximum granted full quantity priority rule is implemented, sort by the principle that do not subtract at product family's degree of reentrancy; " duration priority rule the earliest " refers to that the workpiece in priority level the highest product family does not subtract the principle sequence by its duration, if the duration occurs when equating, by first Service Principle sequence first; " scheduling end condition " is that the general plan production run is completed task dispatching cycle under domain policy when rolling.
The sequence of above-mentioned product-based family realizes batch dispatching method that minimax is incured loss through delay, and comprises that step is as follows:
Step 1, produce trigger event: the batch processor of can reentrying is in idle upstate;
Step 2, workpiece quantity information according to the different product family in the phase buffer before the batch processor of can reentrying, based on " maximum granted full quantity priority rule " and " maximum degree of reentrancy priority rule " to the product family's workpiece sequencing in the batch processor anterior bumper, namely at first calculate lot number amount in each product family by " granted full rule ", preferential press " maximum granted full quantity priority rule " sorts to product family, when the lot number amount equates in product family occurring, then by " maximum degree of reentrancy priority rule " sequence;
Step 3 according to the ranking results of the product family of step 2, is chosen right of priority the highest product family;
Step 4, the workpiece in right of priority the highest product family sorts based on " duration priority rule the earliest ";
Step 5 according to the workpiece sequencing result of step 4, is set up first batch of this sequence workpiece based on " granted full rule ";
Step 6, the workpiece of first batch that step 5 is set up is assigned to the idle available batch processor of step 1;
Step 7, " scheduling end condition " judgement: if do not meet " scheduling end condition ", domain policy during according to rolling jumps to step 1, otherwise down carries out;
Step 8, the sequence of product-based family realize that batch dispatching method that minimax is incured loss through delay stops.
The invention has the beneficial effects as follows, adopt a kind of product-based family sequence for Re-entrant lines to realize batch dispatching method that minimax is incured loss through delay, with general batch processing scheduling model " uniprocessor
|Different workpieces
jTime of arrival, batch scheduling can be reentried, and can not the mixing group criticize between product family
|Minimax is incured loss through delay target " (that is :) resolve into model " uniprocessor
|Criticize scheduling, can reentry, can not the mixing group criticize between product family
|Minimax is incured loss through delay target " (that is :) and model " uniprocessor
|Different workpieces
jTime of arrival, product family
fIn all workpiece
jProcess time is identical
|Minimax delay target " (that is :); utilize " granted full rule ", " maximum granted full quantity priority rule ", " maximum degree of reentrancy priority rule "; implement step by step with " duration priority rule the earliest " are completed enforcement whole dispatching cycle of task under domain policy when rolling.The present invention does not need to implement the group of workpiece routine in different product family under general case and criticizes and criticize sequence, directly sort towards product family, at the time complexity that guarantees greatly to reduce in the degree of precision situation of separating algorithm, and be all exact algorithm realize the to reentry real-time optimal scheduling of lower batch processor, satisfy the semicon industry minimax and incur loss through delay the target Production requirement, its concept is simple, and it is convenient to realize.
Description of drawings
Fig. 1 the present invention is based on the algorithm flow chart that product family's sequence realizes batch dispatching method that minimax is incured loss through delay
Embodiment
Below in conjunction with drawings and Examples, patent of the present invention is further described:
the sequence of product-based provided by the present invention family realizes batch dispatching method that minimax is incured loss through delay, first in the impact damper before the batch processor of can reentrying different product family as research object, again in the right of priority the highest product family workpiece as research object, the multi-product family that requires to process on batch processing equipment can not the mixing group criticize, product has different time of arrival, whenever the reentrant batch processor of studying occurs idle when available, the sequence of enforcement product-based family realizes batch dispatching method that minimax is incured loss through delay, during by rolling, domain policy is completed the whole Real-Time Scheduling of defined.
With reference to figure 1, be based on the algorithm flow chart that product family's sequence realizes batch dispatching method that minimax is incured loss through delay, with the batch processing scheduling model " uniprocessor of routine
|Different time of arrival, batch scheduling can be reentried, and can not the mixing group criticize between product family
|Minimax is incured loss through delay target " (that is :) resolve into model " uniprocessor
|Criticize scheduling, can reentry, can not the mixing group criticize between product family
|Minimax is incured loss through delay target " (that is :) and model " uniprocessor
|Different time of arrival, product processing time is identical
|Minimax delay target " (that is :); utilize " granted full rule "; " maximum granted full quantity priority rule ", enforcement whole dispatching cycle of task is completed in enforcements step by step such as " maximum degree of reentrancy priority rules " and " duration priority rule the earliest " under domain policy when rolling.The sequence of product-based family realizes that the idiographic flow of batch dispatching method that minimax is incured loss through delay is as follows:
Step 1, produce trigger event: the batch processor of can reentrying is in idle upstate;
Step 2, workpiece quantity information according to the different product family in the phase buffer before the batch processor of can reentrying, based on " maximum granted full quantity priority rule " and " maximum degree of reentrancy priority rule " to the product family's workpiece sequencing in the batch processor anterior bumper, namely at first calculate lot number amount in each product family by " granted full rule ", preferential press " maximum granted full quantity priority rule " sorts to product family, when the lot number amount equates in product family occurring, then by " maximum degree of reentrancy priority rule " sequence;
Step 3 according to the ranking results of the product family of step 2, is chosen right of priority the highest product family;
Step 4, the workpiece in right of priority the highest product family sorts based on " duration priority rule the earliest ";
Step 5 according to the workpiece sequencing result of step 4, is set up first batch of this sequence workpiece based on " granted full rule ";
Step 6, the workpiece of first batch that step 5 is set up is assigned to the idle available batch processor of step 1;
Step 7, " scheduling end condition " judgement: if do not meet " scheduling end condition ", domain policy during according to rolling jumps to step 1, otherwise down carries out;
Step 8, the sequence of product-based family realize that batch dispatching method that minimax is incured loss through delay stops.
Claims (7)
1. a product-based family sequence realizes batch dispatching method that minimax is incured loss through delay, it is characterized in that, objective function is that the minimax of criticizing of dispatching is incured loss through delay, decompose by model, first in the impact damper before the batch processor of can reentrying different product family as research object, again in the right of priority the highest product family workpiece as research object, utilize the granted full rule, maximum granted full quantity priority rule, maximum degree of reentrancy priority rule, priority rule is implemented step by step duration the earliest, completes whole dispatching cycle of the task of implementing when rolling under domain policy.
2. the sequence of product-based according to claim 1 family realizes batch dispatching method that minimax is incured loss through delay, and it is characterized in that, it is batch processing scheduling model " uniprocessor with routine that described model decomposes
|Different time of arrival, batch scheduling can be reentried, and can not the mixing group criticize between product family
|Minimax is incured loss through delay target " (that is :) resolve into model " uniprocessor
|Criticize scheduling, can reentry, can not the mixing group criticize between product family
|Minimax is incured loss through delay target " (that is :) and model " uniprocessor
|Different time of arrival, product processing time is identical
|Minimax is incured loss through delay target " (that is :).
3. the sequence of product-based according to claim 1 family realizes batch dispatching method that minimax is incured loss through delay, it is characterized in that, described granted full rule refers to carry out the workpiece group when criticizing, workpiece quantity in last batch more than or equal to batch minimum capacity, the max cap. that in all the other each batches, workpiece quantity must equal batch.
4. the sequence of product-based according to claim 1 family realizes batch dispatching method that minimax is incured loss through delay, it is characterized in that, described maximum granted full quantity priority rule refers to that all product families preferentially sort by the principle that do not subtract of the lot number amount that calculates under the granted full rule.
5. the sequence of product-based according to claim 1 family realizes batch dispatching method that minimax is incured loss through delay, it is characterized in that, when described maximum degree of reentrancy priority rule refers to occur equating by the lot number amount that calculates under the granted full rule in maximum granted full quantity priority rule is implemented, sort by the principle that do not subtract at product family's degree of reentrancy.
6. the sequence of product-based according to claim 1 family realizes batch dispatching method that minimax is incured loss through delay, it is characterized in that, the described priority rule of duration the earliest refers to that the workpiece in priority level the highest product family does not subtract the principle sequence by its duration, if the duration occurs when equating, by first Service Principle sequence first.
7. the sequence of product-based according to claim 1 family realizes batch dispatching method that minimax is incured loss through delay, and it is characterized in that, describedly implements step by step, and it mainly comprises the following steps:
Step 1, produce trigger event: the batch processor of can reentrying is in idle upstate;
Step 2, workpiece quantity information according to the different product family in the phase buffer before the batch processor of can reentrying, based on " maximum granted full quantity priority rule " and " maximum degree of reentrancy priority rule " to the product family's workpiece sequencing in the batch processor anterior bumper, namely at first calculate lot number amount in each product family by " granted full rule ", preferential press " maximum granted full quantity priority rule " sorts to product family, when the lot number amount equates in product family occurring, then by " maximum degree of reentrancy priority rule " sequence;
Step 3 according to the ranking results of the product family of step 2, is chosen right of priority the highest product family;
Step 4, the workpiece in right of priority the highest product family sorts based on " duration priority rule the earliest ";
Step 5 according to the workpiece sequencing result of step 4, is set up first batch of this sequence workpiece based on " granted full rule ";
Step 6, the workpiece of first batch that step 5 is set up is assigned to the idle available batch processor of step 1;
Step 7, " scheduling end condition " judgement: if do not meet " scheduling end condition ", domain policy during according to rolling jumps to step 1, otherwise down carries out;
Step 8, the sequence of product-based family realize that minimax incurs loss through delay batch dispatching method of target and stop.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310022575.9A CN103092690B (en) | 2013-01-22 | 2013-01-22 | Batch scheduling method of achieving minimum maximum delay based on product family sequencing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310022575.9A CN103092690B (en) | 2013-01-22 | 2013-01-22 | Batch scheduling method of achieving minimum maximum delay based on product family sequencing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103092690A true CN103092690A (en) | 2013-05-08 |
| CN103092690B CN103092690B (en) | 2015-06-03 |
Family
ID=48205300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310022575.9A Expired - Fee Related CN103092690B (en) | 2013-01-22 | 2013-01-22 | Batch scheduling method of achieving minimum maximum delay based on product family sequencing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103092690B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6865433B1 (en) * | 2004-06-23 | 2005-03-08 | International Business Machines Corporation | Method, system, and storage medium for optimizing scheduling activities in a manufacturing environment |
| CN101493857A (en) * | 2009-02-13 | 2009-07-29 | 同济大学 | Semiconductor production line model building, optimizing and scheduling method based on petri net and immune arithmetic |
| CN101604409A (en) * | 2009-07-15 | 2009-12-16 | 北京化工大学 | Be applied to the dispatching method of multi-enterable complex manufacturing system |
| CN101833319A (en) * | 2010-05-11 | 2010-09-15 | 同济大学 | Multiply manufacturing system on-line scheduling oriented single-equipment matched rescheduling method |
-
2013
- 2013-01-22 CN CN201310022575.9A patent/CN103092690B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6865433B1 (en) * | 2004-06-23 | 2005-03-08 | International Business Machines Corporation | Method, system, and storage medium for optimizing scheduling activities in a manufacturing environment |
| CN101493857A (en) * | 2009-02-13 | 2009-07-29 | 同济大学 | Semiconductor production line model building, optimizing and scheduling method based on petri net and immune arithmetic |
| CN101604409A (en) * | 2009-07-15 | 2009-12-16 | 北京化工大学 | Be applied to the dispatching method of multi-enterable complex manufacturing system |
| CN101833319A (en) * | 2010-05-11 | 2010-09-15 | 同济大学 | Multiply manufacturing system on-line scheduling oriented single-equipment matched rescheduling method |
Non-Patent Citations (1)
| Title |
|---|
| 赵丽娜 等: "可重入生产系统的一种新型优化调度策略", 《控制理论与应用》, vol. 17, no. 5, 25 October 2000 (2000-10-25), pages 730 - 734 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103092690B (en) | 2015-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103136631B (en) | Batch dispatching method of minimum total complete time is realized based on product family's sequence | |
| CN105900064A (en) | Method and apparatus for scheduling data flow task | |
| CN103294531B (en) | A kind of method for allocating tasks and system | |
| CN103646301B (en) | Batch dispatching system and method for furnace tube device | |
| CN103995742B (en) | Embedded type real-time scheduling control device and method based on MCU | |
| CN105930591A (en) | Realization method for register clustering in clock tree synthesis | |
| EP4318348A1 (en) | Order processing method and apparatus, device, system, medium, and product | |
| CN103034215B (en) | Based on reentried multimachine batch processing dispatching device and the method for closed-loop | |
| CN102012936A (en) | Massive data aggregation method and system based on cloud computing platform | |
| Reginato et al. | Mixed assembly line balancing method in scenarios with different mix of products | |
| CN103116809A (en) | Dispatch device and method of batch processing machine capable of sequencing facing product family | |
| CN103092690A (en) | Batch scheduling method of achieving minimum maximum delay based on product family sequencing | |
| CN104915721A (en) | Order production period and output measuring method | |
| CN106411545A (en) | Service attribute counting method and device | |
| CN103927689A (en) | Dispatching control method for batch processor of reentrant manufacturing system | |
| CN103870633B (en) | A kind of large scale structure rapid modeling system | |
| CN101022248A (en) | Universal control device for frequency transformer and control method thereof | |
| CN107942968B (en) | A kind of dispatching method and system of hybrid flow production | |
| CN105279605A (en) | Batch processing machine scheduling method of dynamically-changed weight | |
| CN103309747B (en) | The distribution method of a kind of code file statistics task and device | |
| CN103926187B (en) | The parameter output intent blocked based on parameter and system and blood cell analyzer | |
| CN105184500A (en) | Production line equipment allotting method and system | |
| CN106020978B (en) | A kind of execution method of time residual quantity daisy chaining table timer | |
| CN103399549B (en) | Feed intake semiconductor assembly and test based on constrained minimum spanning tree thin day control method | |
| CN102830657B (en) | System and method for punching five-host three-face punched numerical control production line |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150603 Termination date: 20190122 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |