CN114936778A - Component job shop scheduling method and device - Google Patents
Component job shop scheduling method and device Download PDFInfo
- Publication number
- CN114936778A CN114936778A CN202210589482.3A CN202210589482A CN114936778A CN 114936778 A CN114936778 A CN 114936778A CN 202210589482 A CN202210589482 A CN 202210589482A CN 114936778 A CN114936778 A CN 114936778A
- Authority
- CN
- China
- Prior art keywords
- scheduling
- crown block
- solution
- incomplete
- schedule
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 144
- 230000008569 process Effects 0.000 claims abstract description 67
- 238000012545 processing Methods 0.000 claims abstract description 21
- 238000009826 distribution Methods 0.000 claims abstract description 10
- 238000006243 chemical reaction Methods 0.000 claims abstract description 8
- 230000009466 transformation Effects 0.000 claims description 24
- 230000009471 action Effects 0.000 claims description 14
- 230000008859 change Effects 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000003860 storage Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 6
- 238000000605 extraction Methods 0.000 claims description 4
- 238000004519 manufacturing process Methods 0.000 abstract description 16
- 230000007547 defect Effects 0.000 abstract description 8
- 230000009286 beneficial effect Effects 0.000 abstract description 6
- 238000000227 grinding Methods 0.000 description 17
- 238000004891 communication Methods 0.000 description 8
- 241000721047 Danaus plexippus Species 0.000 description 6
- 210000000349 chromosome Anatomy 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 239000011159 matrix material Substances 0.000 description 6
- 230000035772 mutation Effects 0.000 description 6
- 238000001816 cooling Methods 0.000 description 5
- 238000013461 design Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 229910000831 Steel Inorganic materials 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 239000010959 steel Substances 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000010485 coping Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012804 iterative process Methods 0.000 description 2
- 230000014759 maintenance of location Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000005096 rolling process Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/06311—Scheduling, planning or task assignment for a person or group
-
- 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/06315—Needs-based resource requirements planning or analysis
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
-
- 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/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- 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)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
The application discloses a method and a device for scheduling component job shops, wherein the method comprises the following steps: generating a plurality of scheduling solutions of a scheduling scheme; performing incomplete schedule conversion on each scheduling solution to obtain an incomplete schedule, and obtaining distribution information of a workpiece process and a crown block task according to the incomplete schedule; obtaining time information of a workpiece procedure and a crown block task from an incomplete schedule by utilizing crown block decoding; and calculating the fitness of all solution schedules, determining an optimal solution according to the fitness of all solution schedules, and generating an optimal scheduling scheme based on the optimal solution. Therefore, the technical problems that in the related art, when the operation workshop is scheduled, the transportation link is regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and is not beneficial to production and processing are solved.
Description
Technical Field
The application relates to the technical field of intelligent manufacturing, in particular to a component job shop scheduling method and device.
Background
Job shop scheduling is an important link in the manufacturing process, and a processing sequence and processing equipment need to be distributed to each procedure of each workpiece through reasonable scheduling, so that the job shop scheduling method directly determines the production and manufacturing efficiency. Different from common small parts, the large-scale component operation workshop not only relates to workpieces, processes and processing equipment, but also causes the coupling problem of multiple workpieces, multiple processes, multiple equipment and multiple crown blocks because the workpieces are large in size and heavy in mass and the transportation process of the workpieces through the crown blocks cannot be ignored, and the scheduling difficulty is high. The large-scale component is widely applied to the national economy key fields of aviation, aerospace, steel and the like, researches are carried out on a scheduling method of a large-scale component operation workshop, and the production efficiency is guaranteed, so that the method has very important significance.
At present, aiming at a large construction job shop, an expert system based on manual experience is mostly used for completing scheduling, the scheduling method completely depends on the expert experience, although a scheduling scheme with a qualitative performance can be output, the optimal performance of the scheme cannot be ensured, and when the job environment changes, long-time adjustment is needed, so that the adaptability is poor; aiming at the common operation workshop, although the adaptability adjustment to the operation environment change is correspondingly improved, the problem of transportation of different workpieces among different devices cannot be considered.
In the related art, only the transportation time is considered, the transportation link is regarded as an ideal process, the problem of interference of multiple crown blocks in practice is avoided, and because different crown blocks cannot span each other and a certain safety distance must be ensured, the problem of crown block interference often occurs when a large-sized component is transported by the crown blocks, so that the problem of space-time coupling constraint of 'workpiece-equipment-crown block' is caused, the related art is difficult to directly solve the scheduling problem of a large-sized component operation workshop, and improvement is needed urgently.
Disclosure of Invention
The application provides a method and a device for scheduling a component job shop, which aim to solve the technical problems that when the job shop is scheduled, transportation links are regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and is not beneficial to production and processing.
An embodiment of a first aspect of the present application provides a method for scheduling a component job shop, including the following steps: generating a plurality of scheduling solutions of a scheduling scheme; performing incomplete schedule conversion on each scheduling solution to obtain an incomplete schedule, and obtaining distribution information of a workpiece process and a crown block task according to the incomplete schedule; obtaining time information of the work procedure and the crown block task from an incomplete schedule by utilizing crown block decoding; calculating the fitness of all solution schedules, determining an optimal solution according to the fitness of all solution schedules, and generating an optimal schedule scheme based on the optimal solution.
Optionally, in an embodiment of the present application, the method further includes: and selecting intersection and variation on the plurality of scheduling solutions to generate a plurality of new scheduling solutions so as to update the optimal solution until an iteration condition is met to obtain a final optimal scheduling scheme.
Optionally, in an embodiment of the present application, the generating a plurality of scheduling solutions of a scheduling scheme includes: the plurality of solutions is obtained based on the process sequence layer code string, the machine selection layer code string, and the crown block selection layer code string.
Optionally, in an embodiment of the present application, the performing incomplete schedule transformation on each solution to obtain information about work procedure and task allocation of a crown block includes: obtaining an incomplete schedule according to a schedule solution based on the transformation of the incomplete schedule; extracting relevant information from the incomplete schedule, wherein the relevant information comprises at least one of a work piece number, a work piece serial number, an origin, a destination, and an assigned overhead traveling crane number.
Optionally, in an embodiment of the present application, the obtaining, by using overhead traveling crane decoding, the time information of the workpiece procedure and the overhead traveling crane task from an incomplete schedule includes: calculating the processing start time and end time of each workpiece, the start time and end time of each crown block scheduling task and the change of each crown block horizontal coordinate along with time according to the incomplete scheduling table; judging whether the crown block interferes or not; and if the crown block interferes, executing an avoidance action and then moving, otherwise, directly moving, outputting a crown block coordinate and a crown block state, and recording corresponding task time to obtain the time information.
In a second aspect, an embodiment of the present application provides a component job shop scheduling apparatus, including: a generating module for generating a plurality of scheduling solutions of a scheduling scheme; the transformation module is used for carrying out incomplete scheduling table transformation on each scheduling solution to obtain an incomplete scheduling table and obtaining distribution information of a work piece process and a crown block task according to the incomplete scheduling table; the decoding module is used for obtaining the time information of the work piece working procedure and the crown block task from the incomplete scheduling table by utilizing crown block decoding; and the scheduling module is used for calculating the fitness of all solution scheduling programs, determining an optimal solution according to the fitness of all solution scheduling programs, and generating an optimal scheduling scheme based on the optimal solution.
Optionally, in an embodiment of the present application, the method further includes: and the iteration module is used for selecting intersection and variation on the plurality of scheduled solutions to generate a plurality of new scheduled solutions so as to update the optimal solution until an iteration condition is met and a final optimal scheduling scheme is obtained.
Optionally, in an embodiment of the present application, the generating module includes: an obtaining unit configured to obtain the plurality of solutions based on the procedure sequence layer encoding string, the machine selection layer encoding string, and the overhead traveling crane selection layer encoding string.
Optionally, in an embodiment of the present application, the transformation module includes: the first calculation unit is used for obtaining the incomplete schedule according to the schedule solution based on the transformation of the incomplete schedule; and the extraction unit is used for extracting relevant information from the incomplete schedule, wherein the relevant information comprises at least one of a workpiece number, a workpiece serial number, an origin, a destination and an assigned overhead traveling crane number.
Optionally, in an embodiment of the present application, the decoding module includes: the second calculation unit is used for calculating the processing starting time and the processing ending time of each workpiece, the starting time and the ending time of each crown block scheduling task and the change of each crown block abscissa along with time according to the incomplete scheduling table; the judging unit is used for judging whether the crown block generates interference; and the execution unit executes the avoidance action and then moves when the crown block interferes, otherwise, directly moves, outputs the coordinates and the state of the crown block, records the corresponding task time and obtains the time information.
An embodiment of a third aspect of the present application provides an electronic device, including: a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor executing the program to implement the method for component job shop scheduling as described in the above embodiments.
A fourth aspect of the present application provides a computer-readable storage medium storing computer instructions for causing a computer to perform the component job shop scheduling method according to the above embodiments.
According to the method and the device, incomplete schedule conversion can be carried out on the scheduling solution of the scheduling scheme, distribution information of the work piece process and the crown block task is obtained, the crown block is used for decoding, time information of the work piece process and the crown block task is obtained, the optimal scheduling scheme is obtained according to the adaptability of all solutions, the interference problem of the crown block is fully considered, efficient scheduling of the crown block in the large-scale component job shop is achieved, and the intelligent level of the large-scale component job shop is improved. Therefore, the technical problems that in the related art, when the operation workshop is scheduled, the transportation link is regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and is not beneficial to production and processing are solved.
Additional aspects and advantages of the present application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the present application.
Drawings
The foregoing and/or additional aspects and advantages of the present application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a flowchart of a method for scheduling a component job shop according to an embodiment of the present application;
FIG. 2 is a flow diagram of a component job shop scheduling method according to one embodiment of the present application;
FIG. 3 is a Gantt diagram illustrating a scheduling result of a component job shop scheduling method according to an embodiment of the present application;
FIG. 4 is a schematic representation of a crown block motion profile for a component job shop scheduling method according to one embodiment of the present application;
FIG. 5 is a schematic diagram illustrating an exemplary embodiment of a component job shop scheduling apparatus;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to embodiments of the present application, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are exemplary and intended to be used for explaining the present application and should not be construed as limiting the present application.
The component shop scheduling method and apparatus according to the embodiments of the present application will be described with reference to the accompanying drawings. In order to solve the technical problems that when the operation workshop is scheduled in the related technology mentioned in the background technology center, a transportation link is regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and the production and processing are not facilitated, the application provides the component operation workshop scheduling method. Therefore, the technical problems that in the related art, when the operation workshop is scheduled, the transportation link is regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and is not beneficial to production and processing are solved.
Specifically, fig. 1 is a flowchart illustrating a component job shop scheduling method according to an embodiment of the present disclosure.
As shown in FIG. 1, the component job shop scheduling method includes the following steps:
in step S101, a plurality of scheduling solutions of the scheduling scheme are generated.
In the actual execution process, the multiple scheduling solutions of the scheduling scheme can be generated through coding, distribution information and time information of work procedure and crown block tasks can be conveniently obtained through the scheduling solutions in the follow-up process, the optimal scheduling scheme can be conveniently realized through calculation, the interference problem of the crown block is fully considered, efficient scheduling of the crown block in the large-scale component operation workshop is realized, and the intelligence level of the large-scale component operation workshop is improved.
Optionally, in an embodiment of the present application, generating a plurality of scheduling solutions of a scheduling scheme includes: a plurality of solutions is obtained based on the process sequence layer code string, the machine selection layer code string, and the crown block selection layer code string.
Specifically, each scheduling solution comprises three coding strings, namely a process sequence layer coding string JS, a machine selection layer coding string MS and a crown block selection layer coding string PS, the lengths of the JS, the MS and the PS are equal, and [ JS MS PS ] is formed by end-to-end connection, namely complete coding.
And the JS uses a coding rule based on the process, namely the number on the ith bit of the JS is x, the number represents that the workpiece is numbered x, and the ith bit of the JS represents the kth process of the workpiece x after x appears k times from the 1 st bit to the ith bit. For example, when JS is [ 3155231 ], JS (1) is 3, the first step of workpiece No. 3 is shown, and each of JS (3) and JS (4) is 5, and the first step and the second step of workpiece No. 5 are shown.
The MS uses a coding rule of relative machine coding, namely, for the j th bit of the MS, a machine set M available for the corresponding workpiece process is preset, wherein an element in the M is a machine number, and a number MS (j) on the j th bit of the MS corresponds to a machine number M (MS (j)). For example, if MS ═ 3155231 ], it is possible to set that MS (4) corresponds to the second process of workpiece No. 2, and the set of available machines corresponding to this workpiece process is M ═ 89101112 ], then MS (4) represents the 5 th machine in the set of available machines M, where M (MS (4)) = 12, that is, the second process indicated as workpiece No. 2 is assigned machine No. 12.
The PS uses a direct coding mode, and numbers on each bit of the PS are the sky train numbers.
In step S102, the incomplete schedule conversion is performed on each scheduling solution to obtain an incomplete schedule, and the distribution information of the work procedure and the overhead crane task is obtained according to the incomplete schedule.
As a possible implementation manner, the embodiment of the application may perform incomplete schedule conversion on each scheduling solution, convert an abstract scheduling solution into an incomplete schedule which is easy to read, and further obtain allocation information of workpiece processes and overhead traveling crane tasks by reading the incomplete schedule, so as to facilitate obtaining an optimal scheduling scheme subsequently, and further solve the problem that the scheduling scheme has defects due to the fact that a transportation link is regarded as an ideal process and only transportation time of transportation equipment is considered in the related art.
Optionally, in an embodiment of the present application, performing incomplete schedule transformation on each solution to obtain information about work procedure and task allocation of the overhead traveling crane, including: based on the incomplete schedule transformation, obtaining an incomplete schedule according to a schedule solution; relevant information is extracted from the incomplete schedule, wherein the relevant information comprises at least one of a work piece number, a work piece serial number, an origin, a destination, and an assigned overhead traveling crane number.
In the actual implementation process, the embodiment of the application can read the PS of the solution converted by the incomplete schedule table to obtain the allocated crown block number; reading the solved JS to obtain a workpiece number and a workpiece serial number; and reading the MS of the solution, and obtaining a destination and further an origin according to the workpiece number and the workpiece serial number.
Further, in the embodiment of the present application, the workpiece number, the work serial number, the origin, the destination, and the allocated crown block number of each workpiece process may be placed in a column of a matrix, and a 5 × L matrix is finally constructed, where L is the total number of processes, and the matrix may be used to visually represent the result of incomplete scheduling transformation.
In step S103, the time information of the work process and the overhead traveling crane task is obtained from the incomplete schedule by overhead traveling crane decoding.
For example, the embodiment of the application can decompose the motion actions of the overhead travelling crane to obtain 8 actions including going to an origin, releasing a hook, loading, receiving a hook, going to a destination, releasing a hook, unloading, receiving a hook and the like, and on the basis, design an overhead travelling crane movement operator to realize that the overhead travelling crane moves from one point to another point on a track, design an overhead travelling crane scheduling operator based on the overhead travelling crane movement operator to realize overhead travelling crane scheduling including complete 8 actions, and obtain time information of a workpiece procedure and an overhead travelling crane task from an incomplete scheduling table.
Optionally, in an embodiment of the present application, obtaining time information of the workpiece process and the overhead traveling crane task from the incomplete schedule by using overhead traveling crane decoding includes: calculating the processing start time and end time of each workpiece, the start time and end time of each crown block scheduling task and the change of each crown block abscissa along with time according to the incomplete scheduling table; judging whether the crown block interferes or not; and if the crown block interferes, executing the avoidance action and then moving, otherwise, directly moving, outputting the coordinates and the state of the crown block, and recording the corresponding task time to obtain time information.
It is understood that during the dispatching process of the overhead traveling crane, the status of the overhead traveling crane can be switched among four statuses, i.e., "go to the origin", "load", "go to the destination", "unload", and so on.
Further, the embodiment of the application aims at the interference condition which possibly occurs between the crown blocks, namely the distance between the crown blocks is smaller than the safety distance, and a crown block interference operator is designed.
The method and the device can prioritize the motion state of the overhead travelling crane, and sequentially carry out loading (unloading), destination forwarding, origin forwarding and idle forwarding from high to low. When two crown blocks interfere, the crown block with low state priority needs to execute an avoidance action to ensure that the distance between the crown block with low state priority and the crown block with high state priority is always greater than a safety distance; and when the state priorities of the two crown blocks are the same, a strategy of avoiding in turn is implemented.
The method comprises the steps of calculating the starting time and the ending time of each workpiece, the starting time and the ending time of each crown block scheduling task and the change of the horizontal coordinates of each crown block along with time by utilizing the complete schedule transformation operator.
In step S104, the fitness of all solution schedules is calculated, an optimal solution is determined according to the fitness of all solution schedules, and an optimal scheduling scheme is generated based on the optimal solution.
It will be understood by those skilled in the art that the fitness, which is the time when the last workpiece completes the whole process, is the maximum value of the completion time of all workpieces, can be expressed as:
C max ＝max 1≤i≤l (C i )，
wherein, C max For the maximum of the completion times of all workpieces, C i The finishing time of the workpiece i, and j is the total number of workpieces.
The smaller the numerical value of the fitness is, the faster the completion of work is indicated, and the better the solution represented by the fitness is, and the embodiment of the application can sort all solutions according to the numerical value of the fitness and screen out the optimal solution.
Optionally, in an embodiment of the present application, the method further includes: and selecting intersection and variation for the plurality of scheduling solutions to generate a plurality of new scheduling solutions so as to update the optimal solution until an iteration condition is met to obtain a final optimal scheduling scheme.
In the actual execution process, the embodiment of the application can select intersection and variation for a plurality of scheduled solutions, generate a plurality of new scheduled solutions, update the optimal solution until an iteration condition is met, so as to obtain a final optimal scheduled solution, judge the number of repetitions in the iteration process, and output the scheduled solution corresponding to the current optimal solution if the number of repetitions is reached; if not, performing selective crossing and mutation, and repeating the steps until reaching the specified number of times of repetition.
In particular, embodiments of the present application may use roulette and elite retention strategies when selecting a solution.
Setting crossover probability P in roulette c And P is c E (0,1), traversing each bit of the solution, and generating a random number, the random number and P for each bit c In the same range, if the random number is less than P c Then the bit of the solution participates in subsequent interleaving, otherwise it does not. The elite reservation strategy is to reserve the optimal solution in the iterative process, not to participate in selection crossing and variation, and directly reserve the optimal solution to the next generation, so that the current optimal solution cannot be damaged.
In crossing the solutions, JS uses a crossover scheme of monarch chromosome in combination with POX (precedence operation cross over, based on a procedure code crossover). Specifically, the solution with the highest fitness may be called monarch chromosome, and the solutions with the odd-numbered ranking digits in all the solutions are replaced by the monarch chromosome, so as to increase the superiority of the new solution, and meanwhile, the generated new solution is guaranteed to be a feasible solution by combining with the POX, where the feasible solution is a solution that meets the physical constraint of the large-scale component job shop. The MS and PS use a multi-point interleaving scheme, i.e. one bit on a solution is randomly selected and exchanged with the corresponding bit on the other solution, the exchange is repeated several times, and it is ensured that the bits of the solutions selected each time are different.
When mutation is solved, the JS uses two different-bit interchange schemes, namely, the numbers on two different bits on the JS are interchanged; MS and PS use the single point variation scheme, namely go through and solve all bits, use the roulette method to each bit, if judge and pass, produce a number to substitute the number on the original position at random, realize the single point variation. In the process of mutating the solution, the dynamic mutation rate P is used m The method comprises the following steps:
wherein, P m0 The initial variation rate is the rate of the initial variation,gen is the current repetition number, and G is the upper limit of the iteration number.
Repeating with successive iterations P m And the variation probability is increased continuously, so that the local optimal solution can be effectively jumped out.
The operation principle of the component job shop scheduling method according to the embodiment of the present application will be described in detail below with reference to fig. 2 to 4, taking a roll grinding shop as an example.
As shown in fig. 2, the embodiment of the present application may include the following steps:
step S201: the encoding generates a scheduling solution.
Specifically, each scheduling solution comprises three coding strings, namely a process sequence layer coding string JS, a machine selection layer coding string MS and a crown block selection layer coding string PS, the lengths of the JS, the MS and the PS are equal, and [ JS MS PS ] is formed by end-to-end connection, namely complete coding.
And the JS uses a coding rule based on the process, namely the number on the ith bit of the JS is x, the number represents that the workpiece is numbered x, and the ith bit of the JS represents the kth process of the workpiece x after x appears k times from the 1 st bit to the ith bit.
The MS uses a coding rule of relative machine coding, namely, for the j th bit of the MS, a machine set M available for the corresponding workpiece process is preset, the element in the M is a machine number, and the number MS (j) on the j th bit of the MS is a machine number M (MS (j)).
The PS uses a direct coding mode, and numbers on each bit of the PS are the sky train numbers.
Step S202: incomplete schedule transformation. In the actual implementation process, the embodiment of the application can read the PS of the solution converted by the incomplete schedule table to obtain the allocated crown block number; reading the solved JS to obtain a workpiece number and a workpiece serial number; and reading the MS of the solution, and obtaining a destination and further obtaining an origin according to the workpiece number and the workpiece serial number.
Further, in the embodiment of the present application, the workpiece number, the workpiece serial number, the origin, the destination, and the allocated crown block number of each workpiece process may be placed in a column of a matrix, and a 5 × L matrix is finally constructed, where L is the total number of processes, and the matrix may be used to visually represent the result of incomplete scheduling transformation.
Step S203: and (5) decoding the overhead travelling crane. For example, the embodiment of the application can decompose the motion actions of the overhead travelling crane to obtain 8 actions including going to an origin, releasing a hook, loading, receiving a hook, going to a destination, releasing a hook, unloading, receiving a hook and the like, and on the basis, design an overhead travelling crane movement operator to realize that the overhead travelling crane moves from one point to another point on a track, design an overhead travelling crane scheduling operator based on the overhead travelling crane movement operator to realize overhead travelling crane scheduling including complete 8 actions, and obtain time information of a workpiece procedure and an overhead travelling crane task from an incomplete scheduling table.
In the process of dispatching the overhead travelling crane, the state of the overhead travelling crane can be switched among four states of ' going to the original place ', ' loading in the process ', ' going to the destination ', ' unloading in the process, and the like.
Further, the embodiment of the application designs the crown block interference operator aiming at the interference condition which possibly occurs between crown blocks, namely the distance between the crown blocks is smaller than the safety distance.
The method and the device can prioritize the motion state of the overhead travelling crane, and sequentially carry out loading (unloading), destination forwarding, origin forwarding and idle forwarding from high to low. When two crown blocks interfere, the crown block with low state priority needs to execute an avoidance action to ensure that the distance between the crown block with low state priority and the crown block with high state priority is always greater than a safety distance; and when the state priorities of the two crown blocks are the same, a strategy of avoiding in turn is implemented.
The method comprises the steps of calculating the starting time and the ending time of each workpiece, the starting time and the ending time of each crown block scheduling task and the change of the horizontal coordinates of each crown block along with time by utilizing the complete schedule transformation operator.
Step S204: and calculating the fitness of all solutions, sequencing and screening out the optimal solution. It will be understood by those skilled in the art that the fitness, which is the time when the last workpiece completes the whole process, is the maximum value of the completion time of all workpieces, can be expressed as:
C max ＝max 1≤i≤l (C i )，
wherein, C max For the maximum of the completion times of all workpieces, C i The finishing time of the workpiece i, and j is the total number of workpieces.
The smaller the numerical value of the fitness is, the quicker the completion of work is indicated, and the represented solution is better.
Step S205: a prescribed number of repetitions is reached. In the actual execution process, the embodiment of the present application may determine the number of repetitions in an iteration process, and if the number of repetitions is reached, step S207 is performed; if not, the process proceeds to step S206.
Step S206: and carrying out selective crossing and mutation on the solution. In particular, embodiments of the present application may use roulette and elite retention strategies when selecting a solution.
Setting crossover probability P in roulette c And P is c E (0,1), traversing each bit of the solution, and generating a random number, a random number and P for each bit c In the same range, if the random number is less than P c Then the bit of the solution participates in subsequent interleaving, otherwise it does not. The elite reservation strategy is to reserve the optimal solution in the iterative process, not to participate in selection crossing and variation, and directly reserve the optimal solution to the next generation, so that the current optimal solution cannot be damaged.
In crossing over solutions, JS used a crossover scheme of monarch chromosome in combination with POX. Specifically, the solution with the highest fitness may be called monarch chromosome, the solutions with the odd-numbered ranking digits in all the solutions are replaced by the monarch chromosome, so as to increase the superiority of the new solution, and meanwhile, the generated new solution is guaranteed to be a feasible solution by combining with the POX, where the feasible solution is a solution that meets the physical constraints of the large-scale component job shop. The MS and the PS use a multi-point interleaving scheme, i.e. one bit on a solution is randomly selected and exchanged with the corresponding bit on the other solution, the exchange is repeated several times, and it is ensured that the bits of the solutions selected each time are different.
When mutation is solved, the JS uses two different-bit interchange schemes, namely, the numbers on two different bits on the JS are interchanged; MS and PS use the single point variation scheme, namely go through and solve all bits, use the roulette method to each bit, if judge and pass, produce a number to substitute the number on the original position at random, realize the single point variation. In the process of mutating the solution, the dynamic mutation rate P is used m The method comprises the following steps:
wherein, P m0 For the initial variation rate, gen is the current repetition number, and G is the upper limit of the iteration number.
Step S207: and outputting the scheduling scheme corresponding to the optimal solution. Repeating with successive iterations P m And the variation probability is increased continuously, so that the local optimal solution can be effectively jumped out.
The effectiveness of the embodiment of the application is verified by taking a roller grinding workshop as an example, the roller is a typical large-scale component and is widely applied to steel rolling production, and the roller grinding workshop is used for repairing a worn roller, runs for 24 hours, is an important guarantee of the steel rolling production, and has the complex coupling characteristics of multiple workpieces, multiple processes, multiple machines and multiple crown blocks. The specific parameters of the roll grinding workshop are set as follows:
number of rolls (number of workpieces): 7;
number of grinding machines (number of machines): 3;
the number of crown blocks is as follows: 2;
number of processes per workpiece: 8;
the number of blanking areas: 7;
number of cooling zones: 7;
number of grinding zones: 12;
number of memory areas: 7;
the size of a workshop: 105m × 20 m;
safe distance between day and night: 5 m;
the moving speed of the crown block is as follows: 1 m/s;
overhead crane loading/unloading is time consuming: for 90 s.
The 8 processes of each roll workpiece include: the method comprises the steps of blanking to a cooling area, roller cooling, cooling to a standby grinding area, splitting of a pair of rollers, grinding of an upper roller and an upper grinding machine, grinding of a lower roller and a standby grinding area, grinding of an upper roller and a lower roller, grinding of a lower roller and a position of the lower roller and the position of the corresponding upper roller, and grinding of the standby grinding area and a storage area. Wherein, the processes of roll cooling, pair of roll splitting, upper roll grinding machine coping, and lower roll grinding machine coping are fixed in time, and are 900s, 1080s and 1080s respectively; the rest procedures are scheduling procedures.
Taking the above parameters as an example, the parameters may be set as: the population scale is 50; maximum number of repetitions 20; pc is 0.8; pm0 is 0.01.
Finally, the optimal scheduling result obtained by using the embodiment of the present application can be shown in fig. 3, where the abscissa in fig. 3 is time, the ordinate is workpiece number, and there are 7 workpieces, each box represents a different process of the workpiece, and the number in the box represents the duration of the process, as shown in fig. 3, the processes of the workpieces are uniformly distributed, have no intersection, and the scheduling result is reasonable.
The corresponding two crown block motion curves are shown in fig. 4, in the figure, the solid line and the dotted line are respectively a crown block 1 and a crown block 2, the abscissa is time, and the ordinate is crown block displacement, and as shown in fig. 4, the crown block motion curves are not crossed, which proves that no crown block interference occurs.
In addition, the scheduling result shows that the maximum completion time is 10674s, and in contrast, the maximum completion time of the scheduling method of the related art is 12631s, and the improvement efficiency reaches 15.5% by using the embodiment of the application, which verifies that the embodiment of the application can effectively improve the production and manufacturing efficiency of the enterprise workshop.
According to the component job shop scheduling method provided by the embodiment of the application, incomplete schedule conversion can be carried out on the scheduling solution of the scheduling scheme, distribution information of a workpiece procedure and a crown block task is obtained, the crown block is used for decoding, time information of the workpiece procedure and the crown block task is obtained, an optimal scheduling scheme is obtained according to the fitness of all solutions, the interference problem of the crown block is fully considered, efficient scheduling of the crown block of the large-scale component job shop is realized, and the intelligence level of the large-scale component job shop is improved. Therefore, the technical problems that in the related art, when the operation workshop is scheduled, the transportation link is regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and is not beneficial to production and processing are solved.
Next, a component work shop scheduling apparatus according to an embodiment of the present application will be described with reference to the drawings.
FIG. 5 is a block diagram of a component job shop scheduling apparatus according to an embodiment of the present application.
As shown in fig. 5, the component job shop scheduling apparatus 10 includes: a generation module 100, a transformation module 200, a decoding module 300 and a scheduling module 400.
Specifically, the generating module 100 is configured to generate a plurality of scheduling solutions of a scheduling scheme.
And the transformation module 200 is configured to perform incomplete schedule transformation on each scheduling solution to obtain an incomplete schedule, and obtain allocation information of a workpiece procedure and a crown block task according to the incomplete schedule.
The decoding module 300 is configured to obtain time information of the work procedure and the task of the overhead traveling crane from the incomplete schedule by using overhead traveling crane decoding.
The scheduling module 400 is configured to calculate the fitness of all solution schedules, determine an optimal solution according to the fitness of all solution schedules, and generate an optimal scheduling scheme based on the optimal solution.
Optionally, in an embodiment of the present application, the component job shop scheduling device 10 further includes: and (5) an iteration module.
The iteration module is used for selecting intersection and variation on the plurality of scheduled solutions to generate a plurality of new scheduled solutions so as to update the optimal solution until an iteration condition is met and a final optimal scheduling scheme is obtained.
Optionally, in an embodiment of the present application, the generating module 100 includes: an acquisition unit.
The acquiring unit is used for acquiring a plurality of solutions based on the procedure sequence layer coding string, the machine selection layer coding string and the crown block selection layer coding string.
Optionally, in an embodiment of the present application, the transformation module 200 includes: a first calculation unit and an extraction unit.
The first computing unit is used for obtaining the incomplete schedule according to the schedule solution based on the incomplete schedule transformation.
And the extraction unit is used for extracting relevant information from the incomplete schedule, wherein the relevant information comprises at least one item of a workpiece number, a workpiece serial number, an origin, a destination and an assigned overhead traveling crane number.
Optionally, in an embodiment of the present application, the decoding module 300 includes: the device comprises a second calculation unit, a judgment unit and an execution unit.
And the second calculating unit is used for calculating the processing starting time and the processing ending time of each workpiece, the starting time and the ending time of each crown block scheduling task and the change of each crown block abscissa along with time according to the incomplete scheduling table.
And the judging unit is used for judging whether the crown block interferes or not.
And the execution unit executes the avoidance action and then moves when the crown block interferes, otherwise, directly moves, outputs the coordinate of the crown block and the state of the crown block, records the corresponding task time and obtains time information.
It should be noted that the above explanation of the embodiment of the component job shop scheduling method is also applicable to the component job shop scheduling apparatus of the embodiment, and is not repeated herein.
According to the component job shop scheduling device provided by the embodiment of the application, incomplete schedule conversion can be carried out on the scheduling solution of the scheduling scheme, distribution information of a workpiece procedure and a crown block task is obtained, the crown block is used for decoding, time information of the workpiece procedure and the crown block task is obtained, an optimal scheduling scheme is obtained according to the fitness of all solutions, the interference problem of the crown block is fully considered, efficient scheduling of the crown block of the large-scale component job shop is realized, and the intelligence level of the large-scale component job shop is improved. Therefore, the technical problems that in the related art, when the operation workshop is scheduled, the transportation link is regarded as an ideal process, and only the transportation time of transportation equipment is considered, so that the scheduling scheme has defects and is not beneficial to production and processing are solved.
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application. The electronic device may include:
The processor 602, when executing the program, implements the component job shop scheduling method provided in the above embodiments.
Further, the electronic device further includes:
a communication interface 603 for communication between the memory 601 and the processor 602.
The memory 601 is used for storing computer programs that can be run on the processor 602.
If the memory 601, the processor 602 and the communication interface 603 are implemented independently, the communication interface 603, the memory 601 and the processor 602 may be connected to each other through a bus and perform communication with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 6, but this is not intended to represent only one bus or type of bus.
Alternatively, in specific implementation, if the memory 601, the processor 602, and the communication interface 603 are implemented by being integrated on one chip, the memory 601, the processor 602, and the communication interface 603 may complete mutual communication through an internal interface.
The processor 602 may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement embodiments of the present Application.
The present embodiments also provide a computer-readable storage medium having stored thereon a computer program that, when executed by a processor, implements the above component job shop scheduling method.
In the description herein, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or N embodiments or examples. Moreover, various embodiments or examples and features of various embodiments or examples described in this specification can be combined and combined by one skilled in the art without being mutually inconsistent.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the feature. In the description of the present application, "N" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more N executable instructions for implementing steps of a custom logic function or process, and alternate implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of implementing the embodiments of the present application.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or N wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Further, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the N steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. If implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present application may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc. Although embodiments of the present application have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present application, and that variations, modifications, substitutions and alterations may be made to the above embodiments by those of ordinary skill in the art within the scope of the present application.
Claims (10)
1. A method for scheduling a component job shop, comprising the steps of:
generating a plurality of scheduling solutions for a scheduling scheme;
performing incomplete schedule conversion on each scheduling solution to obtain an incomplete schedule, and obtaining distribution information of a work procedure and a crown block task according to the incomplete schedule;
obtaining time information of the work procedure and the crown block task from an incomplete schedule by utilizing crown block decoding;
calculating the fitness of all solution schedules, determining an optimal solution according to the fitness of all solution schedules, and generating an optimal schedule scheme based on the optimal solution.
2. The method of claim 1, further comprising:
and selecting intersection and variation on the plurality of scheduling solutions to generate a plurality of new scheduling solutions so as to update the optimal solution until an iteration condition is met to obtain a final optimal scheduling scheme.
3. The method of claim 1, wherein generating the plurality of scheduling solutions for the scheduling scheme comprises:
the plurality of solutions is obtained based on the process sequence layer code string, the machine selection layer code string, and the crown block selection layer code string.
4. The method of claim 1, wherein said performing incomplete schedule transformation on each solution to obtain work piece process and overhead traveling crane task assignment information comprises:
obtaining an incomplete schedule according to a schedule solution based on the transformation of the incomplete schedule;
extracting relevant information from the incomplete schedule, wherein the relevant information comprises at least one of a work piece number, a work piece serial number, an origin, a destination, and an assigned overhead traveling crane number.
5. The method of claim 4, wherein said obtaining the time information of the work piece process and the crown block mission from an incomplete schedule using crown block decoding comprises:
calculating the processing start time and end time of each workpiece, the start time and end time of each crown block scheduling task and the change of each crown block horizontal coordinate along with time according to the incomplete scheduling table;
judging whether the crown block interferes or not;
and if the crown block interferes, executing an avoidance action and then moving, otherwise, directly moving, outputting a crown block coordinate and a crown block state, and recording corresponding task time to obtain the time information.
6. A component job shop scheduling apparatus, comprising:
a generating module for generating a plurality of scheduling solutions of a scheduling scheme;
the transformation module is used for carrying out incomplete scheduling table transformation on each scheduling solution to obtain an incomplete scheduling table and obtaining distribution information of a work piece process and a crown block task according to the incomplete scheduling table;
the decoding module is used for obtaining the time information of the work procedure and the crown block task from the incomplete schedule by utilizing crown block decoding;
and the scheduling module is used for calculating the fitness of all solution scheduling programs, determining an optimal solution according to the fitness of all solution scheduling programs, and generating an optimal scheduling scheme based on the optimal solution.
7. The apparatus of claim 6, wherein the transformation module comprises:
the first calculation unit is used for obtaining the incomplete schedule according to the schedule solution based on the transformation of the incomplete schedule;
and the extraction unit is used for extracting relevant information from the incomplete schedule, wherein the relevant information comprises at least one of a workpiece number, a workpiece serial number, an origin, a destination and an assigned overhead traveling crane number.
8. The apparatus of claim 6, wherein the decoding module comprises:
the second calculation unit is used for calculating the processing starting time and the processing ending time of each workpiece, the starting time and the ending time of each crown block scheduling task and the change of each crown block abscissa along with time according to the incomplete scheduling table;
the judging unit is used for judging whether the crown block generates interference;
and the execution unit executes the avoidance action and then moves when the crown block interferes, otherwise, directly moves, outputs the coordinate of the crown block and the state of the crown block, records the corresponding task time and obtains the time information.
9. An electronic device, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor executing the program to implement the component job shop scheduling method of any one of claims 1-5.
10. A computer-readable storage medium having stored thereon a computer program for execution by a processor to perform the method of component job shop scheduling according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210589482.3A CN114936778B (en) | 2022-05-26 | 2022-05-26 | Component job shop scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210589482.3A CN114936778B (en) | 2022-05-26 | 2022-05-26 | Component job shop scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114936778A true CN114936778A (en) | 2022-08-23 |
| CN114936778B CN114936778B (en) | 2022-12-09 |
Family
ID=82867189
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210589482.3A Active CN114936778B (en) | 2022-05-26 | 2022-05-26 | Component job shop scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114936778B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080052148A1 (en) * | 1997-10-09 | 2008-02-28 | Walker Jay S | Products and processes for managing the prices of vending machine inventory |
| CN105117791A (en) * | 2015-07-29 | 2015-12-02 | 沈阳工业大学 | Large piece processing workshop crane scheduling optimization method |
| CN105550751A (en) * | 2015-12-15 | 2016-05-04 | 重庆大学 | Steelmaking-continuous casting scheduling method utilizing priority policy hybrid genetic algorithm |
| CN106920036A (en) * | 2017-02-15 | 2017-07-04 | 苏州文海物联科技有限公司 | A kind of job shop equipment enlivens energy-conservation scheduling method and system entirely |
| CN108647914A (en) * | 2018-04-03 | 2018-10-12 | 广州视源电子科技股份有限公司 | Production scheduling method, apparatus, computer equipment and storage medium |
| CN111461402A (en) * | 2020-03-06 | 2020-07-28 | 上海汽车集团股份有限公司 | Logistics schedule optimization method and device, computer readable storage medium and terminal |
| CN112446642A (en) * | 2020-12-11 | 2021-03-05 | 大连英达士智能科技有限公司 | Multi-crown-block scheduling optimization method and system |
| CN113822528A (en) * | 2021-08-12 | 2021-12-21 | 株洲天桥起重机股份有限公司 | Crown block scheduling method, terminal, scheduling system and operation scheduling center for slab handling |
| CN114266524A (en) * | 2021-12-29 | 2022-04-01 | 苏州汇川控制技术有限公司 | Library area task arranging method, device, equipment and storage medium |
-
2022
- 2022-05-26 CN CN202210589482.3A patent/CN114936778B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080052148A1 (en) * | 1997-10-09 | 2008-02-28 | Walker Jay S | Products and processes for managing the prices of vending machine inventory |
| CN105117791A (en) * | 2015-07-29 | 2015-12-02 | 沈阳工业大学 | Large piece processing workshop crane scheduling optimization method |
| CN105550751A (en) * | 2015-12-15 | 2016-05-04 | 重庆大学 | Steelmaking-continuous casting scheduling method utilizing priority policy hybrid genetic algorithm |
| CN106920036A (en) * | 2017-02-15 | 2017-07-04 | 苏州文海物联科技有限公司 | A kind of job shop equipment enlivens energy-conservation scheduling method and system entirely |
| CN108647914A (en) * | 2018-04-03 | 2018-10-12 | 广州视源电子科技股份有限公司 | Production scheduling method, apparatus, computer equipment and storage medium |
| CN111461402A (en) * | 2020-03-06 | 2020-07-28 | 上海汽车集团股份有限公司 | Logistics schedule optimization method and device, computer readable storage medium and terminal |
| CN112446642A (en) * | 2020-12-11 | 2021-03-05 | 大连英达士智能科技有限公司 | Multi-crown-block scheduling optimization method and system |
| CN113822528A (en) * | 2021-08-12 | 2021-12-21 | 株洲天桥起重机股份有限公司 | Crown block scheduling method, terminal, scheduling system and operation scheduling center for slab handling |
| CN114266524A (en) * | 2021-12-29 | 2022-04-01 | 苏州汇川控制技术有限公司 | Library area task arranging method, device, equipment and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| WEIFEI GUO，ETAL: "A learning interactive genetic algorithm based on edge selection encoding for assembly job shop scheduling problem", 《COMPUTERS & INDUSTRIAL ENGINEERING》 * |
| 袁欣 等: "大批量汽车零部件柔性生成排程", 《机械设计与研究》 * |
| 许少杰: "基于遗传算法的钢厂天车建模与调度优化", 《中国优秀硕士学位论文全文数据库 工程科技I辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114936778B (en) | 2022-12-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guo et al. | Stochastic hybrid discrete grey wolf optimizer for multi-objective disassembly sequencing and line balancing planning in disassembling multiple products | |
| CN110070235B (en) | Flexible scheduling method for multiple mobile robots | |
| He et al. | Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies | |
| CN113671910B (en) | Integrated multi-AGV flexible job shop scheduling method, device and medium | |
| CN108876090A (en) | A kind of AGV cooperates with Optimization Scheduling with process unit | |
| EC et al. | Improvement of facility layout using systematic layout planning | |
| Suresh et al. | Resource constrained multi-project scheduling problem with resource transfer times | |
| CN112232548A (en) | Machining workshop intelligent scheduling optimization method and system based on genetic algorithm | |
| CN116523165B (en) | Collaborative optimization method for AMR path planning and production scheduling of flexible job shop | |
| Macchiaroli et al. | Modelling and optimization of industrial manufacturing processes subject to no-wait constraints | |
| CN109032150A (en) | Rail mounted automatic guide vehicle dynamic dispatching method based on genetic algorithm subsection optimization | |
| CN111353646A (en) | Steel-making flexible scheduling optimization method with switching time, system, medium and equipment | |
| Zhang et al. | A Q-learning-based hyper-heuristic evolutionary algorithm for the distributed flexible job-shop scheduling problem with crane transportation | |
| Zhao et al. | Model and heuristic solutions for the multiple double-load crane scheduling problem in slab yards | |
| CN114936778B (en) | Component job shop scheduling method and device | |
| Gu | Application research for multiobjective low-carbon flexible job-shop scheduling problem based on hybrid artificial bee colony algorithm | |
| CN109034540B (en) | Machine tool sequence arrangement dynamic prediction method based on work-in-process flow | |
| CN112990716B (en) | Double-resource constraint flexible workshop scheduling and layout integrated optimization method and system | |
| CN115309111A (en) | Resource-limited distributed hybrid flow shop scheduling method and system | |
| Stevens et al. | Scheduling a two-machine flowshop with travel times to minimize maximum lateness | |
| CN116562584A (en) | Dynamic workshop scheduling method based on Conv-lasting and generalization characterization | |
| CN114676987A (en) | Intelligent flexible job shop active scheduling method based on hyper-heuristic algorithm | |
| CN114186755A (en) | Visual intelligent logistics dynamic optimization management and control method and system | |
| CN116451888B (en) | Flexible production workshop cooperative scheduling method based on multiple AGVs | |
| CN115018373B (en) | Double-driving scheduling method and system based on solution space transformation and application |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |