CN103116809B - The dispatching device of the batch processor of used for products race sequence and method - Google Patents

Abstract

A batch machine scheduling device and method for product family sorting for reentrant production lines, including two sub-modules: a heuristic-based real-time scheduling simulation platform module and a relaxation-based mixed-integer linear mathematical model sorting and solving module, These two modules are executed cyclically under a variable time window based on a rolling time domain strategy. The sorting and solving module does not group batches and sort batches of workpieces in different product families in the buffer period before the batch processor, but directly optimizes the sorting of different product families; the real-time scheduling simulation platform sorts the workpieces in the product family with the highest Scheduling can be implemented with the processing capacity of the batch processor. The invention greatly reduces the time complexity of the algorithm under the condition that the accuracy of the guaranteed solution is high, and realizes the real-time optimal scheduling of reentrant batch processors, and satisfies the just-in-time production requirements of the semiconductor industry. The invention has a simple concept, is convenient to implement, and is beneficial to popularization and application in reentrant industries such as semiconductors.

Description

Batch machine scheduling device and method for product family sorting

Technical field

The invention relates to batch machine scheduling for reentrant production lines, in particular to a batch machine scheduling device and scheduling method for product family sorting for reentrant production lines.

Background technique

The re-entrant production line is a concept proposed by Professor Kumar of the United States in the late 1980s and early 1990s for the production characteristics of semiconductor chips, film and other industries, and listed it as different from Flow-shop (streamlined workshop) and The third type of re-entrant production line (re-entrant) of Job-shop (single-piece workshop), that is, when unfinished products are conveyed along the production line, it is possible to visit the same workbench several times. Batch processing means that multiple unfinished products can be processed at one time without exceeding the maximum processing capacity of the workbench. The actual processing of multiple unfinished products each time is called batch (Batch). For example, in a multi-entrant semiconductor chip production line, the processing time of batch processing machines such as the furnace tube area is generally longer than that of non-batch processing machines, requiring multi-layer reentrant processing, and batch processing machines are more expensive. The bottleneck machine of the semiconductor production system is generally a batch machine. The reasonable scheduling control of batch processors that can re-enter the production line has become an NP-hard problem in the research of scheduling and control, which restricts the overall performance of the semiconductor manufacturing system. Carrying out research on the reasonable scheduling control of batch processors is very important for improving the production line of semiconductor chips. Performance is of great significance and has always been one of the research hotspots in academia and application circles.

