CN103092690B - 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
- CN103092690B CN103092690B CN201310022575.9A CN201310022575A CN103092690B CN 103092690 B CN103092690 B CN 103092690B CN 201310022575 A CN201310022575 A CN 201310022575A CN 103092690 B CN103092690 B CN 103092690B
- Authority
- CN
- China
- Prior art keywords
- batch
- product family
- product
- minimax
- rule
- 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.)
- Expired - Fee Related
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
Art
The present invention relates to the batch processor scheduling of reentry production line, particularly relate to a kind of batch dispatching method realizing minimax delay target based on product family's sequence for Re-entrant lines.
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 proposed for the productive prospecting of the industry such as semi-conductor chip, film by U.S. Kumar professor, and be classified as the 3rd class reentry type production line being different from line production (Flow-shop) and different sequence operation (Job-shop).So-called reentry refers to that the product not completing processing carries out adding man-hour along production line, likely for several times processed at same worktable, and each work status adding man-hour is different, each Product Status be called a product family (family) (
note:product family's concept is different from product type, supposes that the quantity of product type is N, and the number of times of product needed reentry batch processor is K, then the quantity F=N*K of product family).Criticizing processing refers to when being no more than the maximum working ability of worktable, once can process multiple product not completing processing, and the multiple converted products that do not complete of each actual processing is called that one is criticized (Batch).As, in the boiler tube district of semiconductor core slice assembly line leading portion, this machine table belong to can multiple enter batch processor, having long processing time, is the bottleneck board of production system, needs the characteristics such as multilayer reentry is processed and equipment price is more expensive.In order to improve batch dispatching efficiency in boiler tube district, have multiple regulation goal to weigh, wherein minimax is incured loss through delay is a kind of measurement target.With minimax delay for the multi-product race weighing target can not mix batching (incompatible job families), it be batch scheduling with controlling to study is the difficult problem (NP-hard) of a nonpolynomial that the rational management that product has a batch processor (re-entrant batch processing machine) of the Re-entrant lines of different time of arrival (dynamic job arrivals) controls, it governs the Whole Performance of semiconductor producing system, carry out with minimax delay significant to the performance improving semiconductor core slice assembly line for the rational management weighing the batch processor of target controls research, academia and one of study hotspot applying boundary always.
At present, from the situation that the semi-conductor chip of China and even various countries is produced, quickly, the Research of Scheduling Method of production line does not catch up with the needs of its practical development far away to the speed of renewal of the equipment and product up-gradation.On semiconductor Re-entrant lines, with minimax incur loss through delay (
lmax) for weighing in the batch processor production run scheduling of target, routine dispactching 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 regular batching, organize batch again by with minimax delay be weigh the optimal sequencing of target and scheduling medium priority the highest batch be assigned to idle available batch processor.But along with the continuous increase of the piece count in the impact damper before batch processor, the also corresponding increase of the lot number amount organized, cause with minimax delay as the scale weighing target dispatch problem increases, the difficulty of Solve problems increases, and makes the time that solves elongated and the precision of the time complexity reconciliation of impact batch dispatching algorithm.
Summary of the invention
The present invention is directed to the technical matters existed in above-mentioned prior art, a kind of batch dispatching method realizing minimax delay based on product family's sequence for Re-entrant lines is provided, overcome in the batch processor dynamic realtime scheduling process of the semiconductor core slice assembly line with characteristic of can reentrying, along with the continuous increase of the piece count in the impact damper before batch processor, the also corresponding increase of the lot number amount organized, cause with minimax delay as the scale weighing target dispatch problem increases, the difficulty of Solve problems increases, make the time that solves elongated and the precision of the time complexity reconciliation of impact batch dispatching algorithm.
The present invention specifically solves the technical solution that its technical matters adopts:
A kind of batch dispatching method realizing minimax delay based on product family's sequence, first with different product race in the impact damper before batch processor of can reentrying for research object, again with workpiece in the highest product family of right of priority for research object, require batch processing equipment is processed multi-product race can not mix batching, product has different time of arrival, whenever studied reentrant batch processor occur idle available time, implement batch dispatching method realizing minimax delay based on product family's sequence, completed the whole Real-Time Scheduling of defined by rolling time horizon strategy.Main terms is explained: " maximum delay " refers to that the product family of all research or workpiece relative delivery date are by the worst condition incured loss through delay, order
c i represent the
ithe product family of individual all research or workpiece completion date,
d i represent the
ithe product family of individual all research or workpiece delivery date,
l i represent the product family of i-th all research or the delay of workpiece, have
l i =
c i -
d i ,
lmaxrepresent all
l i middle maximal value, order always has
nindividual research object, namely
lmax=max{
l i |
i=1,2 .., n}; When " granted full rule " refers to and carry out workpiece batching, except the piece count in last batch is more than or equal to the minimum capacity criticized, in all the other each batch, piece count must equal the max cap. criticized; " 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 calculated under granted full rule; When " maximum degree of reentrancy priority rule " refers to and occur equal by the lot number amount calculated under 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; " the earliest duration priority rule " refers to that the workpiece in the product family that priority level is the highest does not subtract principle sequence by its duration, if when occurring that the duration is equal, sorts by prerequisite variable principle; " scheduling end condition " is that general plan production run completes task dispatching cycle under rolling time horizon strategy.
The above-mentioned batch dispatching method realizing minimax delay based on product family's sequence, comprises step as follows:
Step 1, produces trigger event: a batch processor of can reentrying is in idle upstate;
Step 2, according to the piece count information of the different product race in the phase buffer before 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 batch processor anterior bumper, namely first lot number amount in each product family is calculated by " granted full rule ", preferential press " maximum granted full quantity priority rule " sorts to product family, when occurring that in product family, lot number amount is equal, then by " maximum degree of reentrancy priority rule " sequence;
Step 3, according to the ranking results of the product family of step 2, chooses the product family that right of priority is the highest;
Step 4, the workpiece in the product family the highest to right of priority, sorts based on " the earliest duration priority rule ";
Step 5, according to the workpiece sequencing result of step 4, sets up first batch of this sequence workpiece based on " granted full rule ";
Step 6, the workpiece of first that step 5 is set up batch is assigned to the available batch processor of free time of step 1;
Step 7, " scheduling end condition " judges: if do not met " scheduling end condition ", according to rolling time horizon strategy, jump to step 1, otherwise down perform;
Step 8, batch dispatching method realizing minimax delay based on product family's sequence stops.
The invention has the beneficial effects as follows, adopt a kind of batch dispatching method realizing minimax delay based on product family's sequence for Re-entrant lines, by general batch processing scheduling model " uniprocessor
|different workpieces
jtime of arrival, batch scheduling, can reentry, can not mix batching between product family
|minimax incurs loss through delay target " (that is :) resolve into model " uniprocessor
|criticize scheduling, can reentry, between product family, can not batching be mixed
|minimax incurs loss through delay target " (that is :) and model " uniprocessor
|different workpieces
jtime of arrival, product family
fin all workpiece
jprocess time is identical
|minimax incurs loss through 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 " the earliest duration priority rule ", under rolling time horizon strategy, complete enforcement task whole dispatching cycle.The present invention does not need batching and batch sequence of workpiece routine in the different product race under enforcement general case, the sequence of direct used for products race, ensureing the time complexity greatly reducing algorithm in the degree of precision situation of separating, and be all that exact algorithm realizes reentrying the real-time optimal scheduling of lower batch processor, meet semicon industry minimax and incur loss through delay target Production requirement, its concept is simple, and it is convenient to realize.
Accompanying drawing explanation
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:
Batch dispatching method realizing minimax delay based on product family's sequence provided by the present invention, first with different product race in the impact damper before batch processor of can reentrying for research object, again with workpiece in the highest product family of right of priority for research object, require that the multi-product race that batch processing equipment is processed can not mix batching, product has different time of arrival, whenever studied reentrant batch processor occur idle available time, implement batch dispatching method realizing minimax delay based on product family's sequence, the whole Real-Time Scheduling of defined is completed by rolling time horizon strategy.
With reference to figure 1, be the algorithm flow chart realizing batch dispatching method that minimax is incured loss through delay based on product family's sequence, by the batch processing scheduling model " uniprocessor of routine
|different time of arrival, batch scheduling, can reentry, can not mix batching between product family
|minimax incurs loss through delay target " (that is :) resolve into model " uniprocessor
|criticize scheduling, can reentry, between product family, can not batching be mixed
|minimax incurs loss through delay target " (that is :) and model " uniprocessor
|different time of arrival, product processing time is identical
|minimax incurs loss through delay target " (that is :); utilize " granted full rule "; " maximum granted full quantity priority rule ", " maximum degree of reentrancy priority rule " and " the earliest duration priority rule " etc. are implemented step by step, complete enforcement task whole dispatching cycle under rolling time horizon strategy.The idiographic flow realizing batch dispatching method that minimax is incured loss through delay based on product family's sequence is as follows:
Step 1, produces trigger event: a batch processor of can reentrying is in idle upstate;
Step 2, according to the piece count information of the different product race in the phase buffer before 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 batch processor anterior bumper, namely first lot number amount in each product family is calculated by " granted full rule ", preferential press " maximum granted full quantity priority rule " sorts to product family, when occurring that in product family, lot number amount is equal, then by " maximum degree of reentrancy priority rule " sequence;
Step 3, according to the ranking results of the product family of step 2, chooses the product family that right of priority is the highest;
Step 4, the workpiece in the product family the highest to right of priority, sorts based on " the earliest duration priority rule ";
Step 5, according to the workpiece sequencing result of step 4, sets up first batch of this sequence workpiece based on " granted full rule ";
Step 6, the workpiece of first that step 5 is set up batch is assigned to the available batch processor of free time of step 1;
Step 7, " scheduling end condition " judges: if do not met " scheduling end condition ", according to rolling time horizon strategy, jump to step 1, otherwise down perform;
Step 8, batch dispatching method realizing minimax delay based on product family's sequence stops.
Claims (5)
1. one kind realizes batch dispatching method of minimax delay based on product family's sequence, it is characterized in that, objective function be the minimax to dispatch batch incur loss through delay, first with different product race in the impact damper before batch processor of can reentrying for research object, then with workpiece in the highest product family of right of priority for research object; The algorithm flow realizing batch dispatching method that minimax is incured loss through delay based on product family's sequence is by the batch processing scheduling model " uniprocessor of routine
|different time of arrival, batch scheduling, can reentry, can not mix batching between product family
|minimax incurs loss through delay target " resolve into model " uniprocessor
|criticize scheduling, can reentry, between product family, can not batching be mixed
|minimax incurs loss through delay target " and model " uniprocessor
|different time of arrival, product processing time is identical
|minimax incurs loss through delay target "; Utilize granted full rule, maximum granted full quantity priority rule, maximum degree of reentrancy priority rule and the earliest duration priority rule are implemented step by step, complete enforcement task whole dispatching cycle under rolling time horizon strategy; It mainly comprises the following steps:
Step 1, produces trigger event: a batch processor of can reentrying is in idle upstate;
Step 2, according to the piece count information of the different product race in the phase buffer before 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 batch processor anterior bumper, namely first lot number amount in each product family is calculated by " granted full rule ", preferential press " maximum granted full quantity priority rule " sorts to product family, when occurring that in product family, lot number amount is equal, then by " maximum degree of reentrancy priority rule " sequence;
Step 3, according to the ranking results of the product family of step 2, chooses the product family that right of priority is the highest;
Step 4, the workpiece in the product family the highest to right of priority, sorts based on " the earliest duration priority rule ";
Step 5, according to the workpiece sequencing result of step 4, sets up first batch of this sequence workpiece based on " granted full rule ";
Step 6, the workpiece of first that step 5 is set up batch is assigned to the available batch processor of free time of step 1;
Step 7, " scheduling end condition " judges: if do not met " scheduling end condition ", according to rolling time horizon strategy, jump to step 1, otherwise down perform;
Step 8, batch dispatching method realizing minimax delay target based on product family's sequence stops.
2. batch dispatching method realizing minimax delay based on product family's sequence according to claim 1, it is characterized in that, when described granted full rule refers to and carries out workpiece batching, except the piece count in last batch is more than or equal to the minimum capacity criticized, in all the other each batch, piece count must equal the max cap. criticized.
3. batch dispatching method realizing minimax delay based on product family's sequence according to claim 1, 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 calculated under granted full rule.
4. batch dispatching method realizing minimax delay based on product family's sequence according to claim 1, it is characterized in that, when described maximum degree of reentrancy priority rule refers to and occurs equal by the lot number amount calculated under 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.
5. batch dispatching method realizing minimax delay based on product family's sequence according to claim 1, it is characterized in that, the described priority rule of duration the earliest refers to that the workpiece in the product family that priority level is the highest does not subtract principle sequence by its duration, if when occurring that the duration is equal, sort by prerequisite variable principle.
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 CN103092690A (en) | 2013-05-08 |
| CN103092690B true 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 |
|---|
| 可重入生产系统的一种新型优化调度策略;赵丽娜 等;《控制理论与应用》;20001025;第17卷(第5期);第730-734页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103092690A (en) | 2013-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103136631B (en) | Batch dispatching method of minimum total complete time is realized based on product family's sequence | |
| CN103646301B (en) | Batch dispatching system and method for furnace tube device | |
| CN108171372B (en) | Multi-variety production batch scheduling method with preparation time | |
| CN105930591A (en) | Realization method for register clustering in clock tree synthesis | |
| CN100358295C (en) | Timer scheduling method | |
| CN103034215B (en) | Based on reentried multimachine batch processing dispatching device and the method for closed-loop | |
| CN105302078A (en) | System and method for controlling furnace machine platform operation in semiconductor device manufacture technology | |
| CN101727098B (en) | Cycle time target measuring method and system | |
| CN103092690B (en) | Batch scheduling method of achieving minimum maximum delay based on product family sequencing | |
| CN101706837A (en) | Mathematical model based method for establishing database of fixture components | |
| CN110515995A (en) | Quickly generate the ETL operational method and device of big data platform | |
| Yan et al. | A case study on integrated production planning and scheduling in a three-stage manufacturing system | |
| CN103116809A (en) | Dispatch device and method of batch processing machine capable of sequencing facing product family | |
| CN102393687B (en) | Method for limiting distribution and scheduling for solving machine changing problem | |
| CN106327053B (en) | Construction method of weaving process recommendation model based on multi-mode set | |
| CN1783126A (en) | Managing system, managing method, producing method and semiconductor products | |
| CN103927689A (en) | Dispatching control method for batch processor of reentrant manufacturing system | |
| CN103870633B (en) | A kind of large scale structure rapid modeling system | |
| Eberlein et al. | A pull principle for the material supply of low-volume mixed-model assembly lines | |
| CN111539648B (en) | Automatic distribution device and method for dynamic capacity among equipment groups | |
| CN107942968B (en) | A kind of dispatching method and system of hybrid flow production | |
| CN105279605A (en) | Batch processing machine scheduling method of dynamically-changed weight | |
| CN105184500A (en) | Production line equipment allotting method and system | |
| CN106020978B (en) | A kind of execution method of time residual quantity daisy chaining table timer | |
| CN114548576A (en) | Intelligent production scheduling algorithm meeting product delivery period |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150603 Termination date: 20190122 |