CN111080172A - Double-dynamic long-path two-workshop comprehensive scheduling method - Google Patents

Double-dynamic long-path two-workshop comprehensive scheduling method Download PDF

Info

Publication number
CN111080172A
CN111080172A CN201911405641.4A CN201911405641A CN111080172A CN 111080172 A CN111080172 A CN 111080172A CN 201911405641 A CN201911405641 A CN 201911405641A CN 111080172 A CN111080172 A CN 111080172A
Authority
CN
China
Prior art keywords
scheduling
processing
workshop
path
strategy
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.)
Withdrawn
Application number
CN201911405641.4A
Other languages
Chinese (zh)
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.)
Harbin University of Science and Technology
Original Assignee
Harbin University of Science and Technology
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 Harbin University of Science and Technology filed Critical Harbin University of Science and Technology
Priority to CN201911405641.4A priority Critical patent/CN111080172A/en
Publication of CN111080172A publication Critical patent/CN111080172A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • 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/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Manufacturing & Machinery (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A double-dynamic long-path two-workshop comprehensive scheduling method. The method comprises the following steps: scheduling the processing trees according to layers; sequencing and pre-scheduling each layer of procedure set to be scheduled according to a double-dynamic long-path sequencing strategy; considering the gap generated during processing by the process when the process possibly delays the processing due to the partial order relation among the devices, the average delay strategy is used to make the processing of the devices compact; to reduce the number of plant migrations, a two-car shop selection strategy is used to analyze and schedule process plants for each process. The method is used for the comprehensive dispatching between two cars with the same resource.

Description

Double-dynamic long-path two-workshop comprehensive scheduling method
Technical Field
The invention relates to a double-dynamic long-path two-workshop comprehensive scheduling method.
Background
The comprehensive scheduling problem between two cars with symmetrical resources has been studied, and a solution is provided from the goal of obtaining a better scheduling result: scheduling the processing trees according to layers; sequencing and pre-scheduling each layer of procedure set to be scheduled according to a double-dynamic long-path sequencing strategy; considering the gap generated during processing by the process when the process possibly delays the processing due to the partial order relation among the devices, the average delay strategy is used to make the processing of the devices compact; in order to reduce the number of workshop transitions, a two-workshop selection strategy is used to analyze each process and arrange a processing workshop. The existing two-car comprehensive dispatching method with the same resources does not consider the influence of the processed working procedure in each dispatching process, so that the completion time of a product is prolonged, and the processing effect of the product is not ideal.
In the using process of the method, a double-dynamic long-path sequencing strategy, an average delay strategy and a two-car selection strategy are used. The double-dynamic long path sorting strategy is to consider the influence of the scheduled process on the process to be scheduled, calculate the total path length, namely the total processing time of the product, and schedule in a descending order; the average delay selection strategy is to consider the situation that the processes are possibly delayed to process due to the partial sequence relation, and utilize the gap generated between the processes to process so as to make the equipment process compact; the two-car workshop selection strategy is used for reducing the number of times of workshop migration and reducing the resource consumption.
Disclosure of Invention
The invention aims to provide a double-dynamic long-path two-workshop comprehensive scheduling method. The method is characterized in that a dual-dynamic long-path two-workshop comprehensive scheduling method is provided for the problem of ignoring the influence of scheduled procedures on procedures to be scheduled, the influence of the scheduled procedures is considered, static scheduling and dynamic scheduling are combined, and a dual-dynamic long-path sequencing strategy is adopted for sequencing and pre-scheduling; in order to realize the early processing of products, an average delay strategy is provided, and the gap generated in the process of processing is considered, so that the equipment processing is compact; in order to reduce the number of workshop migration and reduce resource consumption, a two-workshop selection strategy is provided.
The double-dynamic long path sorting strategy is to avoid neglecting the influence of the scheduled procedures, so that the scheduling is more rigorous and comprehensive, the path length is calculated by considering the equipment occupation time of the scheduled procedures during each scheduling, and the processing sequence is arranged by calculating the total processing time of the product according to the path length. And (3) advantage analysis: if the processing procedures are dispatched in a pure static state in the dispatching process, the influence of the dispatched procedures is easily ignored in the processing process, and the dispatching process is not considered fully, so that the total processing time is increased; and the dynamic and static combination is considered more comprehensively, and the total length of the path is calculated from the whole.
The average delay strategy is to make the machining of the equipment compact by utilizing a gap generated during the machining of the process in consideration of the possibility of delayed machining of the process due to the partial sequence relation in order to realize the early machining of the product.
And (3) advantage analysis: after the double-dynamic long-path ordering strategy is adopted and each layer of scheduling is finished, the influence of the processed procedures is considered to arrange procedure processing, the consideration factors are comprehensive, and the effect is better; and the total processing time is controlled by considering the occupation condition of the equipment.
The two-car workshop selection strategy is used for reducing the number of times of workshop migration and reducing the resource consumption. And (3) advantage analysis: the relationship between the processes which are close to each other is considered, a front edge greedy rule is adopted when the processing workshops are arranged for the target processes during scheduling, a proper processing workshop is selected for the target processes under the condition that the processing starting time is earliest, and the workshop migration times can be effectively reduced.
The above purpose is realized by the following technical scheme:
a dual-dynamic long-path two-workshop comprehensive scheduling method mainly comprises the following steps: setting the number of layers from leaf nodes to root nodes according to the structure of the process tree and scheduling according to the layers; the method comprises the steps of determining a processing sequence and pre-scheduling by adopting a dynamic long path strategy, considering the situation of process delayed scheduling caused by equipment occupation in the scheduling process, considering the influence of the end time of a processed process on each layer of process set to be scheduled, calculating the total path length and arranging the scheduling sequence by adopting a mode of combining static scheduling and dynamic scheduling, thereby improving the accuracy of scheduling long paths; in order to realize the early processing of products, an average delay strategy is provided, and the gap generated in the process of processing is considered, so that the equipment processing is compact; in order to reduce the number of times of two-car transfer, a two-car selection strategy is provided, and resource consumption is reduced.
The double-dynamic long-path two-workshop comprehensive scheduling method comprises the following specific implementation steps:
the method comprises the following steps: input device and product information.
Step two: obtaining n layers of the product processing craft tree.
Step three: let i = 1.
Step four: judging whether n is greater than or equal to i, and turning to the fifth step if the judgment result is positive; and judging whether the step twelve is performed.
Step five: the current working set to be scheduled is Oi。
Step six: using dual dynamic long pathsRadial ordering policy pair OiThe process in (1) arranges a scheduling order.
Step seven: the two-car selection strategy is OiScheduling workshop processing
Step eight: scheduling a target Process O during Pre-schedulingixThe earliest machining start time of SixThe required processing time is tix。
Step nine: determining whether or not O andixa certain procedure O of processing in the same workshop and the same equipmentjyAt the time of starting machining SjyThe required processing time is tjyAnd satisfies the condition Six+tix≤Sjy. If the judgment result is that the step is changed to the step ten, the judgment result is that the step eleven is not changed.
Step ten: using average delay strategy to pair OixAnd OjyScheduling is scheduled.
Step eleven: i = i + 1.
Step twelve: and finishing the scheduling.
The double-dynamic long-path two-workshop comprehensive scheduling method adopts a double-dynamic long-path sequencing strategy to perform descending scheduling on each layer of to-be-scheduled process of the process tree, namely the influence of the scheduled process on the process is comprehensively considered during scheduling, the path length is calculated according to the influence, and finally the scheduling is performed according to the descending order.
The double-dynamic long-path two-workshop comprehensive scheduling method adopts a mode of combining static scheduling and dynamic scheduling, considers procedure delay scheduling caused by equipment occupation in the scheduling process after each pre-scheduling is finished, calculates the total processing time of a product according to the time occupied by a processed procedure, uses an average delay strategy to consider the gap generated in procedure processing for realizing early processing of the product, enables the equipment processing to be compact, reduces the migration times of two workshops so as to reduce the workshop resource consumption, adopts a two-workshop selection strategy, and arranges a proper workshop for a schedulable procedure.
Has the advantages that:
1. the invention analyzes the problem between two cars with the same resource, adopts a double-dynamic long path sequencing strategy, calculates the path length by considering the time occupied by the processing procedure and schedules in a descending order, thereby ensuring more comprehensive scheduling consideration and better scheduling effect.
After the pre-scheduling of each layer of the process tree to be scheduled is finished, the average delay strategy is adopted, the condition that the process is possibly delayed to process due to the partial sequence relation is considered, the gap generated between the process is utilized, the equipment processing is compact, the process is judged and adjusted while being scheduled, the flexibility is higher, and the process is not limited by conditions easily. And the method is only adopted when the condition is met, and the algorithm complexity is small.
3. In order to reduce the number of times of migration between two workshops and reduce workshop resource consumption, the invention adopts a two workshop selection strategy and arranges a proper processing workshop for a schedulable procedure.
Description of the drawings:
FIG. 1 is a process tree illustration of the present invention.
FIG. 2 is a Gantt chart of the scheduling results of the present invention for the process tree shown in FIG. 1.
Fig. 3 is a gantt chart of scheduling results of the prior art for the process tree shown in fig. 1.
The specific implementation mode is as follows:
example 1:
a double-dynamic long-path two-workshop comprehensive scheduling method is characterized by mainly comprising the following steps: setting the number of layers from leaf nodes to root nodes according to the structure of the process tree and scheduling according to the layers; the method adopts a double-dynamic long-path ordering strategy for pre-scheduling, considers procedure delay scheduling caused by equipment occupation in the scheduling process, considers the influence of the end time of a processed procedure on each layer of procedure set to be scheduled, calculates the total path length by adopting a mode of combining static scheduling and dynamic scheduling, and performs pre-scheduling in a descending order, thereby improving the accuracy of scheduling the long path; in order to realize the early processing of products, an average delay strategy is provided, and the gap generated in the process of processing is considered, so that the equipment processing is compact; in order to reduce the number of times of transferring between two workshops so as to reduce workshop resource consumption, a two workshop selection strategy is provided, and a proper processing workshop is arranged for a schedulable procedure.
Example 2:
in the above dual-dynamic long-path two-shop comprehensive scheduling method, the scheduling method 1 specifically comprises the following implementation steps:
detailed description of the preferred embodiment
The method comprises the following steps: input device and product information.
Step two: obtaining n layers of the product processing craft tree.
Step three: let i = 1.
Step four: judging whether n is greater than or equal to i, and turning to the fifth step if the judgment result is positive; and judging whether the step twelve is performed.
Step five: the current working set to be scheduled is Oi。
Step six: pair O with dual dynamic long path ordering strategyiThe process in (1) arranges a scheduling order.
Step seven: the two-car selection strategy is OiScheduling workshop processing
Step eight: scheduling a target Process O during Pre-schedulingixThe earliest machining start time of SixThe required processing time is tix。
Step nine: determining whether or not O andixa certain procedure O of processing in the same workshop and the same equipmentjyAt the time of starting machining SjyThe required processing time is tjyAnd satisfies the condition Six+tix≤Sjy. If the judgment result is that the step is changed to the step ten, the judgment result is that the step eleven is not changed.
Step ten: using average delay strategy to pair OixAnd OjyScheduling is scheduled.
Step eleven: i = i + 1.
Step twelve: and finishing the scheduling.
Example 3:
according to the double-dynamic long-path two-workshop comprehensive scheduling method, a double-dynamic long-path sequencing strategy is adopted for each layer of to-be-scheduled process of the process tree to perform descending scheduling, namely the influence of process delay scheduling caused by equipment occupation generated by the scheduled process on the process is comprehensively considered during scheduling, the total path length is calculated according to the process delay scheduling, and finally scheduling is performed according to descending order.
According to the double-dynamic long-path two-workshop comprehensive scheduling method, after the pre-scheduling of the scheduling procedure of each layer of the process tree is finished, the average delay strategy is applied, and gaps generated between the procedures are utilized to enable equipment to be processed compactly, so that the early processing of products is realized.
According to the double-dynamic long-path two-workshop comprehensive scheduling method, in order to reduce the number of times of migration of the two workshops and reduce workshop resource consumption, a two-workshop selection strategy is provided, and a proper machining workshop is arranged for a schedulable procedure.
Example 4:
the double-dynamic long-path two-workshop comprehensive scheduling method is characterized in that a scheduling strategy module is selected based on comprehensive scheduling: setting a hierarchy from a root node to leaf nodes according to the structure of the process tree, and scheduling according to the hierarchy; in order to improve the accuracy of the overall scheduling, a dual-dynamic long-path sequencing strategy is provided, the influence of the scheduled procedures is considered, namely the scheduling condition of procedure delay caused by equipment occupation in the scheduling process, after the arrangement of each layer is finished, the influence of the scheduled procedures is considered, the path length is recalculated, and the procedures are scheduled in a descending order according to the path length; in order to realize the early processing of products, an average delay strategy is provided, and the gap generated in the process of processing is considered, so that the equipment processing is compact; in order to reduce the number of times of transferring between two workshops so as to reduce workshop resource consumption, a two workshop selection strategy is provided, and a proper processing workshop is arranged for a schedulable procedure.
Setting the number of layers from leaf nodes to root nodes according to the structure of the process tree and scheduling according to the layers; adopting a double-dynamic long-path ordering strategy for pre-scheduling, considering the end time of a processed procedure for each layer of procedure set to be scheduled, calculating the total path length by adopting a mode of combining static scheduling and dynamic scheduling, and performing pre-scheduling in a descending order; considering the gap generated during processing in the process, the equipment processing becomes compact under the condition that the process possibly delays the processing due to the partial order relation among the equipment; in order to reduce the number of times of transferring between two workshops so as to reduce workshop resource consumption, a two workshop selection strategy is provided, and a proper processing workshop is arranged for a schedulable procedure. .
Example 5:
the above-mentioned double-dynamic long-path two-shop comprehensive scheduling method is, as shown in fig. 1, a process tree legend of a product G processed in two-shop with the same resources, and there are 24 processes in the figure, and the product G can be processed on 4 pieces of equipment, and each process has different attribute information, and the meaning of symbols in a rectangular frame is: product process name/processing equipment name/processing time.
The specific implementation of the method will be described with reference to the process tree diagram of fig. 1.
Example 6:
the above attribute information of each process is different, and the meaning of the symbol in the rectangular frame is: the product process name/processing equipment name/processing time, the scheduling method will be used to schedule the process tree legend in fig. 1. The method comprises the following specific operation steps:
step 1: the method comprises the steps of firstly scheduling the lowest-layer process, and sequentially scheduling upwards until the root node process is scheduled, namely the first-layer process set to be scheduled is { A24}, the second-layer process set to be scheduled is { A23}, and the third-layer process set to be scheduled is { A21, A22 }; the fourth layer of the to-be-scheduled work sets are { A17, A18, A19, A20 }; the fifth layer to-be-scheduled process set is { A12, A13, A14, A15, A16 }; the sixth layer of the to-be-scheduled process set is { A7, A8, A9, A10, A11 }; the seventh layer to-be-scheduled process set is { A2, A3, A4, A5, A6 }; the fifth layer of the work set to be scheduled is { A1 }.
Step 2: determining the process scheduling sequence of each layer of the process set to be scheduled according to a dual-dynamic long-path ordering strategy, considering the influence of the processes which are scheduled, namely considering the end time of the processed processes when calculating the path length, and performing pre-scheduling according to a descending sequence. Taking the fourth layer scheduling as an example, the calculation results are shown in table 1.
TABLE 1 dynamic Path Length of second tier Process set to be scheduled
Figure DEST_PATH_IMAGE001
And step 3: in the pre-scheduling process, whether the pre-scheduling exists or not is judged
Figure 700497DEST_PATH_IMAGE002
A certain procedure of processing in the same workshop and the same equipment
Figure 804588DEST_PATH_IMAGE003
At the time of starting processing
Figure 958227DEST_PATH_IMAGE004
The required processing time is
Figure 228802DEST_PATH_IMAGE005
And satisfy the conditions
Figure 980857DEST_PATH_IMAGE006
. When the judgment result is yes, the same-layer procedure adjustment strategy is adopted for procedure adjustment; if the judgment result is negative, adjustment is not needed.
And 4, step 4: a two-workshop selection strategy is adopted to arrange a workshop for each processing procedure so as to reduce the influence caused by workshop migration;
step 6: and outputting the Gantt chart.
Example 7:
the double-dynamic long-path two-workshop comprehensive scheduling method comprises the following steps of:
the following is an example comparison of the scheduling method of the present invention with the existing excellent scheduling method for two workshops with the same resource.
Fig. 3 is a gantt chart showing the result of scheduling the legend shown in fig. 1 by using the existing better scheduling method for the two workshops with the same resource, and it can be seen by comparing fig. 2 and fig. 3 that the product processing completion time is 22 hours by using the method proposed herein, and the product processing completion time is 22 hours by using the existing better method. The method has better effect because the double-dynamic long-path sequencing strategy adopted in the method is comprehensively considered and easy to realize, and the average delay strategy fully utilizes the gaps of the process; the two-car room selection strategy effectively reduces the number of times of the car room migration. It is obvious from the figure that the two methods have great difference to the processing sequence of the working procedures, the method is relatively simple to dispatch the processing operation between two cars with the same resource, and the total completion time of the product is short.
Therefore, the scheduling method provided by the invention is the optimization of the current two-car scheduling method with the same resources.

Claims (5)

1. A double-dynamic long-path two-workshop comprehensive scheduling method is characterized by comprising the following steps: the method mainly comprises the following steps: aiming at a process structure of a process tree, in order to improve the accuracy of scheduling long paths, a dual-dynamic long path sequencing strategy is provided, the process delay scheduling caused by equipment occupation in the scheduling process is considered, after each layer of pre-scheduling is finished, the influence of the scheduled process is considered, the path length is recalculated, and the scheduling is performed in a descending order according to the path length; in order to realize the early processing of products, an average delay strategy is provided, and the gap generated between the processes is considered to be utilized to start the processing, so that the equipment is processed compactly; a two-workshop selection strategy is provided, and a processing workshop is arranged for a scheduling process so as to reduce the number of times of migration; according to analysis and examples, the algorithm enables complex products to be processed in a short time, and does not increase algorithm time complexity.
2. The dual dynamic long path two-shop integrated scheduling method of claim 1, characterized by: the scheduling method comprises the following specific implementation steps:
the method comprises the following steps: inputting equipment and product information;
step two: obtaining n layers of the product processing craft tree;
step three: let i = 1;
step four: judging whether n is greater than or equal to i, and turning to the fifth step if the judgment result is positive; judging whether the step twelve is performed;
step five: the current working set to be scheduled is Oi；
Step six: pair O with dual dynamic long path ordering strategyiArranging a scheduling sequence in the process;
step seven: the two-car selection strategy is OiArranging workshop processing;
step eight: scheduling a target Process O during Pre-schedulingixThe earliest machining start time of SixThe required processing time is tix；
Step nine: determining whether or not O andixa certain procedure O of processing in the same workshop and the same equipmentjyAt the time of starting machining SjyThe required processing time is tjyAnd satisfies the condition Six+tix≤Sjy(ii) a If the judgment result is yes, turning to the step ten, and if not, turning to the step eleven;
step ten: using average delay strategy to pair OixAnd OjyScheduling;
step eleven: i = i + 1;
step twelve: and finishing the scheduling.
3. The dual dynamic long path two-shop integrated scheduling method according to claim 1 or 2, characterized by: for each layer of process of the process tree, the influence of the scheduled process is considered, the path length is calculated by adopting a double-dynamic long-path ordering strategy, and the scheduling sequence is arranged in a descending order.
4. The dual dynamic long path two-shop integrated scheduling method according to claim 1, 2 or 3, characterized by: after the pre-scheduling of the procedure to be scheduled of each layer of the process tree is finished, an average delay strategy is adopted, the situation that the procedure is possibly delayed to process due to the partial order relation is considered, and the gap generated between the procedure and the process is utilized, so that the equipment processing becomes compact.
5. The dual dynamic long path two-shop integrated scheduling method according to claim 1, 2, 3 or 4, characterized by: and considering the reduction of the number of times of the migration between the two workshops so as to reduce the workshop resource consumption, and adopting a two workshop selection strategy to arrange a proper workshop for the schedulable process.
CN201911405641.4A 2019-12-31 2019-12-31 Double-dynamic long-path two-workshop comprehensive scheduling method Withdrawn CN111080172A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911405641.4A CN111080172A (en) 2019-12-31 2019-12-31 Double-dynamic long-path two-workshop comprehensive scheduling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911405641.4A CN111080172A (en) 2019-12-31 2019-12-31 Double-dynamic long-path two-workshop comprehensive scheduling method

Publications (1)

Publication Number Publication Date
CN111080172A true CN111080172A (en) 2020-04-28

Family

ID=70320334

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911405641.4A Withdrawn CN111080172A (en) 2019-12-31 2019-12-31 Double-dynamic long-path two-workshop comprehensive scheduling method

Country Status (1)

Country Link
CN (1) CN111080172A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115719108A (en) * 2022-11-03 2023-02-28 吉林师范大学 Resource symmetric distributed workshop comprehensive scheduling method
CN116259806A (en) * 2023-05-09 2023-06-13 浙江韵量氢能科技有限公司 Fuel cell stack capable of removing gas impurities and method for removing gas impurities

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115719108A (en) * 2022-11-03 2023-02-28 吉林师范大学 Resource symmetric distributed workshop comprehensive scheduling method
CN116259806A (en) * 2023-05-09 2023-06-13 浙江韵量氢能科技有限公司 Fuel cell stack capable of removing gas impurities and method for removing gas impurities

Similar Documents

Publication Publication Date Title
CN110084436B (en) Comprehensive two-car scheduling method for dynamically guaranteeing critical path process scheduling
CN107092981B (en) Comprehensive dispatching method for two cars processed in priority by closely connected process groups
CN104732355B (en) The device drives integrated dispatch method of equipment free time section adjustment
CN111080172A (en) Double-dynamic long-path two-workshop comprehensive scheduling method
CN109359888B (en) Comprehensive scheduling method for tight connection constraint among multiple equipment processes
CN110738413A (en) Multi-constraint scheduling calculation method and device for automatic aviation part machining production line
US10054938B2 (en) Clustering for prediction models in process control and for optimal dispatching
CN103679388B (en) Production scheduling method and production scheduling system
CN106485347A (en) The two workshop flexible comprehensive dispatching methods that buffering operation migrates in advance
CN106302062B (en) A kind of communication time slot arrangement method based on time trigger bus
CN110717674A (en) Tree decomposition and heuristic comprehensive scheduling method based on graph
CN110428140B (en) Multi-equipment process scheduling method for process sequence selection
Ko et al. Wafer delay analysis and workload balancing of parallel chambers for dual-armed cluster tools with multiple wafer types
Duanmu et al. Measuring manufacturing throughput using takt time analysis and simulation
CN105511432B (en) Process string integrated dispatch method based on path length
CN114611885B (en) Comprehensive scheduling method based on special equipment
CN110232486B (en) Multi-workshop comprehensive scheduling method based on K shortest path
CN108268312A (en) Method for scheduling task and scheduler
EP1638273A3 (en) Scheduling using quantum and deficit values
CN107678411B (en) A kind of modeling method of uncorrelated parallel machine hybrid flow shop scheduling
CN1889521A (en) Data dispatching method and system
CN108132650B (en) Flow shop control method and device
Wang et al. A lot dispatching strategy integrating WIP management and wafer start control
CN115526484A (en) Flexible comprehensive scheduling method considering equipment loss
CN115113588A (en) Configuration method of pulse type assembly production line for aircraft engine assembly

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication

Application publication date: 20200428

WW01 Invention patent application withdrawn after publication