At present, judging from the production of semiconductor chips in my country and other countries, the speed of equipment renewal and product upgrading is very fast, and the research on scheduling methods of production lines is far behind the needs of its actual development. In the semiconductor reentrant production line, for batch machine production process scheduling, the conventional batch machine scheduling model includes: different stages of product families in the buffer in front of the batch machine (note: the product family concept is different from the product type, Assuming that the number of product types is N, and the number of times that products need to be re-entered into the batch processor is K, then the number of product families F=N. Scheduling sorts the highest priority batches to idle available batch machines. However, as the number of workpieces in the buffer in front of the batch processor continues to increase, the number of batches will also increase accordingly. This increases the scale of the scheduling problem, increases the difficulty of solving the problem, and makes the solution time longer, which ultimately affects The time complexity of the scheduling algorithm and the precision of the solution.

Contents of the invention

The present invention aims at the technical problems existing in the above-mentioned prior art, and provides a batch machine scheduling device and scheduling method for reentrant production line oriented product family sorting, which overcomes the multiple problems of the semiconductor chip production line with reentrant characteristics. In the dynamic real-time scheduling process of machine batch processing, as the number of workpieces in the buffer in front of the batch machine continues to increase, the number of batches also increases accordingly, the scale of the scheduling problem increases, and the difficulty of solving the problem increases, which makes the solution The time becomes longer, which ultimately affects the time complexity of the scheduling algorithm and the limitation of the accuracy of the solution.

The technical solution that the present invention specifically solves its technical problem adopts is:

A scheduling device for batch processing machines oriented to product family sorting. The research object is multi-machine parallel batch processing equipment groups and scheduled multi-product families. Re-entry of batch processing equipment is required to be permitted, and product families arrive dynamically, including two Two sub-modules: a heuristic algorithm-based real-time scheduling simulation platform module and a relaxation-based mixed integer linear mathematical model sorting and solving module. These two sub-modules are cyclically implemented under variable time windows through a rolling time-domain strategy.

The scheduling method of the scheduling device of the batch processing machine oriented to product family sorting includes the following steps:

Step 1, the real-time scheduling simulation platform completes the scheduling of the last available batch processor and initializes the time window;

Step 2, the real-time scheduling simulation platform records and saves information such as the number of workpieces of different product families in the buffer period before the batch machine in real time, and records and saves the state information of the batch machine in real time;

Step 3, generate a real-time scheduling simulation platform data output trigger event: one of the batch processors is in an idle and available state, and the batch processor is set to a waiting state;

Step 4, Judgment: If the number of available product families is only one type, do not run the sorting and solving module based on the relaxation-based mixed integer linear mathematical model for product family sorting, and skip to step 8; if the number of available product families is more than 1 Types, execute down;

Step 5, updating the information about the quantity of different product families in the buffer in the database linked to the slack-based mixed integer linear mathematical model;

Step 6, run the relaxation-based mixed integer linear mathematical model module, and output the product family one-dimensional sorting array optimized under the specified objective function;

Step 7: Generating a trigger event for the real-time scheduling simulation platform to schedule batch machines in a waiting state: the information of the product family with the highest priority is fed back to the real-time scheduling simulation platform;

Step 8, execute the scheduling event to the batch machine in the waiting state, and update and save the workpiece information of the corresponding product family in the buffer period before the batch machine according to the relevant information of the scheduled product family;

Step 9, terminate the current time window;

Step 10, program termination judgment: if all scheduling plans have not been completed, jump to step 1 according to the rolling time domain strategy, otherwise continue to execute;

Step 11, the scheduling of the scheduling device of the batch processor oriented to product family sorting is terminated.

Regarding the slack-based mixed-integer linear mathematical model module in the scheduling device of the batch machine for product family sorting, with the minimum total weighted delay time as the goal, the following slack-based mixed-integer linear mathematical model is established:

Target

$\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; u</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; \&times;</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; a</span>}\mathrm{<span\; class="notranslate">\; x</span>}<span\; class="notranslate">\; \&lsqb;</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; C</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; \&rsqb;</span>$

Restrictions

u _f ＝w _f ×b _f ×x _f ; take any f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Positionarray(f)∈{1,2,…,F}; arbitrary f∈{1,2,…,F}

If f≠l then Positionarray(f)≠Positionarray(l); take f and l∈{1,2,…,F} arbitrarily

$\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}}<span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span><span\; class="notranslate">\; (</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span>$

$C_f=t+\left(Po\mathrm{the\; s}itio\mathrm{no}arra\mathrm{the\; y}\right(f)-1)\&times;\stackrel{\&OverBar;}{P_f}+P_f+{\mathrm{RP}}_f;$ Arbitrarily take f∈{1,2,…,F}

Here t represents the current scheduling time; F represents the number of different product families on the reentrant batch processor; f represents the fth product family among all the different product families at the reentrant batch machine; u _f represents the fth product family w _f represents the weight influence coefficient of the f-th product family; b _f represents the full-batch influence coefficient of the f-th product family; x _f represents whether there is 0 of the f-th product family in the buffer at time t, 1 variable influence coefficient; B _max represents the maximum processing capacity of the batch machine; B _min represents the minimum processing scale of the batch machine; Indicates rounding up; Represents rounding down; C _f represents the completion time of the fth product family; n _f represents the number of the fth product family in the buffer at time t; d _f represents the delivery date of the fth product family; RP _f represents the The remaining processing time of the f product family after batch processing; P _f represents the processing time of the f product family on the batch machine; S _f represents the total number of process steps of the _f product family; The process number of the fth product family on the processor; P _qf represents the process time required for the qth process of the fth product family; Indicates the average process time of the total number of product families F waiting to be scheduled at the re-entry batch machine; the optimal sequence position of the product family is a one-dimensional array, which can be expressed as: Positionarray(1), Positionarray(2),...,Positionarray(f ),..., Positionarray(F).

The beneficial effect of the present invention is that a batch machine scheduling device and scheduling method for reentrant production line oriented to product family sorting are adopted, implemented under different trigger events through three levels, and directly facing the front of the batch machine The different product families in the buffer period are optimized and sorted, and the workpieces in the product family with the highest priority are scheduled according to the processing capacity of the idle and available batch machines. There is no need to implement conventional batching and batch sorting of workpieces in different product families. The time complexity of the algorithm is greatly reduced while the high accuracy of the solution is guaranteed, and the real-time optimal scheduling of reentrant batch processors can be realized to meet the just-in-time (JIT) production requirements of the semiconductor industry. It is simple in concept and easy to implement.

Description of drawings

Fig. 1 is the virtual model diagram of reentrant batch processor of the present invention;

In the figure, 1. input, 2. equipment group MG ¹ , 3. equipment group MG ⁴ , 4. buffer one, 5. reentrant flow, 6. product family one, 7. equipment group MG ² , 8. product family j , 9. Buffer Two, 10. Device Group MG ³ , 11. Output

Fig. 2 is the algorithm flowchart of the present invention facing product family sorting;

Fig. 3 is a virtual model diagram of an example implementation of the present invention;

Fig. 4 is a diagram of the running results of the exemplary implementation model of the present invention.

detailed description

Below in conjunction with accompanying drawing and embodiment the patent of the present invention is described further:

The batch processor scheduling device and method for product family sorting provided by the present invention, the research object is a multi-machine parallel batch processing equipment group and a scheduled multi-product family, and it is required that the product reentry of the batch processing equipment is permitted, and the product dynamics arrive.

Referring to Figure 1, it is a typical virtual model of batch processing with reentrant characteristics, mainly including four device groups: MG ¹ device group 2, MG ² device group 7, MG ³ device group 10 and MG ⁴ device group 3, where MG ¹ Equipment group 2 and MG ⁴ equipment group 3 constitute a reentrant processing, which is not our research object. MG ¹ equipment group 2 is the upstream equipment group of MG ² equipment group 7; MG ² equipment group 7 is the batch processor studied, which is Multiple machines in parallel, for example, MG ² ₁ equipment group, MG ² ₂ equipment group, ..., MG ² _m equipment group (in the dotted line box in the figure, not marked), re-entrant processing is allowed, such as re-entrant flow 5; MG ³ equipment Group 10 is the MG ² device group 7 downstream device group. The product flow direction is first input 1 to MG ¹ equipment group 2, and finally output 11 from MG ³ equipment group 10. There is a buffer one 4 between the equipment group 2 of MG ¹ and the equipment group 7 of MG ² , and there is a buffer two 9 between the equipment group 2 of MG ² and the equipment group 10 of MG ³ . Workpieces in buffer one 4 come from MG ¹ equipment group 2 and reentrant flow 5, and workpieces in buffer one 4 flow to MG ² equipment group 7. The workpieces in buffer two 9 come from MG ² equipment group 7 , and the workpieces in buffer two 9 flow to MG ³ equipment group 10 . Some workpieces of MG ¹ equipment group 2 flow to MG ⁴ equipment group 3, and MG ⁴ equipment group 3 finishes processing, and then return to MG ¹ equipment group 2, which also forms a reentrant characteristic (note: not our research object). Additional requirements: Each MG ² ₁ equipment group, MG ² ₂ equipment group, ..., MG ² _m equipment group in MG ² equipment group 7 can only process one product family, such as product family one 6, ... product family j8 ; When a batch of a product family is being processed, the batch is not allowed to stop or add workpieces, that is, preemption is not allowed; MG ² equipment group 7 will not be starved.

Referring to Figure 2, it is an algorithm flow chart for product family sorting, which includes two sub-modules: a heuristic algorithm-based real-time scheduling simulation platform module and a relaxation-based mixed integer linear mathematical model sorting and solving module. The strategy is cyclically implemented under the variable time window. In each variable time window, different trigger events are not implemented at three levels: the first level generates an output trigger event "one of the batch processors is idle and available" , the real-time scheduling simulation platform updates and links to the database information about product families in the buffer in the relaxation-based mixed integer linear mathematical model based on information such as the number of workpieces of different product families in the buffer period before the batch machine; the second level, Run the slack-based mixed integer linear mathematical model module to output the optimized one-dimensional sorting matrix of product families; the third level is to generate real-time scheduling simulation platform scheduling trigger events of batch machines in waiting state: information feedback of product families with the highest priority For the real-time scheduling simulation platform, execute the scheduling event to the batch machine in the waiting state, and update and save the workpiece information of the corresponding product family in the buffer period before the batch machine according to the relevant information of the scheduled product family, oriented to the product family The flow process of the scheduling method of the scheduling device of the sorted batch processor is as follows:

Step 1, the real-time scheduling simulation platform completes the scheduling of the last available batch processor and initializes the time window;

Step 2, the real-time scheduling simulation platform records and saves information such as the number of workpieces of different product families in the buffer period before the batch machine in real time, and records and saves the state information of the batch machine in real time;

Step 3, generate a real-time scheduling simulation platform data output trigger event: one of the batch processors is in an idle and available state, and the batch processor is set to a waiting state;

Step 4, Judgment: If the number of available product families is only one type, do not run the sorting and solving module based on the relaxation-based mixed integer linear mathematical model for product family sorting, and skip to step 8; if the number of available product families is more than 1 Types, execute down;

Step 5, updating the information about the quantity of different product families in the buffer in the database linked to the slack-based mixed integer linear mathematical model;

Step 6, run the relaxation-based mixed integer linear mathematical model module, and output the product family one-dimensional sorting array optimized under the specified objective function;

Step 7: Generating a trigger event for the real-time scheduling simulation platform to schedule batch machines in a waiting state: the information of the product family with the highest priority is fed back to the real-time scheduling simulation platform;

Step 8, execute the scheduling event to the batch processor in the waiting state, and update and save the workpiece information of the corresponding product family in the buffer period before the batch processor according to the relevant information of the scheduled product family;

Step 9, terminate the current time window;

Step 10, program termination judgment: if all scheduling plans have not been completed, jump to step 1 according to the rolling time domain strategy, otherwise continue to execute;

Step 11, the scheduling of the scheduling device of the batch processor oriented to product family sorting is terminated.

The slack-based mixed integer linear mathematical model module in the scheduling device of a batch processing machine oriented to product family sorting referred to by the present invention is to establish the following slack-based mixed linear integer with the minimum total weighted delay time as the goal mathematical model:

Target

$\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; u</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; \&times;</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; a</span>}\mathrm{<span\; class="notranslate">\; x</span>}<span\; class="notranslate">\; \&lsqb;</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; C</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; \&rsqb;</span>$

Restrictions

u _f ＝w _f ×b _f ×x _f ; take any f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Arbitrarily take f∈{1,2,…,F}

Positionarray(f)∈{1,2,…,F}; arbitrary f∈{1,2,…,F}

If f≠l then Positionarray(f)≠Positionarray(l); any fandl∈{1,2,…,F}

$\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}}<span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span><span\; class="notranslate">\; (</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span>$

$C_f=t+\left(Po\mathrm{the\; s}itio\mathrm{no}arra\mathrm{the\; y}\right(f)-1)\&times;\stackrel{\&OverBar;}{P_f}+P_f+{\mathrm{RP}}_f;$ Arbitrarily take f∈{1,2,…,F}

Here t represents the current scheduling time; F represents the number of different product families on the reentrant batch processor; f represents the fth product family among all the different product families at the reentrant batch machine; u _f represents the fth product family w _f represents the weight influence coefficient of the f-th product family; b _f represents the full-batch influence coefficient of the f-th product family; x _f represents whether there is 0 of the f-th product family in the buffer at time t, 1 variable influence coefficient; B _max represents the maximum processing capacity of the batch machine; B _min represents the minimum processing scale of the batch machine; Indicates rounding up; Represents rounding down; C _f represents the completion time of the fth product family; n _f represents the number of the fth product family in the buffer at time t; d _f represents the delivery date of the fth product family; RP _f represents the The remaining processing time of the f product family after batch processing; P _f represents the processing time of the f product family on the batch machine; S _f represents the total number of process steps of the _f product family; The process number of the fth product family on the processor; P _qf represents the process time required for the qth process of the fth product family; Indicates the average process time of the total number of product families F waiting to be scheduled at the re-entry batch machine; the optimal sequence position of the product family is a one-dimensional array, which can be expressed as: Positionarray(1),Positionarray(2),…,Positionarray(f ),..., Positionarray(F).

The main implementation steps of the relaxation-based mixed integer linear mathematical model module are as follows:

Step 1, establish the connection between the external programming language .NET and ILOGCPLEX commercial software, and introduce two spaces of ILOG.CPLEX.dll and ILOG.Concert.dll in the external programming language;

Step 2, with the minimum total weighted delay time as the goal, establish the above-mentioned relaxation-based mixed integer linear mathematical model;

Step 3, read the information data about the product family in the buffer from the database linked to the slack-based mixed integer linear mathematical model, that is, obtain the database information provided by the real-time scheduling simulation platform under the rolling time domain method under the variable time window ;

Step 4: Solve through the joint engine of .NET and ILOGCPLEX commercial software to obtain the optimal product family scheduling and sorting one-dimensional array of the batch machine oriented to product family sorting, and feed back the running results to the real-time scheduling simulation platform.

Referring to accompanying drawing 3, a virtual reentrant batch machine example model is given, which has 8 different types of device group areas: PAN, AAN, SAN, ASI, MRH, DIK, GON and LPC, where DIK device group area is the research object, and the view below is an expanded view of the view above. Figure 4 is a batch machine scheduling device and method based on product family sorting. Under the rolling time domain strategy, there are 8 product families to be scheduled (about 128 in total) based on the relaxation mixed integer linear model in a certain time window under the ILOGCPLEX solution. The specific total running time of workpiece) is 0.06 seconds, the target value is 249 computing units and the optimal scheduling and sorting information is a one-dimensional array (5,7,8,1,2,6,3,4), and the highest priority is the 4th For each product family, the real-time scheduling simulation platform schedules the workpieces of the fourth product family to be processed according to the available batch processing capacity and the actual number of workpieces of the fourth product family.

