CN103105837A - Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window - Google Patents

Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window Download PDF

Info

Publication number
CN103105837A
CN103105837A CN2012105642176A CN201210564217A CN103105837A CN 103105837 A CN103105837 A CN 103105837A CN 2012105642176 A CN2012105642176 A CN 2012105642176A CN 201210564217 A CN201210564217 A CN 201210564217A CN 103105837 A CN103105837 A CN 103105837A
Authority
CN
China
Prior art keywords
batch
time
stage
scheduling
centerdot
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
Application number
CN2012105642176A
Other languages
Chinese (zh)
Other versions
CN103105837B (en
Inventor
贾文友
江志斌
李友
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Jiao Tong University
Original Assignee
Shanghai Jiao Tong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Jiao Tong University filed Critical Shanghai Jiao Tong University
Priority to CN201210564217.6A priority Critical patent/CN103105837B/en
Publication of CN103105837A publication Critical patent/CN103105837A/en
Application granted granted Critical
Publication of CN103105837B publication Critical patent/CN103105837B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种基于可变时间窗实施两级混合优化批处理调度的方法，利用复杂问题的分解法则，目标是最小总的加权拖延时间，实施两阶段混合控制：第一阶段基于多规则组合自适应原理建立实时控制平台，采用可变时间窗滚动时域法获得批组合的实时参数等；第二阶段基于松弛方法，建立松弛化的线性整数数学模型，通过.NET和ILOG CPLEX商业化软件联合引擎求解，实现获得批排序的优化顺序。两个阶段分别解决批调度问题中组批和将所组批排序，并考虑批处理机的多重入性质，通过可变时间窗滚动时域法，满足被加工的工件批的动态实时调度特性。本发明综合考虑调度精度和CPU运行时间，实现可重入下批处理机的实时最优调度，利于半导体行业等推广应用。

Figure 201210564217

A method of implementing two-level hybrid optimal batch scheduling based on variable time windows, using the decomposition rules of complex problems, the goal is to minimize the total weighted delay time, and implementing two-stage hybrid control: the first stage is based on the principle of multi-rule combination self-adaptation Establish a real-time control platform, use the variable time window rolling time domain method to obtain real-time parameters of batch combination, etc.; the second stage is based on the relaxation method, establish a relaxed linear integer mathematical model, and solve it through the joint engine of .NET and ILOG CPLEX commercial software , to achieve an optimized order for obtaining batch sorts. The two phases solve the batch scheduling problem of grouping and sorting the batches respectively, and consider the multi-entry nature of the batch processor, and satisfy the dynamic real-time scheduling characteristics of the processed workpiece batches through the variable time window rolling time domain method. The invention comprehensively considers scheduling accuracy and CPU running time, realizes real-time optimal scheduling of reentrant batch processors, and is beneficial to popularization and application in the semiconductor industry and the like.

Figure 201210564217

Description

Implement the method for two-stage hybrid optimization batch processing scheduling based on the variable time window
Affiliated technical field
The present invention relates to the control method of batch processes scheduling, refer in particular to a kind of method of implementing two-stage hybrid optimization batch processing scheduling based on the variable time window.
Background technology
In semi-conductor chip is made, the batch processors such as boiler tube district scheduling is a typical NP-hard problem in scheduling and control, it is restricting the Whole Performance of semi-conductor manufacturing system, and the rational management control research of carrying out batch processor place is significant to the performance of improving the semiconductor core slice assembly line.
At present, for the batch processes scheduling, there are the precision of scheduling and contradiction working time of dispatching algorithm, can separate extensive NP-hard problem as heuritic approach, can obtain within reasonable time feasible solution, but the precision of separating is difficult to reach requirement sometimes; Linear integer mathematics Accurate Model method for solving because CPU limits working time, can not get optimum solution in the certain limitation time finding the solution extensive NP-hard problem; Semicon industry multiple enters the difficulty that characteristic further increases the batch processes scheduling in addition.
Summary of the invention
For the technical matters that exists in above-mentioned prior art, the invention provides a kind of method of implementing two-stage hybrid optimization batch processing scheduling based on the variable time window, overcome multiple enter the scheduling of semiconductor batch processor production run otherwise precision is low, the deficiency of the long operational time of dispatching algorithm etc., and multiplely enter the problem that characteristic increases the scheduling difficulty.
It is as follows that the present invention specifically solves the technical scheme that its technical matters adopts:
A kind of method of implementing two-stage hybrid optimization batch processing scheduling based on the variable time window, utilize the decomposition method principle of challenge, be that the time-based series model decomposes, resolve into several continuous variable time windows, during based on rolling, domain policy is controlled in real time, stall for time as target take the total weighting of minimum in each time window, implement two stage hybrid optimizations and control.Here " time window " loading time of being defined as adjacent twice idle available batch processor is spaced apart a time window, because appearring in parallel batch processor, do not fix free time, the moment that causes being loaded is not fixed, so the length of time window is not definite value, is namely the variable time window.Phase one sets up based on more rules combination adaptive principle and controls in real time platform, adopt rolling time domain method under the variable time window to obtain processed workpiece and criticize concrete operation process time, operation excess time, due date, the priority that product is criticized and the real-time parameters such as batch combination of criticizing principle formation according to certain group form data basd link and receive subordinate phase; Subordinate phase is based on relaxation method, set up the linear integer mathematical model of laxization, find the solution by .NET and ILOG CPLEX commercial software associating engine, realize obtaining the optimization order of batch sequence, and with result feedback to the phase one so that the phase one load priority the highest batch to available batch processor of free time.How two stages organizes in batch scheduling problem batch and how with batch sequence of institute group if solving respectively, multiple to enter character considered, by the rolling time domain method under the variable time window, satisfies the dynamic Real-Time Scheduling characteristic that processed workpiece is criticized.
Phase one can obtain processed workpiece and criticize concrete operation process time, operation excess time, due date, the priority that product is criticized and the real-time parameters such as batch combination of criticizing principle formation according to certain group, form database, offer subordinate phase and find the solution, the concrete steps that its circulation is carried out:
Step 1, upper available batch processor of a free time just has been loaded complete, initialization time window, the phase one strategy brings into operation;
Step 2 is obtained the batch processor running status that is scheduled, and obtains workpiece quantity and affiliated product family information in the batch processor anterior bumper that is scheduled;
Step 3, a batch processor free time is available when having, produce trigger event, this free time, available batch processor was in wait, the real-time control platform of phase one is organized batch immediately, exports current processed workpiece and criticizes concrete operation process time, operation excess time, due date, the priority that product is criticized, and building database, offer subordinate phase; When subordinate phase feeds back to the phase one with the highest the criticizing of all to be processed batch of medium priorities, the phase one will criticize in the idle available batch processor that is loaded into wait, and a time window scheduling is complete;
Step 4, end condition are that the general plan production run is complete dispatching cycle, if satisfy end condition, stop immediately, otherwise iteration turn back to step 1.
Set up the linear integer mathematical model of laxization and find the solution concrete steps:
Step 1 is set up being connected of outside programming language .NET and ILOG CPLEX commercial software, and externally programming language is introduced ILOG.CPLEX.dll and ILOG.Concert.dll two spaces;
Step 2 is stalled for time as under target in the total weighting of minimum, sets up based on lax linear mixed-integer mathematical model:
Target
ΣT = Σ i = 1 h w i * max [ ( C i - d i ) , 0 ]
Constraint condition
C i = t + ( Positionarray ( i ) - 1 ) × P h ‾ + P i + RP i ; ∀ i ∈ { 1,2 , · · · , h }
P h ‾ = ( Σ i = 1 h P i ) / h
RP i = Σ q = r i + 1 S j P qj ; ∀ i ∈ { 1,2 , · · · , h } ; ∀ j ∈ { 1,2 , · · · , J }
Positionarray(i)∈{1,2,…,h};
Figure BDA00002633635800036
Ifi≠lthen?Positionarray(i)≠Positionarray(l);
Here t represents that current scheduling constantly; H is illustrated in the total lot amount numbers to be scheduled such as reentry batch processor place; w iRepresent i batch weight; C iRepresent the deadline that i criticizes; d iRepresent i batch delivery date; RP iRepresent that i criticizes the residue process time in the batch processing back; P iRepresent i batch of process time in batch processor; S jThe technique total step number that represents j product; r iBe illustrated in the technique number of product j in the reentry batch processor; P qjRepresent j product the required process time of q technique; J is illustrated in different product quantity in the batch processor of can reentrying;
Figure BDA00002633635800038
Be illustrated in the total lot amounts to be scheduled such as reentry batch processor place and count the average activity time of h; The majorizing sequence position is one-dimension array, can be expressed as: Positionarray (1), and Positionarray (2) ..., Positionarray (i) ..., Positionarray (h);
Step 3 is fetched data from database read, i.e. the database that provides of rolling lower phase one of time domain method under variable time window;
Step 4 is found the solution by .NET and ILOG CPLEX commercial software associating engine, obtains the optimal scheduling sequence, and operation result feeds back to the phase one.
The invention has the beneficial effects as follows, the algorithm that adopts the variable time window to implement the two-stage hybrid optimization decomposes extensive NP-hard problem, criticize how to organize in scheduling problem and criticize and how institute's group is criticized to sort and find the solution by two stages the simplification problem that reaches respectively, by the rolling time domain method under the variable time window, satisfy the dynamic Real-Time Scheduling characteristic that processed workpiece is criticized, consider the CPU working time of precision and the dispatching algorithm of scheduling, realize the real-time optimal scheduling of the multiple batch processor that enters to reentry down.
Description of drawings
Below in conjunction with drawings and Examples, patent of the present invention is further described.
Fig. 1 is the present invention batch processor dummy model figure that reentries;
In figure, 1. input, 2. product family one, and 3. impact damper two, and 4. the equipment group three, 5. output, 6. the equipment group four, and 7. impact damper three, the 8. j of product family, 9. the equipment group two, 10. impact damper one, 11. equipment group one;
Fig. 2 the present invention is based on the variable time window to implement process flow diagram under variable time window in the method for two-stage hybrid optimization batch processing scheduling;
Process flow diagram when Fig. 3 is the rolling of phase one of the present invention under domain policy;
Fig. 4 is that example of the present invention is implemented dummy model figure;
Fig. 5 is the operation result figure of example implementation model of the present invention.
Embodiment
Referring to Fig. 1, have the batch processing typical virtual model of reentry characteristic, mainly comprise four equipment groups: equipment group 1, equipment group 29, equipment group 34 and equipment group 46, wherein equipment group 1 is equipment group 29 upstream equipment groups; Equipment group 29 is batch processors of studying, is multimachine parallel (in the dotted line frame, not marking in figure); Equipment group 34 and equipment group 46 are equipment group 29 upstream device groups.Product stream is to being to enter from equipment group 1, from 46 outputs of equipment group.Equipment group 1 has impact damper 1 between equipment group 29 and equipment group 34, between equipment group 29 and equipment group 34, impact damper 23 is arranged, and between equipment group 29 and equipment group 4, impact damper 37 is arranged.Workpiece in impact damper 1 is from the hyperpycnal inflow of equipment group 1 and equipment group 29, and the part flow in impact damper 1 is to equipment group 29.Workpiece in impact damper 23 is from equipment group 29, and the part flow in impact damper 23 is to equipment group 34.Workpiece in impact damper 37 is from equipment group 29, and the part flow in impact damper 37 is to equipment group 46.Require in addition: the parallel equipment group of each in equipment group 29 can only be processed a kind of product family, as product family 1 ..., the j8 of product family criticizes when processed when certain product, and this batch do not allow to stop or increasing workpiece, namely seizes not allow; Parallel equipment group 29 not can with the time free time available; Equipment group 29 hunger can not occur.
Referring to Fig. 2 and Fig. 3, the specific implementation process of the method that batch processing is dispatched based on variable time window enforcement two-stage hybrid optimization provided by the present invention is as follows:
Phase one sets up based on more rules combination adaptive principle and controls in real time platform, and subordinate phase is set up the linearization integer mathematical model of laxization based on relaxation method, finds the solution by .NET and ILOG CPLEX commercial software associating engine.
Rolling time domain method under the variable time window obtains processed workpiece from the phase one and criticizes concrete operation process time, operation excess time, due date, the priority level that product is criticized and the real-time parameters such as batch combination of criticizing principle formation according to certain group, building database, offer subordinate phase and find the solution, the concrete steps that its circulation is carried out:
Step 1, upper available batch processor of a free time just has been loaded complete, initialization time window, the phase one strategy brings into operation;
Step 2 is obtained the batch processor running status that is scheduled, and obtains workpiece quantity and affiliated product family information in the batch processor anterior bumper that is scheduled;
Step 3, a batch processor free time is available when having, produce trigger event, this free time, available batch processor was in wait, the real-time control platform of phase one is organized batch immediately, export current processed workpiece criticize have operation process time, operation excess time, due date, the real-time parameters such as priority level that product is criticized, and building database, offer subordinate phase; (subordinate phase is extremely of short duration working time when subordinate phase feeds back to the phase one with the highest the criticizing of all to be processed batch of medium priorities, generally below 2 minutes, criticizing a sequence need 98 seconds as subordinate phase to there being 16) time, phase one will criticize in the idle available batch processor that is loaded into wait, and a time window scheduling is complete;
Step 4, end condition are that the general plan production run is complete dispatching cycle, if satisfy end condition, stop immediately, otherwise iteration turn back to step 1.
Set up the linear integer mathematical model of laxization and find the solution concrete steps:
Step 1 is set up being connected of outside programming language .NET and ILOG CPLEX commercial software, and externally programming language is introduced ILOG.CPLEX.dll and ILOG.Concert.dll two spaces;
Step 2 is stalled for time as under target in the total weighting of minimum, sets up based on lax linear mixed-integer mathematical model:
Target
ΣT = Σ i = 1 h w i * max [ ( C i - d i ) , 0 ]
Constraint condition
C i = t + ( Positionarray ( i ) - 1 ) × P h ‾ + P i + RP i ; ∀ i ∈ { 1,2 , · · · , h }
P h ‾ = ( Σ i = 1 h P i ) / h
RP i = Σ q = r i + 1 S j P qj ; ∀ i ∈ { 1,2 , · · · , h } ; ∀ j ∈ { 1,2 , · · · , J }
Positionarray(i)∈{1,2,…,h};
Figure BDA00002633635800057
Ifi≠lthen?Positionarray(i)≠Positionarray(l);
Figure BDA00002633635800058
Here t represents that current scheduling constantly; H is illustrated in the total lot amount numbers to be scheduled such as reentry batch processor place; w iRepresent i batch weight; C iRepresent the deadline that i criticizes; d iRepresent i batch delivery date; RP iRepresent that i criticizes the residue process time in the batch processing back; P iRepresent i batch of process time in batch processor; S jThe technique total step number that represents j product; r iBe illustrated in the technique number of product j in the reentry batch processor; P qjRepresent j product the required process time of q technique; J is illustrated in different product quantity in the batch processor of can reentrying;
Figure BDA00002633635800061
Be illustrated in the total lot amounts to be scheduled such as reentry batch processor place and count the average activity time of h; The majorizing sequence position is one-dimension array, can be expressed as: Positionarray (1), and Positionarray (2) ..., Positionarray (i) ..., Positionarray (h);
Step 3 is fetched data from database read, i.e. the database that provides of rolling lower phase one of time domain method under variable time window;
Step 4 is found the solution by .NET and ILOG CPLEX commercial software associating engine, obtains the optimal scheduling sequence, and operation result feeds back to the phase one.
Provide a kind of virtual reentried batch processor example model referring to accompanying drawing 4, have 8 kinds of dissimilar equipment group zones: PAN, AAN, SAN, ASI, MRH, DIK, GON and LPC, wherein DIK equipment group zone is research object, following view is the stretch-out view of top view.Fig. 5 is based on the method that the variable time window is implemented two-stage hybrid optimization batch processing scheduling, is having 10 to wait to dispatch concrete total run time, desired value and the optimal scheduling sequencing information of criticizing under ILOG CPLEX based on lax linear integer model under certain time window.

Claims (3)

1.一种基于可变时间窗实施两级混合优化批处理调度的方法，其特征在于，包括实施两阶段混合优化控制：第一阶段建立实时控制平台，第二阶段建立松弛化的线性整数数学模型，采用可变时间窗下的滚动时域法循环执行实时调度控制，其中：第一阶段基于多规则组合自适应原理建立实时控制平台，提供第二阶段所需的相关数据，第二阶段基于松弛方法，建立松弛化的线性整数数学模型，将第一阶段获得被加工的工件批具有工序加工时间、工序剩余时间、产品交货期，产品批的优先级别以及按照一定的组批原则形成的批组合实时参数，通过.NET和ILOG CPLEX商业化软件建立引擎求解，实现获得批排序的优化顺序，将运行结果中优先级最高批反馈给第一阶段，并立即装载到空闲可用的批处理机上，循环往复执行，直至终止条件满足。1. A method for implementing two-stage hybrid optimization batch scheduling based on variable time windows, characterized in that it includes implementing two-stage hybrid optimal control: the first stage establishes a real-time control platform, and the second stage establishes a relaxed linear integer mathematics The model adopts the rolling time domain method under the variable time window to perform real-time scheduling control in a cyclical manner. In the first stage, a real-time control platform is established based on the principle of multi-rule combination self-adaptive to provide relevant data required by the second stage. The second stage is based on The relaxation method establishes a relaxed linear integer mathematical model, and the processed workpiece batches obtained in the first stage have the processing time, remaining time of the process, product delivery date, priority level of the product batch and formed according to a certain batch principle. Combining real-time parameters in batches, building an engine solution through .NET and ILOG CPLEX commercial software, realizing the optimized order of batch sorting, feeding back the batch with the highest priority among the running results to the first stage, and immediately loading it on the available batch processing machine , execute repeatedly until the termination condition is satisfied. 2.根据权利要求1所述的基于可变时间窗实施两级混合优化批处理调度的方法，其特征在于，所述采用可变时间窗下的滚动时域法循环执行的具体步骤如下：2. the method for implementing two-stage hybrid optimization batch scheduling based on variable time windows according to claim 1, characterized in that, the specific steps of using the rolling time domain method under the variable time windows to perform circularly are as follows: 步骤1，上一个空闲可用的批处理机刚被装载完毕，初始化时间窗，第一阶段策略开始运行；Step 1, the last available batch processor has just been loaded, the time window is initialized, and the first-stage strategy starts to run; 步骤2，获取被调度批处理机运行状态，获取被调度批处理机前缓冲器里的工件数量和所属产品族；Step 2, obtain the running status of the scheduled batch processing machine, obtain the number of workpieces in the front buffer of the scheduled batch processing machine and the product family they belong to; 步骤3，当有一台批处理机空闲可用，产生触发事件，该空闲可用批处理机处于等待，第一阶段的实时控制平台立即组批，输出当前被加工的工件批具体的工序加工时间、工序剩余时间、产品交货期，产品批的优先级别实时参数，并建立数据库，提供给第二阶段；当第二阶段将所有待加工批中优先级最高的批反馈给第一阶段时，第一阶段将该批装载到等待的空闲可用批处理机上，一个时间窗调度完毕；Step 3, when there is a batch machine that is idle and available, a trigger event is generated, and the idle and available batch machine is waiting, the real-time control platform of the first stage immediately forms a batch, and outputs the specific process processing time and process of the currently processed workpiece batch The remaining time, product delivery date, real-time parameters of the priority level of the product batch, and establish a database to provide to the second stage; when the second stage feeds back the batch with the highest priority among all the batches to be processed to the first stage, the first stage loads the batch onto a waiting idle available batch machine, and a time window is scheduled; 步骤4，终止条件是总计划生产过程调度周期完毕，如果满足终止条件，立即停止，否则迭代返回到步骤1。Step 4, the termination condition is the completion of the scheduling cycle of the overall planning production process, if the termination condition is met, stop immediately, otherwise return to step 1 iteratively. 3.根据权利要求1所述的基于可变时间窗实施两级混合优化批处理调度的方法，其特征在于，所述第二阶段建立松弛化的线性整数数学模型并求解的具体步骤如下：3. the method for implementing two-stage hybrid optimization batch scheduling based on variable time windows according to claim 1, wherein the second stage sets up a relaxed linear integer mathematical model and the specific steps for solving are as follows: 步骤1，建立外部编程语言.NET与ILOG CPLEX商业化软件的连接，在外部编程语言引入ILOG.CPLEX.dll和ILOG.Concert.dll两个空间；Step 1, establish the connection between the external programming language .NET and ILOG CPLEX commercial software, and introduce two spaces of ILOG.CPLEX.dll and ILOG.Concert.dll in the external programming language; 步骤2，在最小总的加权拖延时间为目标下，建立基于松弛的线性混合整数数学模型：Step 2, with the minimum total weighted delay time as the goal, establish a linear mixed integer mathematical model based on relaxation: 目标Target ΣTΣT == ΣΣ ii == 11 hh ww ii ** maxmax [[ (( CC ii -- dd ii )) ,, 00 ]] 约束条件Restrictions CC ii == tt ++ (( PositionarrayPosition array (( ii )) -- 11 )) ×× PP hh ‾‾ ++ PP ii ++ RPRP ii ;; ∀∀ ii ∈∈ {{ 1,21,2 ,, ·· ·· ·· ,, hh }} PP hh ‾‾ == (( ΣΣ ii == 11 hh PP ii )) // hh RPRP ii == ΣΣ qq == rr ii ++ 11 SS jj PP qjqj ;; ∀∀ ii ∈∈ {{ 1,21,2 ,, ·· ·· ·· ,, hh }} ;; ∀∀ jj ∈∈ {{ 1,21,2 ,, ·&Center Dot; ·· ·· ,, JJ }} Positionarray(i)∈{1,2,…,h};
Figure FDA00002633635700028
Positionarray(i)∈{1,2,...,h};
Figure FDA00002633635700028
 Ifi≠lthen Positionarray(i)≠Positionarray(l);
Figure FDA00002633635700029
Ifi≠lthen Positionarray(i)≠Positionarray(l);
Figure FDA00002633635700029
 这里t表示当前调度时刻；h表示在重入批处理机处等待调度的总批量数；wi表示第i个批权重；Ci表示第i批的完成时间；di表示第i个批交货期；RPi表示第i批在批处理后面的剩余加工时间；Pi表示第i个批在批处理机上的加工时间；Sj表示第j个产品的工艺总步数；ri表示在重入批处理机上产品j的工艺数；Pqj表示第j个产品的的第q工艺所需的工艺时间；J表示在可重入批处理机上不同产品数量；表示在重入批处理机处等待调度的总批量数h的平均工序时间；优化序列位置为一维数组，可表示为：Positionarray(1),Positionarray(2),…,Positionarray(i),…,Positionarray(h)；Here t represents the current scheduling time; h represents the total number of batches waiting for scheduling at the re-entrant batch processor; w i represents the i-th batch weight; C i represents the completion time of the i-th batch; d i represents the i-th batch delivery delivery time; RP i represents the remaining processing time of the i-th batch after batch processing ; P i represents the processing time of the i-th batch on the batch machine; S j represents the total process steps of the j-th product; The process number of product j on the re-entrant batch machine; P qj represents the process time required for the q-th process of the j-th product; J represents the number of different products on the re-entrant batch machine; Indicates the average process time of the total number of batches h waiting to be scheduled at the re-entry batch machine; the optimized sequence position is a one-dimensional array, which can be expressed as: Positionarray(1), Positionarray(2),...,Positionarray(i),... ,Positionarray(h); 步骤3，从数据库读取数据，即可变时间窗下的滚动时域法下第一阶段提供的数据库；Step 3, read data from the database, that is, the database provided in the first stage under the rolling time domain method under the variable time window; 步骤4，通过.NET和ILOG CPLEX商业化软件联合引擎求解，获得最优调度排序，运行结果反馈给第一阶段。Step 4: Solve through the joint engine of .NET and ILOG CPLEX commercial software to obtain the optimal scheduling and sorting, and the running results are fed back to the first stage.
CN201210564217.6A 2012-12-21 2012-12-21 Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window Expired - Fee Related CN103105837B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210564217.6A CN103105837B (en) 2012-12-21 2012-12-21 Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210564217.6A CN103105837B (en) 2012-12-21 2012-12-21 Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window

Publications (2)

Publication Number Publication Date
CN103105837A true CN103105837A (en) 2013-05-15
CN103105837B CN103105837B (en) 2015-04-01

Family

ID=48313776

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210564217.6A Expired - Fee Related CN103105837B (en) 2012-12-21 2012-12-21 Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window

Country Status (1)

Country Link
CN (1) CN103105837B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103116809A (en) * 2013-01-22 2013-05-22 安徽工程大学 Dispatch device and method of batch processing machine capable of sequencing facing product family
CN112101820A (en) * 2020-10-28 2020-12-18 埃克斯工业(广东)有限公司 Two-stage flow processing scheduling method
CN112947345A (en) * 2021-03-09 2021-06-11 河海大学 Deterministic reentrant sensor workshop-oriented dynamic batch scheduling intelligent optimization method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6011798A (en) * 1997-08-15 2000-01-04 Intel Corporation Adaptive transmit rate control scheduler
WO2000075841A1 (en) * 1999-06-07 2000-12-14 Pointserve, Inc. Method and system for allocating specific appointment time windows in a service industry
CN101216710A (en) * 2007-12-28 2008-07-09 东南大学 A Self-Adaptive Selection and Dynamic Production Scheduling Control System Realized by Computer
CN101567064A (en) * 2009-05-27 2009-10-28 大连理工大学 Cold-rolled sheet whole flow contract production scheduling method
CN101609334A (en) * 2009-07-13 2009-12-23 浙江工业大学 Batch dynamic rescheduling method for multi-routes in job shop based on two-level differential evolution algorithm
CN101788819A (en) * 2010-03-08 2010-07-28 清华大学 Dispatching method based on iterative decomposition and flow relaxation in large-scale production process
CN101916404A (en) * 2010-08-06 2010-12-15 沈阳工业大学 A Multi-factory Collaborative Scheduling Optimization Method for Equipment Manufacturing Process

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6011798A (en) * 1997-08-15 2000-01-04 Intel Corporation Adaptive transmit rate control scheduler
WO2000075841A1 (en) * 1999-06-07 2000-12-14 Pointserve, Inc. Method and system for allocating specific appointment time windows in a service industry
CN101216710A (en) * 2007-12-28 2008-07-09 东南大学 A Self-Adaptive Selection and Dynamic Production Scheduling Control System Realized by Computer
CN101567064A (en) * 2009-05-27 2009-10-28 大连理工大学 Cold-rolled sheet whole flow contract production scheduling method
CN101609334A (en) * 2009-07-13 2009-12-23 浙江工业大学 Batch dynamic rescheduling method for multi-routes in job shop based on two-level differential evolution algorithm
CN101788819A (en) * 2010-03-08 2010-07-28 清华大学 Dispatching method based on iterative decomposition and flow relaxation in large-scale production process
CN101916404A (en) * 2010-08-06 2010-12-15 沈阳工业大学 A Multi-factory Collaborative Scheduling Optimization Method for Equipment Manufacturing Process

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
李衍飞 等: "半导体晶圆制造系统的时变多目标生产调度优化", 《上海交通大学学报》, no. 2, 15 February 2008 (2008-02-15), pages 209 - 213 *
李衍飞 等: "基于模糊理论的半导体制造系统时变多目标生产调度研究", 《高技术通讯》, no. 7, 15 July 2008 (2008-07-15), pages 1 - 3 *
陈新娟: "基于遗传算法的带时间窗并行多机调度问题研究", 《菏泽学院学报》, 15 March 2010 (2010-03-15), pages 23 - 25 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103116809A (en) * 2013-01-22 2013-05-22 安徽工程大学 Dispatch device and method of batch processing machine capable of sequencing facing product family
CN112101820A (en) * 2020-10-28 2020-12-18 埃克斯工业(广东)有限公司 Two-stage flow processing scheduling method
CN112101820B (en) * 2020-10-28 2021-05-04 埃克斯工业(广东)有限公司 Two-stage flow processing scheduling method
CN112947345A (en) * 2021-03-09 2021-06-11 河海大学 Deterministic reentrant sensor workshop-oriented dynamic batch scheduling intelligent optimization method
CN112947345B (en) * 2021-03-09 2022-04-01 河海大学 Deterministic reentrant sensor workshop-oriented dynamic batch scheduling intelligent optimization method

Also Published As

Publication number Publication date
CN103105837B (en) 2015-04-01

Similar Documents

Publication Publication Date Title
Jiang et al. Accuracy vs. efficiency: Achieving both through fpga-implementation aware neural architecture search
Tang et al. Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization
Tay et al. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
CN102063336B (en) A Distributed Computing Multi-Application Function Asynchronous Concurrent Scheduling Method
CN105843189B (en) A kind of efficient scheduling rule selection method for semiconductor production line based on simplified simulation model
CN105974794B (en) Discrete Production Workshop dispatching method based on improved cat swarm optimization
CN110348571A (en) A kind of neural network model training method, device, chip and system
CN106503333B (en) A three-dimensional network-on-chip test planning method
CN103309316A (en) Scheduling method of multi-stage variation hybrid flow shop with batch processor
CN102360313B (en) Performance acceleration method of heterogeneous multi-core computing platform on chip
CN103136631A (en) Batch scheduling method achieving minimum total completion time based on product family sorting
CN103034215B (en) Based on reentried multimachine batch processing dispatching device and the method for closed-loop
Behjat et al. Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times
CN103105837A (en) Method used for implementing two-stage mixing optimized batch processing scheduling and based on variable time window
CN103116809B (en) The dispatching device of the batch processor of used for products race sequence and method
Huang et al. Reentrant two-stage multiprocessor flow shop scheduling with due windows
Mousavi et al. Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times
CN115640898A (en) A Large-Scale Flexible Job Shop Scheduling Method Based on DDQN Algorithm
Zhang et al. Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem
CN115759552A (en) Multi-agent architecture-based real-time scheduling method for intelligent factory
CN104217287A (en) Multi-constraint wait-free hybrid running water scheduling modeling method based on idle matrix
CN107918806A (en) A kind of intelligent Optimization Scheduling
CN103886366B (en) Full-automatic enzyme immunity instrument operation dispatching method based on particle cluster algorithm
Niedermayer et al. A simulation-based analysis of the cycle time of cluster tools in semiconductor manufacturing
CN113053476A (en) Method and system for improving utilization rate of planar material during cutting

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: 20150401

Termination date: 20181221

CF01 Termination of patent right due to non-payment of annual fee