CN101364107A - Dynamic dispatching method with prediction in complex large system environment - Google Patents
Dynamic dispatching method with prediction in complex large system environment Download PDFInfo
- Publication number
- CN101364107A CN101364107A CNA2008102003916A CN200810200391A CN101364107A CN 101364107 A CN101364107 A CN 101364107A CN A2008102003916 A CNA2008102003916 A CN A2008102003916A CN 200810200391 A CN200810200391 A CN 200810200391A CN 101364107 A CN101364107 A CN 101364107A
- Authority
- CN
- China
- Prior art keywords
- dynamic dispatching
- equipment
- worker
- system environment
- scheduling
- 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.)
- Pending
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]
Abstract
The invention relates to a predictable dynamic scheduling method under a complex large-scale system environment and aims to provide a scheduling method which mainly solves the problems of calculation difficulty and lack of global optimization in the prior workshop operation scheduling method. Based on the working procedure global static scheduling and by further scheduling the static scheduling result according to the actual conditions, the method enables the actual processing condition of the workshop to be as close as possible to the work order schedule optimization proposal, provides different optimization regulation strategies in regard to different events according to the working procedure constraining conditions, and generates the dispatching command and the early-warning signal. Additionally, since the global static scheduling periodically dispatches the order sheets in advance to the workshop, a scheduler can predict a part of the information about the unreleased work pieces. The method can make full use of the prediction to the future information at each decision moment. Compared with the prior unpredictable dynamic algorithm, the method can improve the global performance, ensure that the equipment allocation is more reasonable, reduce the production cost and increase the enterprise benefit.
Description
Technical field:
The present invention relates to a kind of dynamic dispatching method plant working, especially under the complex large system environment prediction dynamic dispatching method arranged.
Background technology:
Shop operation dynamic dispatching has very important effect in industries such as modern mechanical manufacturing, processing.It realizes fine-grained management for enterprise, under the situation of ensuring the quality of products, presses the order constraint delivery just-in-time at delivery date, becomes the principal element of decision market competitiveness of enterprises.
Shop operation dynamic dispatching is according to current factory resources situation, formulates scheduling scheme in real time for the equipment that can process, provides the processing priority of current worker's list to be processed on equipment, and the optimum worker of further preferential selection singly processes on equipment.Dynamic dispatching is meant that operation enters state to be processed successively, and various operations constantly enter system and accept processing, also will consider in the operating environment dynamic disturbances that constantly occurs, the damage of, equipment overtime as the processing of operation etc.Therefore, dynamic dispatching will constantly be dispatched according to the situation of operation, equipment etc. in the system.And the discrete often manufacturing type of the type of actual schedule, and be dynamic change.
For solve job shop scheduling problems, if global information is complete constantly in decision-making, plant working transfer system can adopt state algorithm to carry out the overall situation and once dispatch.Static exact algorithm can be realized global optimum's scheduling in theory, but because problem is NP-Hard, when problem scale increases, has the intractability that calculates.If in following constantly information the unknown of decision-making, then the Job Shop Scheduling system can only adopt dynamic dispatching algorithm.And dynamic dispatching algorithm (as rule-based scheduling) is a heuritic approach, can not realize global optimum scheduling, under many circumstances even can not assess final overall scheduling.
Therefore some researchers propose the method that static scheduling and dynamic dispatching combine, combine etc. as rolling scheduling and passive scheduling, initial overall static scheduling can carry out overall scheduling to the workpiece in a period of time, makes scheduling result have the global optimization meaning on the macroscopic view.And when dynamic dispatching,, do further scheduling according to the result of static scheduling.Because overall static scheduling regularly discharges order in advance to the workshop, makes scheduler can predict the information of part no show workpiece.The dynamic dispatching algorithm that prediction arranged makes full use of prediction to following information constantly in each decision-making, and the dynamic algorithm that not have relatively to predict can improve the overall performance of scheduling.
Summary of the invention:
The object of the present invention is to provide has a prediction dynamic dispatching method under a kind of complex large system environment, mainly solve the technical matters that exists in the existing shop operation dynamic dispatching, it is data such as importing demand, stock from ERP, and according to the factory process situation, do the scheduling of real-time workshop, prevent the situation generation of all multiple constraints such as illegal processing technology, generate the Real Time Dispatching instruction.Make enterprise effectively utilize the resources of production, reduce production costs, improve the performance of enterprises.
Under a kind of complex large system environment the prediction dynamic dispatching method arranged, it is characterized in that said method comprising the steps of:
1. server from terminal obtain treat dynamic dispatching equipment group treat dynamic dispatching operation set, the dispatched time domain and the check of calculating each operation;
2. server determines to treat that dynamic dispatching operation set carries out the dynamic dispatching relative importance value, and the per pass operation is judged: be urgent operation or non-emergent operation;
3. server carries out dynamic dispatching and calculates, comprise virtually close batch, judge whether to send the worker, operation such as the state of updating the equipment, and final scheduling result fed back to terminal, to carry out devices allocation;
This step 1. in the dispatched time domain of operation refer to that operation can send the time period between carving man-hour the earliest the latest.
This step 1. in check be meant judge whether this operation has violated constraint: if, then this operation deletion from treat dynamic dispatching operation set, and insert and violated the constraint operation and gather
This step is treated scheduling operation dynamic dispatching relative importance value in 2. and is meant and is treating to treat the processing sequence that the dynamic dispatching operation is desirable on the dynamic dispatching equipment group that the operation relative importance value is high more, needs preferential processing more.
This step 2. in to judge urgent operation be meant current time on corresponding device if this operation do not send the worker, and other operation is sent the worker, then taken by other operation owing to this equipment, cause this operation to cross late processing and do not satisfy retraining, and may cause a series of consequences such as waste product generation, the judgement of urgent operation is can send carve with an empirical value man-hour the latest to compare by operation.
This step virtual described in 3. closed and batch is meant, need be to not satisfying minimum process operation in batches, carry out the virtual batch operation that closes according to the worker's relative importance value of sending of operation, promptly with single certain equipment that takies simultaneously of other worker.
The virtual operation of closing batch operation of described all participations, the manufacturing batch sum is less than maximum manufacturing batch, and processing technology is identical, and process equipment is identical, and the common factor that can dispatch time domain is not empty set.
This step judging whether described in 3. can send the worker to be meant that equipment has enough production capacities to process certain operation, and can therefore not make the equipment stand-by period whether surpass the equipment group to send worker's maximum can allow free time.
The update the equipment state of this step described in 3. is meant that equipment state is updated to from current time to operationpiston that completion all is a seizure condition constantly.
Adopt progressively accurate method among the present invention, initial overall static scheduling can carry out overall scheduling to the workpiece in a period of time, make scheduling result have the global optimization meaning on the macroscopic view, and only utilize the information of relatively determining, provide more coarse result by scheduling, avoided scheduling result to need the problem of revising in real time, and whole scheduling is based upon on the basis of operation overall situation static scheduling, according to actual conditions, result to static scheduling does further scheduling, when making factory's actual processing as far as possible near the single journey planning optimization of worker scheme, can be according to the operation restraint condition, at different incidents, provide the different strategies of optimizing and revising, generate and send worker's instruction and early warning signal, and because overall static scheduling regularly discharges order in advance to the workshop, make scheduler can predict the information of part no show workpiece, the dynamic dispatching algorithm that prediction arranged makes full use of prediction to following information constantly in each decision-making, the dynamic algorithm that relatively not have to predict can improve the overall performance of scheduling, make devices allocation more reasonable, thereby reduced production cost, improved the benefit of enterprise.
Description of drawings:
Fig. 1 is the hardware topology structural representation of realizing under the complex large system environment that the prediction dynamic dispatching method is arranged;
Fig. 2 has a prediction dynamic scheduling system schematic flow sheet under the complex large system environment in the inventive method;
Fig. 3 is dispatched time domain and the inspection process synoptic diagram that calculates each operation in the inventive method;
Fig. 4 is that operation dispatching priority degree is determined schematic flow sheet in the inventive method;
Fig. 5 is a dynamic dispatching calculation process synoptic diagram in the inventive method.
Embodiment:
Below in conjunction with drawings and Examples technical scheme of the present invention is further described.
The realization of the inventive method is based on as shown in Figure 1 hardware topology structure, server obtains information needed from each terminal and database, then at server end according to the factory process situation, do the scheduling of real-time workshop, prevent the situation generation of all multiple constraints such as illegal processing technology, generate the Real Time Dispatching instruction process, feed back to the workshop of respectively working.
When the hardware of terminal, server and database is selected, the function of client mainly is that client can adopt general PC, the small server that also can be many platform independent constitutes, its basic demand is the function that has certain calculation ability, input/output function and operation result is gone out by Network Transmission, and can accept the result of remote server computing.
The topological structure of present embodiment dynamic scheduling system as shown in Figure 1, the concrete parameter of selected hardware is:
The basic configuration of client and each terminal is:
Main frame: more than the PIII 500MHZ;
Memory capacity: more than the 256MB;
Hard drive space: more than the 20GB;
Display: 1024 * 768 true color displays, suggestion use 1280 * 1024 or higher configuration;
Disk demand: 16 times of CD-ROM or DVD-ROM that speed is above;
When plant layout is little, server end can adopt general PC, but suggestion adopts large server adapting to large-scale processing enterprise, and its basic demand is to have preferably operational performance, have the stronger data storage and the ability of maintenance, the Network Transmission efficient stable.
The basic configuration of server end is:
Main frame: more than the Celon 2.66G;
Memory capacity: more than the 1GB;
Hard drive space: more than the 160GB;
Display: 1024 * 768 true color displays, suggestion use 1280 * 1024 or higher configuration;
Disk demand: 16 times of CD-ROM or DVD-ROM that speed is above;
Database adopts the ACCESS database, also supports as Database Systems such as SQL Server simultaneously.
Under the complex large system environment prediction dynamic dispatching method arranged, as shown in Figure 2, may further comprise the steps:
1. server obtains overall static scheduling result and dynamic dispatching data, and the detail of each step is described below:
Overall situation static scheduling is server the related operation of order that sales department is accepted both, information according to the input of terminals such as warehouse portion, equipment control department, job shop, other unit of committee, according to the result that certain regular computing obtains, also can be the result that production schedule department manually imports by terminal.
The dynamic dispatching data are meant at static scheduling as a result on the basis, the past unknown message that some are determined.Mainly comprise equipment group (report in man-hour after certain equipment completion of processing in this equipment group), promptly have the operation to be processed (with the single preceding working procedure completion of processing of worker) of enough materials on this equipment group with free device
Server get treat dynamic dispatching equipment group treat dynamic dispatching operation set, the dispatched time domain and the check of calculating each operation, idiographic flow sees also Fig. 3, may further comprise the steps:
A) from treat dynamic dispatching equipment group treat unduplicatedly the dynamic dispatching operation set get an operation.
B) can dispatch time domain according to constraint calculating, this operation be carried out can sending the earliest carve and can send the latest the calculating of carving man-hour man-hour.
Be meant that operation is actual sends must be later than this constantly quarter in man-hour, makes each constraint all satisfy the quarter in man-hour of can sending the earliest of operation.Be meant that actual group of operation is carved and must make each constraint all satisfy early than this constantly man-hour the quarter in man-hour of can sending the latest of operation.These two values have embodied the abstract of constraint, directly influence the performance of algorithm.Constraint herein mainly is meant the constraint of process constraint, the inter process minimax time interval, material loading retrain constantly, can go into operation the earliest constraint constantly, the constraint such as constraint constantly that can go into operation the latest.Can send the latest the earliest to be between quarter in man-hour and can dispatch time domain.
C) can dispatch time domain according to this operation and judge whether this operation has violated constraint: if, then this operation deletion from treat the set of dynamic dispatching operation, and insert and violated constraint operation collection, so that the workshop management personnel can do suitable adjustment.Satisfy one of condition, be operation and violate constraint:
I. operation can send carve early than current time man-hour the latest.
Ii. operation can be sent the latest and be carved man-hour early than sending carve man-hour the earliest.
D) judge whether to have traveled through and treat all process steps in the dynamic dispatching operation set: if not, then get back to step b; If then continue next step.
3. server treats that dynamic dispatching operation set carries out the dynamic dispatching relative importance value and determine that judge urgent operation and non-emergent operation, the detail of each step is described below:
Defining urgent operation is, current time is not sent the worker as if this operation on corresponding device, and other operation is sent the worker, then singly taken by other worker owing to this equipment, cause this operation to cross late processing and do not satisfy constraint, and may cause a series of consequences such as waste product generation, then this operation is urgent operation.Idiographic flow sees also Fig. 4, may further comprise the steps:
A., equipment group maximum is set can allows free time, and take this as a foundation and obtain urgent operation:
Urgent operation is a relative notion, can't accurate Calculation, and can only estimate.To dynamic scheduling system, a warning that needs to be provided with from current time is an experience threshold value constantly during this period of time, satisfies 2 points:
I. alert time be provided with too smallly, will lose the warning meaning.
Ii. alert time be provided with excessively, cause the equipment plenty of time to be waited for waste.
Statistics is treated all process steps needed process time of mean value in the dynamic dispatching operation set in the present invention, as alert time, and this time period is called the equipment group sends worker's maximum can allow free time.Send worker's maximum can allow free time according to the equipment group of this setting, the per pass operation is judged: carve constantly when the man-hour of can sending the latest of operation, illustrate that then this operation is more urgent early than warning.
B. preferentially send worker's heuristic rule to obtain first grade from treat the set of dynamic dispatching operation according to urgent operation and send worker's relative importance value worker single, the height of relative importance value is consistent with urgency level, promptly can send carve more early man-hour the latest, and then relative importance value is high more.Judge that first etc. sends the foundation of worker's relative importance value operation to be:
Can send quarter＜=current time in man-hour+equipment group maximum can allow free time the latest.
Wait to dispatch worker's single action attitude dispatching priority degree and be meant and needing to wait to dispatch a kind of desirable processing sequence of operation on the equipment group of dynamic dispatching, the operation relative importance value is high more, needs preferential processing more.
C. according to the heuristic rule of First Come First Served, obtaining second grade from treat the set of dynamic dispatching operation sends worker's relative importance value worker single, the height of relative importance value goes into operation constantly consistent with overall static scheduling plan, promptly scratching man-hour carves more early, then relative importance value is high more, and the relative importance value integral body of these operations is less than the relative importance value of urgent operation.Judge that second etc. sends the foundation of worker's relative importance value operation to be: can send the operation of carving man-hour the earliest early than current time.
D. give all the other operation C grades according to plant factor maximization heuristic rule and send worker's relative importance value.Sooner or later give relative importance value according to sending carve man-hour the earliest, and the relative importance value integral body of these operations is less than preceding two class operations.
4. server carries out dynamic dispatching and calculates, comprise virtually close batch, judge whether to send the worker, operation such as the state of updating the equipment, idiographic flow sees also Fig. 5, may further comprise the steps:
A. treat in the dynamic dispatching operation set to get successively and treat the dynamic dispatching operation together according to the relative importance value height.Judge whether this operation is that C grade is sent worker's relative importance value: if then forward step g to, otherwise continue.
B. judge whether this operation needs the virtual batch operation that closes: if this operation does not satisfy minimum process in batches, and the process equipment group allows virtual close batch, then carries out the virtual batch operation that closes.Virtual closing criticized to a plurality of operations (worker is single) take same device resource simultaneously, and for example boiler plant can be processed a plurality of workers' lists under the prerequisite that satisfies the max cap. amount.The virtual batch operation that closes need be searched the operation that satisfies following condition:
I. all participate in virtual operation of closing batch operation, and the manufacturing batch sum is less than maximum manufacturing batch;
Ii. all participate in virtual operation of closing batch operation, and processing technology is identical, and process equipment is identical;
Iii. all participate in the virtual operation of criticizing of closing, and the common factor that can dispatch time domain is not empty set.
If this manufacturing batch sum for the treatment of dynamic dispatching operation itself and participating in virtual operation of closing batch is less than minimum process in batches, and this operation is second etc. to send worker's relative importance value, then forwards step g to, otherwise continuation.
C. definite this treats that the dynamic dispatching operationpiston goes into operation constantly.If this operation participates in closing batch, then this treats that the dynamic dispatching operationpiston goes into operation constantly for all participate in the zero hour that virtual operation of closing batch can be dispatched the time domain common factor.Otherwise this treats that the dynamic dispatching operationpiston goes into operation constantly for self dispatching time domain zero hour.
D. according to as far as possible short principle of equipment stand-by period, judge that this treats whether the dynamic dispatching operationpiston goes into operation constantly late excessively.If then forward step g to.The foundation of judging is: whether the worker is later than current time+equipment group in single moment of planning to go into operation is sent worker's maximum can allow free time.
E. go into operation constantly and specified process time according to operationpiston, determine the operationpiston completion constantly, judge this operation and close batch operation and whether can send the worker.Main basis for estimation is as follows:
I. be carved into the operation completion constantly when operation goes into operation, process equipment all is an idle condition, enough production capacities is promptly arranged in order to process the single and virtual batch worker's list that closes of this worker;
Ii. if do not satisfy previous condition, then judge whether and in the time range that the user allows, suitably to postpone the quitting time;
Iii. if do not satisfy previous condition, then judge whether to interrupt this operation, promptly whether this operation allows to suspend processing.
F. judge whether to send worker's success, if, state table and the job order tabulation of then updating the equipment, dynamic dispatching is calculated and is finished.It all is seizure condition constantly that equipment state is updated to from current time to operationpiston completion.The job order tabulation then goes into operation according to operationpiston and upgrades constantly with the plan completion constantly.It should be noted that interrupt operation will influence the operationpiston completion constantly, therefore need to upgrade this value; If not, continue next step.
G. judge whether to have traveled through and drive all process steps in the set of attitude scheduling operation: if then in the scheduling client feedback result, dynamic dispatching is calculated and finished; If not, then get back to step a.
Being preferred embodiment of the present invention only in sum, is not to be used for limiting practical range of the present invention.Be that all equivalences of doing according to the content of the present patent application claim change and modification, all should be technology category of the present invention.
Claims (9)
1. under the complex large system environment prediction dynamic dispatching method arranged, it is characterized in that said method comprising the steps of:
1. server from terminal obtain treat dynamic dispatching equipment group treat dynamic dispatching operation set, the dispatched time domain and the check of calculating each operation;
2. server determines to treat that dynamic dispatching operation set carries out the dynamic dispatching relative importance value, and the per pass operation is judged: be urgent operation or non-emergent operation;
3. server carries out dynamic dispatching and calculates, comprise virtually close batch, judge whether to send the worker, operation such as the state of updating the equipment, and final scheduling result fed back to terminal, to carry out devices allocation.
2. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
This step 1. in the dispatched time domain of operation refer to that operation can send the time period between carving man-hour the earliest the latest.
3. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
This step 1. in check be meant judge whether this operation has violated constraint: if, then this operation deletion from treat dynamic dispatching operation set, and insert and violated the constraint operation and gather.
4. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
This step is treated scheduling operation dynamic dispatching relative importance value in 2. and is meant and is treating to treat the processing sequence that the dynamic dispatching operation is desirable on the dynamic dispatching equipment group that the operation relative importance value is high more, needs preferential processing more.
5. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
This step 2. in to judge urgent operation be meant current time on corresponding device if this operation do not send the worker, and other operation is sent the worker, then taken by other operation owing to this equipment, cause this operation to cross late processing and do not satisfy retraining, and may cause a series of consequences such as waste product generation, the judgement of urgent operation is can send carve with an empirical value man-hour the latest to compare by operation.
6. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
This step virtual described in 3. closed and batch is meant, need be to not satisfying minimum process operation in batches, carry out the virtual batch operation that closes according to the worker's relative importance value of sending of operation, promptly with single certain equipment that takies simultaneously of other worker.
7. under a kind of complex large system environment according to claim 6 the prediction dynamic dispatching method arranged, it is characterized in that: the virtual operation of closing batch operation of described all participations, the manufacturing batch sum is less than maximum manufacturing batch, processing technology is identical, process equipment is identical, and the common factor that can dispatch time domain is not empty set.
8. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
This step judging whether described in 3. can send the worker to be meant that equipment has enough production capacities to process certain operation, and can therefore not make the equipment stand-by period whether surpass the equipment group to send worker's maximum can allow free time.
9. under a kind of complex large system environment according to claim 1 the prediction dynamic dispatching method arranged, it is characterized in that:
The update the equipment state of this step described in 3. is meant that equipment state is updated to from current time to operationpiston that completion all is a seizure condition constantly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008102003916A CN101364107A (en) | 2008-09-24 | 2008-09-24 | Dynamic dispatching method with prediction in complex large system environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008102003916A CN101364107A (en) | 2008-09-24 | 2008-09-24 | Dynamic dispatching method with prediction in complex large system environment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101364107A true CN101364107A (en) | 2009-02-11 |
Family
ID=40390504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008102003916A Pending CN101364107A (en) | 2008-09-24 | 2008-09-24 | Dynamic dispatching method with prediction in complex large system environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101364107A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102361003A (en) * | 2011-09-01 | 2012-02-22 | 上海宏力半导体制造有限公司 | Work dispatch control method and work dispatch control equipment |
| CN103000547A (en) * | 2012-11-28 | 2013-03-27 | 上海华力微电子有限公司 | Method for optimizing CDSEM (Critical Dimension Electronic Microscope) running sequence |
| CN104252654A (en) * | 2013-06-26 | 2014-12-31 | 中芯国际集成电路制造(上海)有限公司 | Equipment outage scheduling system and method |
| CN108132650A (en) * | 2016-12-01 | 2018-06-08 | 北京理工大学 | A kind of Flow Shop control method and device |
| CN109635439A (en) * | 2018-12-12 | 2019-04-16 | 新疆大学 | Network chain effect research method is produced under bumpy weather based on transmission dynamics |
| CN110955206A (en) * | 2019-11-19 | 2020-04-03 | 中通客车控股股份有限公司 | Order scheduling and distribution scheduling method and system |
| CN111103857A (en) * | 2019-12-20 | 2020-05-05 | 华南理工大学 | Real-time rescheduling method considering available processing time interval |
| CN111160723A (en) * | 2019-12-12 | 2020-05-15 | 上海大学 | Dynamic flexible job shop scheduling method |
-
2008
- 2008-09-24 CN CNA2008102003916A patent/CN101364107A/en active Pending
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102361003B (en) * | 2011-09-01 | 2016-04-13 | 上海华虹宏力半导体制造有限公司 | Send work control method and send industry control control equipment |
| CN102361003A (en) * | 2011-09-01 | 2012-02-22 | 上海宏力半导体制造有限公司 | Work dispatch control method and work dispatch control equipment |
| CN103000547A (en) * | 2012-11-28 | 2013-03-27 | 上海华力微电子有限公司 | Method for optimizing CDSEM (Critical Dimension Electronic Microscope) running sequence |
| CN103000547B (en) * | 2012-11-28 | 2015-06-10 | 上海华力微电子有限公司 | Method for optimizing CDSEM (Critical Dimension Electronic Microscope) running sequence |
| CN104252654A (en) * | 2013-06-26 | 2014-12-31 | 中芯国际集成电路制造(上海)有限公司 | Equipment outage scheduling system and method |
| CN108132650B (en) * | 2016-12-01 | 2020-03-17 | 北京理工大学 | Flow shop control method and device |
| CN108132650A (en) * | 2016-12-01 | 2018-06-08 | 北京理工大学 | A kind of Flow Shop control method and device |
| CN109635439A (en) * | 2018-12-12 | 2019-04-16 | 新疆大学 | Network chain effect research method is produced under bumpy weather based on transmission dynamics |
| CN109635439B (en) * | 2018-12-12 | 2023-05-05 | 新疆大学 | Production network linkage effect research method based on propagation dynamics in disturbance environment |
| CN110955206A (en) * | 2019-11-19 | 2020-04-03 | 中通客车控股股份有限公司 | Order scheduling and distribution scheduling method and system |
| CN110955206B (en) * | 2019-11-19 | 2021-06-18 | 中通客车控股股份有限公司 | Order scheduling and distribution scheduling method and system |
| CN111160723A (en) * | 2019-12-12 | 2020-05-15 | 上海大学 | Dynamic flexible job shop scheduling method |
| CN111103857A (en) * | 2019-12-20 | 2020-05-05 | 华南理工大学 | Real-time rescheduling method considering available processing time interval |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107767068B (en) | Lean production advanced plan scheduling system and method | |
| CN101364107A (en) | Dynamic dispatching method with prediction in complex large system environment | |
| CN108364099B (en) | Logistics distribution system and method based on simulation | |
| CN101364108B (en) | Dynamic dispatching method for workshop working based on matter drive in complex large system environment | |
| TWI394089B (en) | Virtual production control system and method and computer program product thereof | |
| CN104820906A (en) | Task scheduling method, device and system | |
| CN113177761B (en) | E-commerce storage intelligent scheduling early warning system considering timeliness | |
| JP2013508645A (en) | System and method for fuel supply management | |
| CN111311154A (en) | Vehicle scheduling method and system based on Internet of things | |
| Neugebauer et al. | Energy-sensitive production control in mixed model manufacturing processes | |
| JP5309882B2 (en) | Schedule creation system, schedule creation method, and schedule creation program | |
| CN101833319A (en) | Multiply manufacturing system on-line scheduling oriented single-equipment matched rescheduling method | |
| Popova et al. | Adaptive stochastic manpower scheduling | |
| CN116258337A (en) | Industry chain collaborative management system based on enterprise manufacturing operation | |
| Krichagina et al. | A dynamic stochastic stock-cutting problem | |
| CN111522303A (en) | Planned scheduling method and equipment | |
| US20030171963A1 (en) | Production planning method and system for production planning | |
| JP5527712B2 (en) | Distributed power control method and distributed power control system | |
| CN112651625A (en) | Concrete intelligent scheduling method, system, medium and electronic equipment | |
| JP4739656B2 (en) | Parts supply management system with remaining number management | |
| CN114862122B (en) | Workshop scheduling method, system and equipment based on APS | |
| Morozov et al. | Adaptive control and operational management system of machine-tool fleet of the manufacturing enterprise | |
| CN114862133A (en) | Knowledge-fused manufacturing service network resource scheduling method and system | |
| CN111523828A (en) | Self-adjusting center system of transport vehicle of mobile substation | |
| Tsukanov et al. | Analysis of Algorithms for Scheduling Complex Production Systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090211 |