Claims (3)

1. A dispatching device and method for a batch machine facing product family sorting, comprising two submodules: a real-time dispatching simulation platform module based on a heuristic algorithm and a sorting and solving module based on a relaxed mixed integer linear mathematical model, characterized in that, The real-time scheduling simulation platform module based on the heuristic algorithm collects different product family information and status information of the batch machine in the buffer in front of the batch machine, and dispatches workpieces in the product family with the highest priority to an available idle batch machine; The sorting and solving module of the mixed integer linear mathematical model based on relaxation sorts the different product families in the buffer in front of the batch machine according to the specified objective function and sorts them by product family; through the rolling time domain strategy, it is cyclically implemented under the variable time window. In a variable time window, different trigger events are implemented at three levels: at the first level, the output trigger event "one of the batch processors is idle and available" is generated, and the real-time scheduling simulation platform is based on the buffer period in front of the batch processor. The update of the workpiece quantity information of different product families in the buffer is linked to the database information about the product family in the buffer in the slack-based mixed integer linear mathematical model; the second level runs the slack-based mixed integer linear mathematical model module, and outputs the optimized Product family one-dimensional sorting matrix; the third level, triggering events that generate real-time scheduling simulation platform scheduling batch processors in waiting state: the information of the product family with the highest priority is fed back to the real-time scheduling simulation platform, and the execution is directed to the waiting state batch processing machine The scheduling event, and update and save the workpiece information of the corresponding product family in the buffer period before the batch machine according to the relevant information of the scheduled product family, including the following steps: Step 1, the real-time scheduling simulation platform completes the scheduling of the last available batch processor and initializes the time window; Step 2, the real-time scheduling simulation platform records and saves the workpiece quantity information of different product families in the buffer period before the batch processor in real time, and records and saves the status information of the batch processor in real time; Step 3, generate a real-time scheduling simulation platform data output trigger event: one of the batch processors is in an idle and available state, and the batch processor is set to a waiting state; Step 4, Judgment: If the number of available product families is only one type, do not run the sorting and solving module based on the relaxation-based mixed integer linear mathematical model for product family sorting, and skip to step 8; if the number of available product families is more than 1 Types, execute down; Step 5, updating the information about the quantity of different product families in the buffer in the database linked to the slack-based mixed integer linear mathematical model; Step 6, run the relaxation-based mixed integer linear mathematical model module, and output the product family one-dimensional sorting array optimized under the specified objective function; Step 7: Generating a trigger event for the real-time scheduling simulation platform to schedule batch machines in a waiting state: the information of the product family with the highest priority is fed back to the real-time scheduling simulation platform; Step 8, execute the scheduling event to the batch machine in the waiting state, and update and save the workpiece information of the corresponding product family in the buffer period before the batch machine according to the relevant information of the scheduled product family; Step 9, terminate the current time window; Step 10, program termination judgment: if all scheduling plans have not been completed, jump to step 1 according to the rolling time domain strategy, otherwise continue to execute; Step 11, the scheduling of the scheduling device of the batch processor oriented to product family sorting is terminated. 2. the dispatching device and the method of the batch processing machine facing product family sorting according to claim 1, it is characterized in that, based on the relaxed mixed integer linear mathematical model sorting and solving module, under the minimum total weighted delay time as the target, Build a relaxation-based mixed-integer linear mathematical model: Target $\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}\mathrm{<span\; class="notranslate">\; T</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; u</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; \&times;</span>\mathrm{<span\; class="notranslate">\; m</span>}\mathrm{<span\; class="notranslate">\; a</span>}\mathrm{<span\; class="notranslate">\; x</span>}<span\; class="notranslate">\; \&lsqb;</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; C</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ,</span>\mathrm{<span\; class="notranslate">\; 0</span>}<span\; class="notranslate">\; \&rsqb;</span>$ Restrictions u _f ＝w _f ×b _f ×x _f ; take any f∈{1,2,…,F} Arbitrarily take f∈{1,2,…,F} Arbitrarily take f∈{1,2,…,F} Arbitrarily take f∈{1,2,…,F} Arbitrarily take f∈{1,2,…,F} Positionarray(f)∈{1,2,…,F}; arbitrary f∈{1,2,…,F} If f≠l then Positionarray(f)≠Positionarray(l); take f and l∈{1,2,…,F} arbitrarily $\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}}<span\; class="notranslate">\; =</span><span\; class="notranslate">\; (</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span><span\; class="notranslate">\; (</span>\underset{\mathrm{<span\; class="notranslate">\; f</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; f</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; x</span>}}_{\mathrm{<span\; class="notranslate">\; f</span>}}<span\; class="notranslate">\; )</span>$ $C_f=t+\left(Po\mathrm{the\; s}itio\mathrm{no}arra\mathrm{the\; y}\right(f)-1)\&times;\stackrel{\&OverBar;}{P_f}+P_f+{\mathrm{RP}}_f;$ Arbitrarily take f∈{1,2,…,F} Here t represents the current scheduling moment; F represents the number of different product families on the reentrant batch processor; f represents the fth product family among all the different product families at the reentrant batch machine; u _f represents the fth product family w _f represents the weight influence coefficient of the f-th product family; b _f represents the full-batch influence coefficient of the f-th product family; x _f represents whether there is 0 of the f-th product family in the buffer at time t, 1 variable influence coefficient; B _max represents the maximum processing capacity of the batch machine; B _min represents the minimum processing scale of the batch machine; Indicates rounding up; Represents rounding down; C _f represents the completion time of the fth product family; n _f represents the number of the fth product family in the buffer at time t; d _f represents the delivery date of the fth product family; RP _f represents the The remaining processing time of the f product family after batch processing; P _f represents the processing time of the f product family on the batch machine; S _f represents the total number of process steps of the _f product family; The process number of the f-th product family on the processor; P _qf represents the process time required for the q-th process of the f-th product family; P _F represents the average of the total number of product families F waiting for scheduling at the re-entrant batch processor Process time; the product family optimization sequence position is a one-dimensional array, which can be expressed as: Positionarray(1), Positionarray(2),…,Positionarray(f),…,Positionarray(F). 3. the dispatching device and the method of the batch processor facing product family sorting according to claim 1, it is characterized in that, based on the relaxed mixed integer linear mathematical model sorting and solving module, the implementation steps are as follows: Step 1, establish the connection between the external programming language .NET and ILOGCPLEX commercial software, and introduce two spaces of ILOG.CPLEX.dll and ILOG.Concert.dll in the external programming language; Step 2, with the minimum total weighted delay time as the goal, establish the above-mentioned relaxation-based mixed integer linear mathematical model; Step 3, read the information data about the product family in the buffer from the database linked to the slack-based mixed integer linear mathematical model, that is, obtain the database information provided by the real-time scheduling simulation platform under the rolling time domain method under the variable time window ; Step 4: Solve through the joint engine of .NET and ILOGCPLEX commercial software to obtain the optimal product family scheduling and sorting one-dimensional array of the batch machine oriented to product family sorting, and feed back the running results to the real-time scheduling simulation platform.