CN113435750A - Workshop production and crown block cooperative scheduling method and device based on genetic algorithm - Google Patents

Workshop production and crown block cooperative scheduling method and device based on genetic algorithm Download PDF

Info

Publication number
CN113435750A
CN113435750A CN202110722755.2A CN202110722755A CN113435750A CN 113435750 A CN113435750 A CN 113435750A CN 202110722755 A CN202110722755 A CN 202110722755A CN 113435750 A CN113435750 A CN 113435750A
Authority
CN
China
Prior art keywords
scheduling
time
schemes
scheduling schemes
scheduling scheme
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110722755.2A
Other languages
Chinese (zh)
Other versions
CN113435750B (en
Inventor
刘振元
姜兆勤
周紫诺
赵俊波
王注
谢勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huazhong University of Science and Technology
Original Assignee
Huazhong 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 Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN202110722755.2A priority Critical patent/CN113435750B/en
Publication of CN113435750A publication Critical patent/CN113435750A/en
Application granted granted Critical
Publication of CN113435750B publication Critical patent/CN113435750B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/06313—Resource planning in a project environment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/12—Computing arrangements based on biological models using genetic models
    • G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • 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—Systems or methods specially adapted for 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

Abstract

The invention discloses a method and a device for collaborative scheduling of workshop production and a crown block based on a genetic algorithm, belonging to the technical field of collaborative scheduling of workshop production and the crown block, wherein the method comprises the following steps: firstly serializing all procedures to obtain an initial scheduling scheme; then based on the initial scheduling scheme, obtaining a plurality of scheduling schemes meeting constraint conditions through crossing and variation; regarding a plurality of scheduling schemes, taking time as a horizontal axis and station coordinates as a vertical axis, and representing each process as a line segment parallel to the horizontal axis; connecting the end points of all the previous processes and the starting points of the next processes, and omitting a scheduling scheme which cannot eliminate the crossing condition; and repeating the execution until the total number of the scheduling schemes reaches a preset number, and selecting an optimal scheduling scheme from the scheduling schemes. The invention can obviously improve the cooperative scheduling capability of production and crown blocks, save the time consumed by scheduling scheme arrangement, improve the operating efficiency of production equipment and crown blocks and have certain application value in engineering practice.

Description

Workshop production and crown block cooperative scheduling method and device based on genetic algorithm
Technical Field
The invention belongs to the technical field of workshop production and crown block cooperative scheduling, and particularly relates to a workshop production and crown block cooperative scheduling method and device based on a genetic algorithm.
Background
Taking the production of cast tubes as an example, there is a step of casting molten iron into finished cast tubes, and a production area where molten iron is treated is generally referred to as a molten iron area, and a production area where a hot die casting process is started after receiving molten iron is referred to as a hot die area. In the hot mould area, the crown block becomes a main transport tool for the production logistics by virtue of the advantages of large loading mass, relatively stable operation, no occupation of ground space and the like; the overhead travelling crane has the remarkable characteristic that the overhead travelling crane must run on the track, and the overhead travelling crane on the same track cannot move over other overhead travelling cranes, so that the overhead travelling crane often collides with the other overhead travelling cranes on the track.
The crown block scheduling is a control link for connecting working procedures on different stations in workshop production, and mainly aims to ensure smooth production logistics, but most of the prior production still depend on manual experience to schedule crown blocks, and when equipment is seized, the working procedures arriving thereafter are suspended for waiting; when the overhead traveling cranes in motion have path conflicts, the overhead traveling cranes are manually suspended and controlled to avoid, and the high efficiency and the global property are lacked.
Disclosure of Invention
Aiming at the problems, the invention aims to provide a workshop production and crown block cooperative scheduling method and device based on a genetic algorithm so as to solve the problems of low activity efficiency and frequent conflict of the conventional production scheduling.
In order to achieve the aim, the invention provides a workshop production and crown block cooperative scheduling method based on a genetic algorithm, which comprises the following steps:
s1, serializing all the procedures to obtain an initial scheduling scheme; the initial scheduling scheme comprises the starting time of each procedure, the buffering time and the number of the crown block distributed between two adjacent procedures;
s2, obtaining a plurality of scheduling schemes meeting constraint conditions through crossing and variation based on the initial scheduling scheme;
s3, regarding the plurality of scheduling schemes, regarding time as a horizontal axis and regarding station coordinates as a vertical axis, and representing each process as a line segment parallel to the horizontal axis; the starting point of the line segment corresponds to the starting time of each process, the end point corresponds to the sum of the starting time, unhooking time, duration time, hooking time and buffering time of each process, and the distance from the line segment to the horizontal axis represents the coordinate of the corresponding station;
s4, connecting the end points of all the previous processes and the starting points of the next processes, and judging whether each connecting line segment is crossed; if the intersection exists and the minimum speed required by the running of the crown block exceeds the safe speed, the corresponding scheduling schemes are omitted, otherwise, the plurality of scheduling schemes are reserved;
s5, repeating S2-S4 until the total number of scheduling schemes reaches a preset number;
and S6, selecting the optimal scheduling scheme from all the scheduling schemes obtained in S5 with the aim of minimizing the total running time.
Further, in S4, for the scheduling scheme where there is a crossing but the minimum speed required for the operation of the overhead traveling crane does not exceed the safe speed, the crossing is eliminated by:
the coordinates of the crown blocks at different moments are discretely sampled, and the running distance of the crown blocks is shortest on the premise of meeting the movement constraint and the safety constraint.
Further, before performing S6, the method further comprises:
s5', arranging all the scheduling schemes obtained in S5 according to the ascending order of the total running time, and reserving a plurality of former scheduling schemes; S2-S5 are repeatedly executed until a preset number of cycles is reached.
Further, before performing S1, the method further comprises:
gather the information of work piece, process, station and overhead traveling crane, specifically include: collecting all process numbers, corresponding relations between the processes and stations, and process set, unhooking time, duration and unhooking time after each process; and establishing a one-dimensional coordinate system covering the overhead travelling crane track, and acquiring all station numbers, all overhead travelling crane numbers, coordinates corresponding to each station and initial coordinates of each overhead travelling crane.
In order to achieve the above object, the present invention further provides a plant production and overhead traveling crane cooperative scheduling apparatus based on a genetic algorithm, comprising:
the initialization module is used for serializing all the procedures to obtain an initial scheduling scheme; the initial scheduling scheme comprises the starting time of each procedure, the buffering time and the number of the crown block distributed between two adjacent procedures;
a first processing module, configured to obtain, based on the initial scheduling scheme, multiple scheduling schemes that satisfy a constraint condition through intersection and variation;
the second processing module is used for representing each process as a line segment parallel to the horizontal axis by taking time as the horizontal axis and station coordinates as the vertical axis aiming at the scheduling schemes; the starting point of the line segment corresponds to the starting time of each process, the end point corresponds to the sum of the starting time, unhooking time, duration time, hooking time and buffering time of each process, and the distance from the line segment to the horizontal axis represents the coordinate of the corresponding station;
the third processing module is used for connecting the end points of all the previous processes and the starting points of the next processes and judging whether each connecting line segment is crossed or not; if the intersection exists and the minimum speed required by the running of the crown block exceeds the safe speed, the corresponding scheduling schemes are omitted, otherwise, the plurality of scheduling schemes are reserved;
the repeating module is used for repeatedly executing the operations from the first processing module to the third processing module until the total number of the scheduling schemes reaches a preset number;
and the output module is used for selecting the optimal scheduling scheme from the scheduling schemes obtained by the repeating module by taking the minimum total running time as a target.
Further, for a scheduling scheme where there is a crossing but the minimum speed required for the crown block to operate does not exceed a safe speed, the third processing module is further configured to eliminate the crossing by:
the coordinates of the crown blocks at different moments are discretely sampled, and the running distance of the crown blocks is shortest on the premise of meeting the movement constraint and the safety constraint.
Further, the apparatus further comprises:
the circulation module is used for arranging the scheduling schemes obtained by the repetition module in an ascending order of the total running time and reserving a plurality of previous scheduling schemes; and repeatedly executing the operations from the first processing module to the repeating module until the preset cycle number is reached.
Further, the apparatus further comprises:
the collection module is used for collecting information of workpieces, processes, stations and overhead traveling cranes, and specifically comprises: collecting all process numbers, corresponding relations between the processes and stations, and process set, unhooking time, duration and unhooking time after each process; and establishing a one-dimensional coordinate system covering the overhead travelling crane track, and acquiring all station numbers, all overhead travelling crane numbers, coordinates corresponding to each station and initial coordinates of each overhead travelling crane.
Generally, by the above technical solution conceived by the present invention, the following beneficial effects can be obtained:
(1) firstly serializing all procedures to obtain an initial scheduling scheme; then based on the initial scheduling scheme, obtaining a plurality of scheduling schemes meeting constraint conditions through crossing and variation; regarding a plurality of scheduling schemes, taking time as a horizontal axis and station coordinates as a vertical axis, and representing each process as a line segment parallel to the horizontal axis; connecting the end points of all the previous processes and the starting points of the next processes, and omitting a scheduling scheme which cannot eliminate the crossing condition; and repeating the execution until the total number of the scheduling schemes reaches a preset number, and selecting an optimal scheduling scheme from the scheduling schemes. The invention can obviously improve the cooperative scheduling capability of production and crown blocks, save the time consumed by scheduling scheme arrangement, improve the operating efficiency of production equipment and crown blocks and have certain application value in engineering practice.
(2) After the scheduling schemes with the preset number are obtained, the scheduling schemes are arranged according to the ascending order of the total operation time, the previous scheduling schemes are reserved, and the operation is circulated again until the preset circulation times are reached, so that the optimal scheduling scheme can be selected.
Drawings
FIG. 1 is a flow chart of a workshop production and crown block cooperative scheduling method based on a genetic algorithm according to an embodiment of the present invention;
FIG. 2 is a flowchart of a scheduling method for hot mold area and molten iron area in cast pipe production according to an embodiment of the present invention;
FIG. 3 is a space-time diagram of an apparatus provided by an embodiment of the present invention;
FIG. 4 is a schematic diagram of three possible allocation scenarios provided by embodiments of the present invention;
FIG. 5 is a schematic diagram of two possible conflict resolution manners provided by the embodiment of the present invention;
fig. 6 is a block diagram of a plant production and overhead traveling crane cooperative scheduling device based on a genetic algorithm according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
In the present application, the terms "first," "second," and the like (if any) in the description and the drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
Fig. 1 is a flowchart of a method for scheduling a workshop production and an overhead traveling crane cooperatively based on a genetic algorithm according to an embodiment of the present invention, where the scheduling method includes operation S1-operation S6.
Operation S1, serializing all the processes to obtain an initial scheduling scheme; the initial scheduling scheme comprises the starting time of each procedure, the buffering time and the number of the crown blocks distributed between two adjacent procedures.
Specifically, before performing S1, the method further includes:
gather the information of work piece, process, station and overhead traveling crane, specifically include: collecting all process numbers, corresponding relations between the processes and stations, and process set, unhooking time, duration and unhooking time after each process; and establishing a one-dimensional coordinate system covering the overhead travelling crane track, and acquiring all station numbers, all overhead travelling crane numbers, coordinates corresponding to each station and initial coordinates of each overhead travelling crane.
In operation S2, a plurality of scheduling schemes satisfying constraints are obtained through interleaving and mutation based on the initial scheduling scheme.
Operation S3, representing each process as a line segment parallel to a horizontal axis with time as the horizontal axis and station coordinates as a vertical axis for the plurality of scheduling schemes; the starting point of the line segment corresponds to the starting time of each process, the end point corresponds to the sum of the starting time, unhooking time, duration time, hooking time and buffering time of each process, and the distance from the line segment to the horizontal axis represents the coordinate of the corresponding station.
Operation S4, connecting the end points of all the preceding processes and the start points of the subsequent processes, and determining whether or not each connecting line segment intersects; if the intersection exists and the minimum speed required by the running of the overhead travelling crane exceeds the safe speed, the corresponding scheduling schemes are abandoned, otherwise, the plurality of scheduling schemes are reserved.
Specifically, for a scheduling scheme where there is a crossover but the minimum speed required for the crown block to operate does not exceed a safe speed, the crossover is eliminated by:
the coordinates of the crown blocks at different moments are discretely sampled, and the running distance of the crown blocks is shortest on the premise of meeting the movement constraint and the safety constraint.
Operation S5, the operations S2 through S4 are repeatedly performed until the total number of scheduling schemes reaches the preset number.
In operation S6, an optimal scheduling scheme is selected from all scheduling schemes obtained in S5, with the goal of minimizing the total running time.
Specifically, before performing S6, the method further includes:
s5', arranging all the scheduling schemes obtained in S5 according to the ascending order of the total running time, and reserving a plurality of former scheduling schemes; S2-S5 are repeatedly executed until a preset number of cycles is reached.
Fig. 6 is a block diagram of a plant production and overhead traveling crane cooperative scheduling apparatus based on a genetic algorithm according to an embodiment of the present invention. Referring to fig. 6, the plant production and overhead traveling crane coordinated scheduling apparatus 600 based on the genetic algorithm includes an initialization module 610, a first processing module 620, a second processing module 630, a third processing module 640, a repeating module 650, and an output module 660.
The initialization module 610, for example, performs operation S1 for serializing all the procedures into an initial scheduling scheme; the initial scheduling scheme comprises the starting time of each procedure, the buffering time and the number of the crown block distributed between two adjacent procedures;
the first processing module 620 performs, for example, operation S2, for obtaining, based on the initial scheduling scheme, a plurality of scheduling schemes satisfying constraints through intersection and variation;
the second processing module 630, for example, performs operation S3, where for the multiple scheduling schemes, the horizontal axis is time, the vertical axis is station coordinates, and each procedure is represented as a line segment parallel to the horizontal axis; the starting point of the line segment corresponds to the starting time of each process, the end point corresponds to the sum of the starting time, unhooking time, duration time, hooking time and buffering time of each process, and the distance from the line segment to the horizontal axis represents the coordinate of the corresponding station;
the third processing module 640, for example, executes operation S4, and is configured to connect the end points of all the previous processes and the start points of the immediately subsequent processes, and determine whether each connection line segment intersects; if the intersection exists and the minimum speed required by the running of the crown block exceeds the safe speed, the corresponding scheduling schemes are omitted, otherwise, the plurality of scheduling schemes are reserved;
the repeating module 650, for example, performs operation S5, configured to repeat the operations of the first to third processing modules until the total number of scheduling schemes reaches a preset number;
the output module 660 performs, for example, operation S6 for selecting an optimal scheduling scheme from the scheduling schemes obtained by the repeating module with a goal of minimizing the total running time.
The plant production and overhead traveling crane cooperative scheduling apparatus 600 based on the genetic algorithm is used for executing the plant production and overhead traveling crane cooperative scheduling method based on the genetic algorithm in the embodiment shown in fig. 1. For details that are not described in the present embodiment, please refer to the method for scheduling a workshop production and an overhead traveling crane cooperatively based on a genetic algorithm in the embodiment shown in fig. 1, which is not described herein again.
The present invention will be described in further detail below, taking the production of a hot die of a cast pipe as an example.
FIG. 2 is a flowchart of a scheduling method for hot mold area and molten iron area in cast pipe production according to an embodiment of the present invention. Referring to fig. 2 to 5, the scheduling method includes:
s1: processing the system time sequence data of the thermal model area;
(1) obtaining the whole process number, the process set after each process, the overhead traveling crane unhooking time required by the starting part of each process, the duration time required by each process and the overhead traveling crane hooking time required by the ending part of each process through process analysis;
(2) and obtaining the number of all stations, the number of all crown blocks, the coordinate of each station, the initial coordinate of each crown block and the coordinate interval in which each crown block can run through spatial layout analysis.
S1 relates to the following parameters:
p is a process set, P ═ {1, 2, …, P }, P ∈ P;
Figure BDA0003137330470000081
the molten iron is delivered to the working procedure set,
Figure BDA0003137330470000082
Bp-the collection of the immediately following steps of each step p,
Figure BDA0003137330470000083
tp-overhead traveling crane unhook time (unit: second) required for the beginning of each process p;
cpthe duration (in seconds) required for each process step p;
Figure BDA0003137330470000084
the overhead hooking time (unit: seconds) required for the ending part of each process p;
s is a station set, wherein S is {1, 2, …, S }, and S belongs to S;
j — set of sky cars, J ═ {1, 2, …, J }, J ∈ J;
As-the coordinates of the crown block corresponding to each station s (unit: meter);
xj0-the coordinates (initial coordinates) of each crown block j at the time instant 0 seconds (unit: meter);
x jthe lower limit of coordinates (in meters) that each crown block j can run;
Figure BDA0003137330470000085
upper limit of coordinates (unit: meter) each crown block j can run.
S2: obtaining an initial thermal model scheduling scheme by serializing the production process;
(1) taking an arrangement of the process sets, and arranging the process set immediately after each process after the process;
(2) distributing the crown block with the minimum number which can be distributed between every two working procedures;
(3) setting the caching time of each procedure to be 0 s;
(4) the starting time of each process is set as the accumulation of the unhooking time, the duration time, the hooking time, the buffering time and the overhead traveling crane movement time of the whole previous process. The moving time of the crown block is equal to the coordinate difference between the two working procedures divided by the maximum speed of the crown block.
S2 relates to the following parameters:
tp-the start time (unit: sec) of each process p;
c′pthe buffer time (unit: second) of each process p;
v-the maximum speed each crown block can travel (in meters/second);
djp-whether crown block j is assigned to join process p-1 with process p;
ejp-whether the crown block j can be used to connect the process p-1 with the process p.
Thus the specific activity is:
(1) taking an arrangement of P (P)n1，pn2，…，pnP) So that pi > pn，
Figure BDA0003137330470000091
(2)
Figure BDA0003137330470000092
(3)
Figure BDA0003137330470000093
(4)
Figure BDA0003137330470000094
The initial solution (t) is obtained from the above substepsp，djp，c′p)。
S3: obtaining a certain amount of thermal model zone scheduling schemes through a cross method and a variation method, and simultaneously meeting a plurality of constraints;
(1) generating a new thermal model scheduling scheme by using an intermediate recombination crossing equal crossing operator;
(2) generating a new hot module scheduling scheme by using mutation operators such as uniform mutation, boundary mutation, non-uniform mutation and the like;
(3) if the new hot mold area scheduling scheme does not meet the tight constraint, the occupation constraint, the distribution constraint, the cache constraint, the position constraint or the molten iron constraint, the scheme is omitted, and the step (1) is carried out;
(4) this step is complete when enough un-truncated thermal model scheduling schemes are obtained.
S3 relates to the following parameters:
t-time of day (unit: seconds);
Figure BDA0003137330470000095
-the minimum time interval (unit: seconds) between every two hot metal arrival processes;
upsthe number of stations s, u, which each process p requires to consumeps∈{0，1}；
σ -safety distance (unit: meter).
Thus the specific activity is:
(1-2) from the initial solution (t)p，djp，c′p) Several solutions (t) are obtained after crossing and mutationp，djp，c′p)；
(3) Determining whether the several solutions meet the following constraints:
firstly, tight post-constraint: after the current process is completely finished, any element in the process set immediately after the current process can be started.
Figure BDA0003137330470000101
Occupation constraint: at any time t, at most one working procedure is carried out on each station.
Figure BDA0003137330470000102
③ distribution and restraint: and only one overhead traveling crane can be arranged between every two working procedures.
Figure BDA0003137330470000103
Fourthly, cache restraint: for a process without a buffer time, the same crown block should be allocated at the beginning and ending portions thereof.
Figure BDA0003137330470000104
Position restraint: the relative order of the crown blocks needs to be kept unchanged at any time, and at least a safe distance is kept between the crown blocks.
Figure BDA0003137330470000105
Figure BDA0003137330470000106
Figure BDA0003137330470000107
Sixthly, molten iron restraint: the time interval of any two molten iron process numbers should be larger than the set minimum interval.
Figure BDA0003137330470000108
S4: obtaining a device space-time diagram corresponding to each thermal model scheduling scheme through the scheduling scheme and the system time sequence data;
(1) establishing a plane rectangular coordinate system by taking time as a horizontal axis and taking a space coordinate as a vertical axis;
(2) each process is expressed as a line segment, the line segment takes the starting time in the thermal model scheduling scheme as a starting point, the length of the line segment is divided into the sum of the unhooking time, the duration time, the hooking time in the time sequence data and the caching time in the thermal model scheduling scheme, the sum is parallel to a time axis, and the space coordinate of the line segment is equal to the space coordinate of the station to which the line segment belongs;
(3) and marking the crown block number allocated to the hot mould area scheduling scheme between every two working procedures.
That is, the space-time diagram of the apparatus shown in FIG. 3 is plotted, and FIG. 3 includes three steps, the starting times of which are t1、t2And t3The spatial coordinates of the stations are A1、A2And A3The unhooking time corresponding to the process is respectivelyt 1、t 2Andt 3the duration corresponding to the process is c1、c2And c3The hooking time corresponding to the working procedures is respectively
Figure BDA0003137330470000111
And
Figure BDA0003137330470000112
the first two processes are connected by a crown block No. 1, and the second two processes are connected by a crown block No. 2.
S5: judging the crossing situation in all the thermal model zone scheduling schemes, if the crossing can not be eliminated, abandoning the thermal model zone scheduling scheme, and going to S3;
(1) when one crown block is allocated to connect two processes, a straight line segment is connected between the end point of the process which is finished before and the start point of the process which is finished after the end point, and the straight line segment is called as a virtual straight line;
(2) if the two imaginary straight lines are crossed, judging whether the required critical speed exceeds the safe speed, and if so, abandoning the thermal model area scheduling scheme;
(3) if there is a thermal zone scheduling scheme that is dropped, then proceed to step S3, otherwise the step is complete.
The specific activities expressed by the symbols are as follows:
(1) activities allocated to each overhead travelling crane, i.e. according to each djpIs drawn from
Figure BDA0003137330470000113
Figure BDA0003137330470000114
To (t)p+1，Ap+1) A line segment of (a);
(2) and judging whether all the line segments have intersection conditions. Namely, for any two line segments, respectively recording as the slave (t)1，A1) To (t)2，A2) Segment of (a) and slave (t)3，A3) To (t)4，A4) The line segment of (c), calculate:
C1＝[min(t1，t2)≤max(t3，t4)]×[min(t3，t4)≤max(t1，t2)]×[min(A1，A2)≤max(A3，A4)]×[min(A3，A4)≤max(A1，A2)].
where the return results for the four expressions separated by a multiplication number, which is equivalent to an AND, are 0 or 1, so that C1The result of (2) is also 0 or 1. When C is present1At 0, there is no crossover between the two segments; when C is present1When 1, calculate:
C2＝{[(t3-t1)(A3-A4)-(t3-t4)(A3-A1)][(t3-t2)(A3-A4)-(t3-t4)(A3-A2)]＜0}×{[(t1-t3)(A3-A4)-(t1-t2)(A1-A3)][(t1-t4)(A1-A2)-(t1-t2)(A1-A4)]＜0}.
where the return of two expressions separated by a multiplication number is 0 or 1, the multiplication number corresponding to an AND, so that C2The result of (2) is also 0 or 1. When C is present2At 1, there is no crossover between the two segments; when C is present2At 0, there is a crossover between the two segments.
When there is a crossover between the two segments, the critical speed is calculated:
Figure BDA0003137330470000121
when v is larger than v, the thermal model zone scheduling scheme is abandoned, otherwise, the thermal model zone scheduling scheme is reserved.
Fig. 4 is a schematic diagram of three possible allocation scenarios provided by the embodiment of the present invention. The direction in which x increases is referred to as the right direction. After two processes are hooked on a crown block 1 and a crown block 2 respectively (at this time, the crown block 1 is relatively left), three situations may occur: the crown block No. 2 is unhooked firstly, the two crown blocks are unhooked simultaneously, and the crown block No. 1 is unhooked firstly (at the moment, the crown block No. 2 is relatively on the left). The first and third cases are resolvable, while the second case is non-resolvable.
Fig. 5 is a schematic diagram of two possible conflict resolution manners provided by the embodiment of the present invention. The direction in which x increases is referred to as the right direction. When the working procedure at the right side is unhooked, the crown block No. 1 and the crown block No. 2 move to the right side firstly, and then move to the left side; when the left process is unhooked first, the crown block No. 2 and the crown block No. 1 move left first and then move right.
S6: generating a running path of the crown block through the equipment space-time diagram, and simultaneously meeting a plurality of constraints;
and calculating the coordinates of the crown block at each moment for each hot die area scheduling scheme, and ensuring that the running distance of the crown block is shortest on the premise of meeting the movement constraint, the position constraint and the safety constraint. Since the thermal zone scheduling scheme in which the conflict cannot be resolved has been discarded in step S5, this step can always be completed in a limited time.
The specific activities expressed by the symbols are as follows:
Figure BDA0003137330470000131
Figure BDA0003137330470000132
Figure BDA0003137330470000133
Figure BDA0003137330470000134
s7: calculating the total operation time of each thermal model zone scheduling scheme, screening out a plurality of thermal model zone scheduling schemes, and turning to S3;
(1) calculating the total running time of each thermal model zone scheduling scheme;
(2) and arranging all the hot module scheduling schemes in ascending order according to the value of the total running time, and reserving a plurality of former hot module scheduling schemes.
The specific activities expressed by the symbols are as follows:
calculating the total running time:
Figure BDA0003137330470000135
s8: when the loop times from the step S3 to the step S7 reach a certain amount, the scheduling method stops, and the scheme with the minimum running total time becomes the thermal module scheduling scheme given by the scheduling method;
s9: processing the system time sequence data of the molten iron area;
(1) obtaining the whole hot-die process number of the molten iron area, the whole cold-die process number of the molten iron area, the periodicity of a hot-die workshop, the periodicity of a cold-die workshop and the average time required by each process through process analysis;
(2) obtaining the serial numbers of all resources and the condition whether each process needs all resources through spatial layout analysis;
(3) through the hot mold area scheduling scheme obtained in step S8, time points at which molten iron is required are extracted, and the time interval between every two time points is taken as a sequence of production beats.
S9 relates to the following parameters:
Γh-hot-metal-area hot-die process set, Γh＝{1，2，…，Γh}，γh∈Γh；
Γc-molten iron zone cold die process set, Γc＝{1，2，…，Γc}，γc∈Γc；
ΔhSet of periods in the hot mould shop, Δh＝{1，2，…，Δh}，δh∈Δh；
ΔcSet of periods in the hot mould shop, Δc＝{1，2，…，Δc}，δc∈Δc；
γhτEach hot die process γhThe average time required (unit: seconds);
Figure BDA0003137330470000141
each cold-die process γcThe average time required (unit: seconds);
Λ -molten iron area resource set, Λ ═ {1, 2, …, Λ }, λ ∈ Λ;
χγλ-the requirement condition of the process gamma on the molten iron area resource lambda, chiγλ∈{0，1}；
τδThe takt cycle of the hot mold shop (unit: seconds).
S10: obtaining an initial molten iron area scheduling scheme by serializing the production process;
(1) arranging hot mold processes of the molten iron area of each period according to the ascending order of the period number, and arranging cold mold processes of the molten iron area of each period after the hot mold processes of the molten iron area according to the ascending order of the period number;
(2) the starting time of each hot-die or cold-die working procedure of each molten iron area in each period is the sum of the average processing time of all the working procedures arranged before the starting time.
S10 relates to the following parameters:
Figure BDA0003137330470000142
δ thhGamma of one cyclehThe start timing (unit: second) of each thermal molding step.
Figure BDA0003137330470000143
δ thcGamma of one cyclecThe start time (unit: second) of each cold mold step.
Thus the specific activity is:
(1) take (Delta)h，Γh) And then (Δ) is arranged in series andc，Γc) In the same order. In this sequence { (1, 1), (1, 2), …, (Δ { (1, 1), (1, 2), (…) }h，Γh)，(1，1)，(1，2)，…，(Δc，Γc) In the method, each process has a unique number, which is recorded as:
Figure BDA0003137330470000151
Figure BDA0003137330470000152
(2) the start time of each process in the sequence is calculated.
Figure BDA0003137330470000153
Figure BDA0003137330470000154
S11: obtaining a certain amount of molten iron zone scheduling scheme through a cross method and a variation method, and simultaneously meeting a plurality of constraints;
(1) generating a new molten iron area scheduling scheme by using an intermediate recombination crossing equal crossing operator;
(2) generating a new molten iron area scheduling scheme by using mutation operators such as uniform mutation, boundary mutation, non-uniform mutation and the like;
(3) if the new molten iron zone scheduling scheme does not meet the tight constraint or the occupation constraint, the scheme is abandoned and the process is switched to (1);
(4) this step is completed when a sufficient number of unreleased molten iron zone scheduling schemes are obtained.
The specific activities expressed by the symbols are as follows:
(1-2) from the initial solution
Figure BDA0003137330470000155
Several solutions are obtained after crossing and mutation
Figure BDA0003137330470000156
(3) Determining whether the several solutions meet the following constraints:
firstly, tight post-constraint: after the current process is completely finished, any element in the process set immediately after the current process can be started.
Figure BDA0003137330470000157
Occupation constraint: in any time t, at most one working procedure is carried out on each station.
Figure BDA0003137330470000161
S12: calculating the fitness index of each molten iron zone scheduling scheme, screening a plurality of molten iron zone scheduling schemes, and turning to S11;
the specific activities expressed by the symbols are as follows:
calculating the fitness index of each molten iron area scheduling scheme:
Figure BDA0003137330470000162
wherein α, β are the weights of hot die production and cold die production, respectively, and α > β.
S13: and when the number of the circulation times from the step S11 to the step S12 reaches a certain amount, stopping the scheduling method, and making the scheme with the minimum fitness index be the molten iron zone scheduling scheme given by the scheduling method.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (8)

1. A workshop production and crown block cooperative scheduling method based on a genetic algorithm is characterized by comprising the following steps:
s1, serializing all the procedures to obtain an initial scheduling scheme; the initial scheduling scheme comprises the starting time of each procedure, the buffering time and the number of the crown block distributed between two adjacent procedures;
s2, obtaining a plurality of scheduling schemes meeting constraint conditions through crossing and variation based on the initial scheduling scheme;
s3, regarding the plurality of scheduling schemes, regarding time as a horizontal axis and regarding station coordinates as a vertical axis, and representing each process as a line segment parallel to the horizontal axis; the starting point of the line segment corresponds to the starting time of each process, the end point corresponds to the sum of the starting time, unhooking time, duration time, hooking time and buffering time of each process, and the distance from the line segment to the horizontal axis represents the coordinate of the corresponding station;
s4, connecting the end points of all the previous processes and the starting points of the next processes, and judging whether each connecting line segment is crossed; if the intersection exists and the minimum speed required by the running of the crown block exceeds the safe speed, the corresponding scheduling schemes are omitted, otherwise, the plurality of scheduling schemes are reserved;
s5, repeating S2-S4 until the total number of scheduling schemes reaches a preset number;
and S6, selecting the optimal scheduling scheme from all the scheduling schemes obtained in S5 with the aim of minimizing the total running time.
2. The method for collaborative scheduling of shop production and overhead traveling cranes based on genetic algorithms according to claim 1, wherein in the step S4, for the scheduling scheme that there is crossing but the minimum speed required by the overhead traveling crane to operate does not exceed the safe speed, the crossing is eliminated by the following method:
the coordinates of the crown blocks at different moments are discretely sampled, and the running distance of the crown blocks is shortest on the premise of meeting the movement constraint and the safety constraint.
3. The method for collaborative scheduling of shop production and overhead traveling cranes based on genetic algorithms according to claim 1 or 2, wherein before executing S6, the method further comprises:
s5', arranging all the scheduling schemes obtained in S5 according to the ascending order of the total running time, and reserving a plurality of former scheduling schemes; S2-S5 are repeatedly executed until a preset number of cycles is reached.
4. The method for collaborative scheduling of shop production and overhead traveling cranes based on genetic algorithms according to claim 1 or 2, wherein before executing S1, the method further comprises:
gather the information of work piece, process, station and overhead traveling crane, specifically include: collecting all process numbers, corresponding relations between the processes and stations, and process set, unhooking time, duration and unhooking time after each process; and establishing a one-dimensional coordinate system covering the overhead travelling crane track, and acquiring all station numbers, all overhead travelling crane numbers, coordinates corresponding to each station and initial coordinates of each overhead travelling crane.
5. A workshop production and overhead traveling crane cooperative scheduling device based on genetic algorithm is characterized by comprising:
the initialization module is used for serializing all the procedures to obtain an initial scheduling scheme; the initial scheduling scheme comprises the starting time of each procedure, the buffering time and the number of the crown block distributed between two adjacent procedures;
a first processing module, configured to obtain, based on the initial scheduling scheme, multiple scheduling schemes that satisfy a constraint condition through intersection and variation;
the second processing module is used for representing each process as a line segment parallel to the horizontal axis by taking time as the horizontal axis and station coordinates as the vertical axis aiming at the scheduling schemes; the starting point of the line segment corresponds to the starting time of each process, the end point corresponds to the sum of the starting time, unhooking time, duration time, hooking time and buffering time of each process, and the distance from the line segment to the horizontal axis represents the coordinate of the corresponding station;
the third processing module is used for connecting the end points of all the previous processes and the starting points of the next processes and judging whether each connecting line segment is crossed or not; if the intersection exists and the minimum speed required by the running of the crown block exceeds the safe speed, the corresponding scheduling schemes are omitted, otherwise, the plurality of scheduling schemes are reserved;
the repeating module is used for repeatedly executing the operations from the first processing module to the third processing module until the total number of the scheduling schemes reaches a preset number;
and the output module is used for selecting the optimal scheduling scheme from the scheduling schemes obtained by the repeating module by taking the minimum total running time as a target.
6. The cooperative shop production and overhead traveling crane scheduling apparatus based on genetic algorithm as claimed in claim 5, wherein the third processing module is further configured to eliminate the crossing by:
the coordinates of the crown blocks at different moments are discretely sampled, and the running distance of the crown blocks is shortest on the premise of meeting the movement constraint and the safety constraint.
7. The genetic algorithm-based workshop production and overhead travelling crane co-scheduling device according to claim 5 or 6, wherein the device further comprises:
the circulation module is used for arranging the scheduling schemes obtained by the repetition module in an ascending order of the total running time and reserving a plurality of previous scheduling schemes; and repeatedly executing the operations from the first processing module to the repeating module until the preset cycle number is reached.
8. The genetic algorithm-based workshop production and overhead travelling crane co-scheduling device according to claim 5 or 6, wherein the device further comprises:
the collection module is used for collecting information of workpieces, processes, stations and overhead traveling cranes, and specifically comprises: collecting all process numbers, corresponding relations between the processes and stations, and process set, unhooking time, duration and unhooking time after each process; and establishing a one-dimensional coordinate system covering the overhead travelling crane track, and acquiring all station numbers, all overhead travelling crane numbers, coordinates corresponding to each station and initial coordinates of each overhead travelling crane.
CN202110722755.2A 2021-06-29 2021-06-29 Workshop production and crown block cooperative scheduling method and device based on genetic algorithm Active CN113435750B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110722755.2A CN113435750B (en) 2021-06-29 2021-06-29 Workshop production and crown block cooperative scheduling method and device based on genetic algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110722755.2A CN113435750B (en) 2021-06-29 2021-06-29 Workshop production and crown block cooperative scheduling method and device based on genetic algorithm

Publications (2)

Publication Number Publication Date
CN113435750A true CN113435750A (en) 2021-09-24
CN113435750B CN113435750B (en) 2023-03-24

Family

ID=77757404

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110722755.2A Active CN113435750B (en) 2021-06-29 2021-06-29 Workshop production and crown block cooperative scheduling method and device based on genetic algorithm

Country Status (1)

Country Link
CN (1) CN113435750B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116795054A (en) * 2023-06-19 2023-09-22 上海交通大学 Intermediate product scheduling method in discrete manufacturing mode
CN117263037A (en) * 2023-10-26 2023-12-22 上海新创达半导体设备技术有限公司 Crown block control method, crown block control system, crown block system, server and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103631243A (en) * 2013-12-13 2014-03-12 重庆大学 Rescheduling method and rescheduling system of steel making and continuous casting on basis of genetic algorithm
KR20200107591A (en) * 2019-03-08 2020-09-16 한국전자기술연구원 Energy-saving production scheduling operation method and system for continuous batch lot-based heat treatment processes
CN112446642A (en) * 2020-12-11 2021-03-05 大连英达士智能科技有限公司 Multi-crown-block scheduling optimization method and system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103631243A (en) * 2013-12-13 2014-03-12 重庆大学 Rescheduling method and rescheduling system of steel making and continuous casting on basis of genetic algorithm
KR20200107591A (en) * 2019-03-08 2020-09-16 한국전자기술연구원 Energy-saving production scheduling operation method and system for continuous batch lot-based heat treatment processes
CN112446642A (en) * 2020-12-11 2021-03-05 大连英达士智能科技有限公司 Multi-crown-block scheduling optimization method and system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116795054A (en) * 2023-06-19 2023-09-22 上海交通大学 Intermediate product scheduling method in discrete manufacturing mode
CN116795054B (en) * 2023-06-19 2024-03-19 上海交通大学 Intermediate product scheduling method in discrete manufacturing mode
CN117263037A (en) * 2023-10-26 2023-12-22 上海新创达半导体设备技术有限公司 Crown block control method, crown block control system, crown block system, server and storage medium

Also Published As

Publication number Publication date
CN113435750B (en) 2023-03-24

Similar Documents

Publication Publication Date Title
CN113435750B (en) Workshop production and crown block cooperative scheduling method and device based on genetic algorithm
CN106779220B (en) Steelmaking-continuous casting-hot rolling integrated scheduling method and system
CN108919760B (en) Intelligent workshop autonomous production process dynamic linkage control method based on digital twins
CN103631243B (en) A kind of steel smelting-continuous casting rescheduling method based on genetic algorithm and system
CN105550751A (en) Steelmaking-continuous casting scheduling method utilizing priority policy hybrid genetic algorithm
CN105185148B (en) A kind of bus dispatching method, apparatus and system
CN104835012A (en) Iron and steel enterprise production scheduling management system and production scheduling management method
CN110442090A (en) A kind of steel-making whole process materials stream informationization method based on Internet of Things
CN101944201A (en) Multi-agent-based steelmaking workshop crane scheduling simulation method
CN112699524A (en) Simulation optimization scheduling model applied to high-speed tool steel steelmaking process of special steel mill
CN112947319B (en) Batch collection and scheduling optimization method and system for multiple production lines of cold rolling area of iron and steel enterprise
CN111242414A (en) Plan scheduling system applied to steelmaking-continuous casting process in steel industry
CN112446642A (en) Multi-crown-block scheduling optimization method and system
CN108303958A (en) A kind of multi-objective flexible dispatching method of steel-making continuous casting process
CN104444821B (en) The control method that a kind of iron and steel slab storehouse loop wheel machine runs
CN107895231B (en) Driving scheduling method and system for electroplating or anodic oxidation intelligent production line
CN111061987A (en) Group tower scheduling optimization method considering active avoidance
CN101941648A (en) Method for processing conflict among multiple cranes in logistics simulation system in steelmaking continuous casting workshop
JP3166822B2 (en) Operation schedule creation system for steelmaking process
CN116909236A (en) Hot metal ladle logistics simulation and intelligent scheduling method and system based on iron-steel interface
CN113342002B (en) Multi-mobile-robot scheduling method and system based on topological map
CN110847943B (en) Hydraulic support and motor operation time sequence planning method in coal mining process
CN113205277B (en) Workshop production and crown block cooperative scheduling method and device based on space-time rule
Sun et al. Scheduling of steel-making and continuous casting system using the surrogate subgradient algorithm for Lagrangian relaxation
CN114153185A (en) Steelmaking-continuous casting flexible scheduling optimization method and system based on dynamic multi-objective differential evolution algorithm

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