CN111105164A - Workshop scheduling method, device and equipment - Google Patents

Workshop scheduling method, device and equipment Download PDF

Info

Publication number
CN111105164A
CN111105164A CN201911346253.3A CN201911346253A CN111105164A CN 111105164 A CN111105164 A CN 111105164A CN 201911346253 A CN201911346253 A CN 201911346253A CN 111105164 A CN111105164 A CN 111105164A
Authority
CN
China
Prior art keywords
heat treatment
population
chromosome
workpieces
item
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
CN201911346253.3A
Other languages
Chinese (zh)
Other versions
CN111105164B (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.)
Beijing Institute of Technology BIT
Original Assignee
Beijing Institute of Technology BIT
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 Beijing Institute of Technology BIT filed Critical Beijing Institute of Technology BIT
Priority to CN201911346253.3A priority Critical patent/CN111105164B/en
Publication of CN111105164A publication Critical patent/CN111105164A/en
Application granted granted Critical
Publication of CN111105164B publication Critical patent/CN111105164B/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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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—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

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Health & Medical Sciences (AREA)
  • Theoretical Computer Science (AREA)
  • Biophysics (AREA)
  • Economics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • General Health & Medical Sciences (AREA)
  • General Business, Economics & Management (AREA)
  • Evolutionary Biology (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Educational Administration (AREA)
  • Data Mining & Analysis (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Physiology (AREA)
  • Genetics & Genomics (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Computational Linguistics (AREA)
  • Game Theory and Decision Science (AREA)
  • Evolutionary Computation (AREA)
  • Quality & Reliability (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Manufacturing & Machinery (AREA)
  • Primary Health Care (AREA)
  • General Factory Administration (AREA)

Abstract

The invention discloses a workshop scheduling method, a device and equipment, wherein the workshop scheduling method comprises the following steps: generating a first population according to the sequence of the workpieces reaching the heat treatment link, wherein the first population comprises at least one population individual corresponding to the sequence; performing cross operation and variation operation on population individuals in the first population to generate a second population; determining the heat treatment processing time and sequence of the second population based on the heat treatment furnace volume decoding rule; acquiring the bottleneck degree of the heat treatment equipment; determining the fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree; and determining a scheduling solution for scheduling the workshop according to the fitness. According to the embodiment of the invention, the link constraint of the flexible job shop and the heat treatment link constraint are comprehensively considered, and the workpieces entering the heat treatment furnace each time are reasonably selected and combined, so that the maximum completion time of the workpieces is minimized, and the utilization rate of the heat treatment furnace is maximized.

Description

Workshop scheduling method, device and equipment
Technical Field
The invention relates to the technical field of manufacturing, in particular to a workshop scheduling method, device and equipment.
Background
The Flexible Job-shop Scheduling Problem (FJSP) has been considered to be the closest Scheduling Problem to the actual production. The problem is mainly solved for scheduling n workpieces on m processing devices. However, according to practical circumstances, in the case of machine type parts, the production process of the workpiece includes not only a metal material removal process (machining process) requiring expensive equipment but also often a heat treatment process requiring a heat treatment furnace. For the scheduling problem of the flexible job shop with the heat treatment link, the traditional job plan scheduling only considers the machining process, and the heat treatment process is used as an outsourcing to simulate the pure waiting time of the workpiece between two machining processes. This processing method cannot provide a fine heat treatment plan, and further causes the scheduling of the workpiece on the equipment to become inaccurate because the accurate time of the heat treatment process cannot be estimated, so that the work plan loses the guidance of actual production.
Disclosure of Invention
In order to solve the technical problems, the invention provides a workshop scheduling method, a workshop scheduling device and workshop scheduling equipment, and solves the problem that the arrangement plan of workpieces on the equipment is inaccurate in the prior art.
According to an aspect of the present invention, there is provided a method for scheduling a plant, including:
generating a first population according to the sequence of the workpieces reaching the heat treatment link, wherein the first population comprises at least one population individual corresponding to the sequence;
performing cross operation and variation operation on population individuals in the first population to generate a second population;
determining the heat treatment processing time and sequence of the second population based on the heat treatment furnace volume decoding rule;
acquiring the bottleneck degree of the heat treatment equipment;
determining the fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree;
and determining a scheduling solution for scheduling the workshop according to the fitness.
Optionally, before the generating the first population according to the order of arrival of the workpieces at the thermal processing stage, the method further comprises:
initializing all populations based on the codes of the workpieces, and obtaining the sequence of all workpieces reaching a heat treatment link;
initializing tabu tables, wherein the tabu tables comprise a cross tabu table and a mutation operator tabu table, and each population individual corresponds to one cross tabu table and one mutation operator tabu table.
Optionally, the performing a crossover operation on population individuals in the first population includes:
selecting population individuals in the first population as first parent chromosomes of cross operation;
acquiring a cross tabu table corresponding to the first parent chromosome, wherein the cross tabu table comprises at least one tabu item;
determining a reference chromosome according to the number of tabu items contained in the cross tabu table;
generating a position fixed item and a sequence fixed item of the cross operation;
performing cross operation on the first parent chromosome according to the position fixing item and the sequence fixing item to generate a first child chromosome;
judging whether at least one item in the position fixed item and the sequence fixed item is the same as a tabu item in a cross tabu table of the reference chromosome;
when at least one of the position fixed item and the sequence fixed item is the same as the tabu item, judging whether the fitness value of the first child chromosome is greater than the optimal value in the fitness values of the first parent chromosome;
when the fitness values of the first child chromosomes are all larger than the optimal value in the fitness values of the first parent chromosome, ending the crossover operation; otherwise, continuing to execute the step of generating the position fixed item and the sequence fixed item of the cross operation;
when the position fixed item and the sequence fixed item do not have the same genes as the tabu item, respectively calculating the similarity of the position fixed item and the sequence fixed item and a cross tabu table of the reference chromosome;
under the condition that the similarity is greater than a first preset value, judging whether the fitness value of the first offspring chromosome is greater than the optimal value in the fitness value of the first parent chromosome, and under the condition that the similarity is less than or equal to the first preset value, finishing the cross operation;
generating a first sub-population according to the first parent chromosome and the first child chromosome.
Optionally, the separately calculating the similarity of the position fix term and the order fix term to the cross tabu table of the reference chromosome comprises:
according to the formula:
Figure BDA0002333446650000031
respectively calculating the similarity of the position fixed item and the sequence fixed item and the cross tabu table of the reference chromosome;
wherein D issIndicating the degree of similarity, CSiRepresenting the number of identical genes in the position-fixed item and the ith item in the cross tabu table; CP (CP)iRepresenting the number of identical genes in the order fixed item and the ith item in the cross tabu table; CTiRepresents the number of genes in the i-th entry in the cross-tabu table.
Optionally, performing mutation operations on population individuals within the first population, including:
selecting population individuals in the first subgroup as second parent chromosomes of the mutation operation;
acquiring a mutation operator tabu table of the second parent chromosome, wherein the mutation operator tabu table comprises at least one tabu item;
generating a pair of genes for the mutation operation;
performing mutation operation on the second parent chromosome according to the gene pair to generate a second offspring chromosome;
judging whether at least one item in the gene pair is the same as a tabu item in the mutation operator tabu table or not;
continuing the step of generating the pair of genes for mutation operation when at least one of the pair of genes is the same as the tabu item;
when the genes identical to the tabu item do not exist in the gene pair, judging whether the fitness value of the second offspring chromosome is larger than that of the second parent chromosome;
when the fitness value of the second offspring chromosome is larger than that of the second parent chromosome, ending mutation operation, otherwise, continuing to execute the step of generating the gene pair of the mutation operation;
and generating the second population according to the second parent chromosome and the second child chromosome.
Optionally, the determining the heat treatment processing time and sequence of the second population based on the heat treatment furnace volume decoding rule comprises:
initializing a residual volume C ═ C of the heat treatment furnace, wherein C' denotes the residual volume and C is an initial value of the residual volume;
acquiring workpiece information corresponding to chromosomes in the second population, wherein the workpiece information comprises: workpieces, single piece volume V, workpiece number N and workpiece number N' which are not completed in batches corresponding to the first gene of the chromosome in the second population;
judging the volume of the workpieces which are not batched into groups and the size of the residual volume, and updating the residual volume to be: c ═ C '-N' xv, the batch of workpieces is complete;
giving the heat treatment start time and the heat treatment end time of the batched batch according to the time node of the heat treatment furnace and the heat treatment working hours of the batch, and deleting a first gene in the chromosome;
updating the remaining volume to the initial value C if the C "is zero;
under the condition that C' is not zero, if the target workpieces of the workpiece group corresponding to the first gene do not exist in the chromosome, updating the residual volume to the initial value C, and continuing to execute the step of acquiring the workpiece information corresponding to the chromosome in the second group;
if the target workpieces exist, recording the single piece volume of the first workpiece in the target workpieces as V, the number of workpieces is N, the number of workpieces which are not batched is N', and continuing to execute the step of judging the volume of the workpieces which are not batched and the size of the residual volume;
in the case where the number of genes in the chromosome is zero, the encoding is ended.
Optionally, the determining the heat treatment processing time and sequence of the second population based on the heat treatment furnace volume decoding rule further includes:
in the case of N ' × V > C ', completing batching of C '/V workpieces, updating the remaining volume to the initial value C, updating the number of workpieces not subjected to batching to: n ═ N '-C'/V;
and giving the heat treatment starting time and the heat treatment ending time of the batched batch according to the time node of the heat treatment furnace and the heat treatment working hours of the batch, continuing to execute the step of acquiring the workpiece information corresponding to the chromosomes in the second population, and ending the coding under the condition that the number of the genes in the chromosomes is zero.
Optionally, the acquiring the bottleneck degree of the heat treatment equipment comprises:
dividing all the working procedures which are not arranged into a pre-heat treatment working procedure and a post-heat treatment working procedure to generate a pre-heat treatment working procedure set and a post-heat treatment working procedure set;
acquiring a first target process set according to the pre-heat treatment process set, wherein the first target process set is a set of processes arranged in a next process in the pre-heat treatment process set;
according to the formula:
Figure BDA0002333446650000041
calculating a first bottleneck degree of optional equipment of all the procedures in the first target procedure set;
wherein the content of the first and second substances,
Figure BDA0002333446650000042
indicates the first neck degree, SijRepresents OijThe machining start time of the non-heat treatment step (2); o isijDenotes JiJ is 1, 2, … Gi，GiDenotes JiThe number of steps (2); j. the design is a squareiRepresenting the workpieces, i is 1, 2, … n, n represents the number of workpieces; vijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0; mpDenotes the devices p, p is 1, 2, … m, m denotes the number of devices; t isijRepresents OijThe theoretical single-piece processing man-hour of the non-heat treatment process of (2); xijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0;
selecting equipment for all processes in the first target process set according to the first bottleneck degrees of all selectable equipment;
the equipment arrangement of the post-heat treatment process is performed in a case where all the processes in the pre-heat treatment process set complete the equipment arrangement.
Optionally, the apparatus arrangement for performing the post-heat treatment process comprises:
acquiring a second target process set according to the post-heat treatment process set, wherein the second target process set is a set of processes arranged in a previous process in the post-heat treatment process set;
according to the formula:
Figure BDA0002333446650000051
calculating the second target processA second bottleneck level of optional equipment for all processes in the set, wherein,
Figure BDA0002333446650000052
representing a second degree of bottleneck, EijRepresents OijThe machining end time of the non-heat treatment step (2);
selecting equipment for all processes in the second target process set according to the second bottleneck degrees of all the selectable equipment;
in the case where all the processes in the post-heat treatment process set complete the equipment arrangement, the decoding ends.
Optionally, determining fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree comprises:
determining the maximum processing time of the workpiece and the utilization rate of the heat treatment equipment according to the heat treatment processing time and sequence and the bottleneck degree;
according to the formula: f ═ Cmax/ηmCalculating the fitness;
wherein F represents fitness, CmaxIndicating the maximum processing time of the workpiece, ηmIndicating the heat treatment equipment utilization rate.
According to another aspect of the present invention, there is provided a plant scheduling apparatus, comprising:
the first generation module is used for generating a first population according to the sequence of the workpieces reaching the heat treatment link, and the first population comprises at least one population individual corresponding to the sequence;
the first processing module is used for performing cross operation and variation operation on population individuals in the first population to obtain a second population;
a first determining module, configured to determine a heat treatment processing time and sequence of the second population based on a heat treatment furnace volume decoding rule;
the first acquisition module is used for acquiring the bottleneck degree of the heat treatment equipment;
a second determining module, configured to determine fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree;
and the third determining module is used for determining a scheduling solution for workshop scheduling according to the fitness.
According to a further aspect of the present invention, there is provided a plant scheduling apparatus comprising a processor, a memory and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the plant scheduling method described above.
The embodiment of the invention comprehensively considers the flexible job shop link constraint and the heat treatment link constraint aiming at the scheduling problem of the flexible job shop with the heat treatment link, reasonably selects and combines the workpieces entering the heat treatment furnace each time by reasonably arranging the processing sequence and the processing equipment selection of the workpieces to minimize the maximum completion time of the workpieces and maximize the utilization rate of the heat treatment furnace, thereby providing the scheduling scheme reference for the scheduling personnel of the flexible job shop under various and small batches.
Drawings
FIG. 1 is a flow chart of a method for scheduling a plant according to an embodiment of the present invention;
FIG. 2 shows a schematic cross-operation of an embodiment of the present invention;
FIGS. 3 a-3 b are schematic diagrams illustrating invalid crossover phenomena according to embodiments of the present invention;
FIG. 4 is a schematic diagram illustrating a variant operation of an embodiment of the present invention;
FIG. 5 is a second flowchart of a workshop scheduling method according to an embodiment of the invention;
fig. 6 is a schematic block diagram of a plant scheduling apparatus according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention provides a method for scheduling a plant, including:
step 11, generating a first population according to the sequence of the workpiece reaching the heat treatment link, wherein the first population comprises at least one population individual corresponding to the sequence;
different from the common machining equipment, the heat treatment furnace belongs to batch processing equipment, and workpieces with similar materials and processes can enter the heat treatment furnace in the same batch. When a workpiece reaches the heat treatment process, if the heat treatment furnace is not idle, the workpiece needs to be temporarily stored in a buffer area before the heat treatment furnace to wait. To minimize the maximum processing time of a workpiece, the waiting time of the workpiece in the buffer area should be minimized.
In this embodiment, in order to more simply and intuitively represent each scheduling solution, a workpiece-based encoding scheme is adopted, and the encoding scheme represents the sequence of all workpieces reaching the heat treatment link. Based on the encoded initialization population of the workpieces, acquiring the sequence of all the workpieces reaching the heat treatment link, wherein the sequence can be various, each workpiece is used as a gene, then each sequence forms a population individual comprising at least one gene, namely a chromosome, and a plurality of population individuals form the first population.
Step 12, performing cross operation and mutation operation on population individuals in the first population to generate a second population;
the population individuals participating in the cross operation can be randomly selected, and the new population generated after the cross operation is subjected to variation operation, so that the diversity of the population can be increased, and the global search performance of the algorithm can be improved. And the second population is a new population comprising the first population and chromosomes obtained after cross variation.
Step 13, determining the heat treatment processing time and sequence of the second population based on a heat treatment furnace volume decoding rule;
in this embodiment, to minimize the maximum processing time of the workpiece, the waiting time of the workpiece in the buffer area should be minimized. If the thermal nursing furnace is idle, the volume constraint of the thermal nursing furnace needs to be considered, and workpieces which can enter the thermal treatment furnace in the same batch are selected from the buffer area and enter in a batch mode. If too few workpieces enter the heat treatment furnace in the same batch, the utilization rate of the batch of workpieces to the volume of the heat treatment furnace is reduced, the number of processing batches of the heat treatment furnace is increased, and the maximum processing working hour is increased. When the workpieces are subjected to the heat treatment process, the workpieces of different types in the same batch of workpieces are separated again, and the subsequent machining process is continued. Therefore, for a workpiece with heavy task in the subsequent machining links, it is required that it is arranged to enter the heat treatment furnace with higher priority to avoid that the completion time of the workpiece is delayed more than that of other workpieces, thereby resulting in an increase in the maximum processing man-hour.
In the production scheduling stage of the heat treatment link, the volume decoding rule based on the heat treatment furnace is utilized, the utilization rate of the heat treatment furnace is maximized, and the number of batches of the same batch of workpieces which are processed in a dispersed mode is reduced as much as possible.
Step 14, obtaining the bottleneck degree of the heat treatment equipment;
by using a bottleneck degree-based machining equipment selection rule, after the processing time and sequence of the heat treatment process of the workpiece are determined, the bottleneck degree of the equipment, which changes along with the arrangement of the processes, is considered, and the processes are uniformly arranged on each equipment as much as possible, so that the process blockage on the bottleneck equipment is avoided.
Step 15, determining the fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree;
optionally, according to the heat treatment processing time and sequence and the bottleneck degree, the maximum processing time of the workpiece and the utilization rate of the heat treatment furnace can be determined. In order to comprehensively consider the flexible job shop link constraint and the heat treatment link constraint and take the minimization of the maximum processing time and the maximization of the utilization rate of the heat treatment furnace as targets, in order to balance the two targets, the fitness of the population individuals of the second population needs to be calculated, and the value of the fitness is used for judging whether the optimal solution is reached.
And step 16, determining a scheduling solution for workshop scheduling according to the fitness.
The scheduling solution may be the solution with the largest fitness value, the solution when a preset value set according to user requirements is reached, or the solution obtained when the iteration times set by the user are reached. And the sequence corresponding to the genes contained in the scheduling solution is the scheduling sequence of each workpiece in the workshop scheduling.
The embodiment of the invention comprehensively considers the flexible job shop link constraint and the heat treatment link constraint aiming at the scheduling problem of the flexible job shop with the heat treatment link, reasonably selects and combines the workpieces entering the heat treatment furnace each time by reasonably arranging the processing sequence and the processing equipment selection of the workpieces to minimize the maximum completion time of the workpieces and maximize the utilization rate of the heat treatment furnace, thereby providing the scheduling scheme reference for the scheduling personnel of the flexible job shop under various and small batches.
Optionally, before the generating the first population according to the order of arrival of the workpieces at the thermal processing stage, the method further comprises:
initializing all populations based on the codes of the workpieces, and obtaining the sequence of all workpieces reaching a heat treatment link. In order to express each scheduling solution more simply and intuitively, a workpiece-based coding mode is adopted. The coding represents the sequence in which all the workpieces (job) arrive at the heat treatment stage. That is, for all n jobs, the encoding method is an ordering of the n jobs. For example, the code indicates that the order in which the jobs arrive in the heat treatment segment is: job 2 → job 1 → job 5 → job 3 → job 4.
Initializing tabu tables, wherein the tabu tables comprise a cross tabu table and a mutation operator tabu table, and each population individual corresponds to one cross tabu table and one mutation operator tabu table.
The cross tabu table is a fixed item tabu table, and at least one gene item forbidden to participate in cross operation is included in the cross tabu table; the mutation operator tabu table comprises at least one gene item which is forbidden to participate in mutation operation. Each population individual, namely each chromosome, corresponds to a cross tabu table and a mutation operator tabu table, and is used for constraining fixed items of cross operation and mutation operators of mutation operation. A cross tabu table and a mutation operator tabu table are added in a cross link and a mutation link for each individual in the population, so that the phenomenon that the population is subjected to backward evolution or stagnation of evolution due to the fact that existing individuals or individuals similar to the existing individuals are generated in the cross and mutation processes is avoided, and the global search performance of the algorithm is improved.
Specifically, the performing a crossover operation on population individuals in the first population may include:
and 21, selecting population individuals in the first population as first parent chromosomes of the cross operation. Aiming at the encoding mode based on the workpiece, the embodiment of the invention provides a crossover operator based on workpiece encoding. The selection group of the first parent chromosome can be random or set according to the condition of user requirements.
And step 22, acquiring a cross tabu table corresponding to the first parent chromosome, wherein the cross tabu table comprises at least one tabu item.
In order to prevent invalid crossing of the population, the embodiment of the invention designs a crossing tabu table aiming at a crossing mode based on a workpiece. The tabu list is attached to each individual in the population. When an individual performs a crossover operation to generate a position-fixed item and a sequence-fixed item, it is first necessary to determine whether the position-fixed item or sequence-fixed item is the same as or similar to any one of the crossover tabu lists. If the data are different and not similar, the cross operation can be continued to generate filial generations; otherwise, it is necessary to determine whether to continue the crossover operation according to the privilege condition.
The tabu items in the cross tabu table may be genes set by the user and not allowed to participate in the cross operation, or may be fixed items used in the previous iteration process of the iteration. In order to avoid generating an existing individual or an individual similar to the existing individual in the crossing process, which causes backward population evolution or stagnation of evolution, the generated fixed item needs to be compared with the tabu item in the crossing tabu table in the crossing process, so as to determine whether to continue the crossing operation.
And step 23, determining a reference chromosome according to the number of tabu items contained in the cross tabu table. Optionally, the chromosome with more tabu items in the cross tabu table in the first parent chromosome participating in the crossover operation is selected as the reference chromosome.
And 24, generating a position fixed item and a sequence fixed item of the cross operation. The position fix term and the order fix term may be randomly generated.
And 25, performing cross operation on the first parent chromosome according to the position fixing item and the sequence fixing item to generate a first child chromosome.
As shown in fig. 2, taking the first parent chromosome including P1 and P2 and the first child chromosomes generated by the crossover operation as S1 and S2 as an example, when the crossover operation is performed, the genes in the chromosomes are randomly divided into two parts (into the sequence fixed item and the position fixed item), and then the genes of the position fixed item in the first parent chromosomes P1 and P2 are passed to the first child chromosomes S1 and S2 without change. And then the genes of the sequence-fixed items of the first parent chromosome P2 and P1 are inserted into the gaps of S1 and S2 in sequence, respectively. FIG. 2 is a schematic diagram of the crossover operator, in which genes 2, 7, and 8 are position-invariant terms, and the remaining genes are order-invariant terms.
And 26, judging whether at least one item in the position fixed item and the sequence fixed item is the same as a contraindication item in a cross contraindication table of the reference chromosome.
FIGS. 3a and 3b are diagrams of invalid cross-appearances, wherein FIG. 3a is the same position fix entry and sequence fix entry; FIG. 3b shows similar position-fixed terms and sequence-fixed terms.
And 27, judging whether the fitness value of the first child chromosome is greater than the optimal value in the fitness values of the first parent chromosome when at least one of the position fixing item and the sequence fixing item is the same as the tabu item.
In this embodiment, if the position fix term or the sequence fix term generated is the same as a certain term in the cross tabu table of the reference chromosome, indicating that there is a possibility of generating an existing individual, in order to improve the global search performance of the algorithm, it is necessary to compare whether the generated first child chromosome is better than the first parent chromosome, where better means that the fitness value of the first child chromosome is greater than the best of the first parent chromosomes.
Step 28, when the fitness values of the first child chromosomes are all larger than the optimal value in the fitness values of the first parent chromosomes, ending the crossover operation; otherwise, continuing to execute the step of generating the position fixed item and the sequence fixed item of the cross operation.
If none of the first child chromosomes is better than the best of the first parent chromosomes, then switching to perform the step 24; otherwise, the crossover operation of the first parent chromosome is ended.
And 29, when the same genes as the tabu items do not exist in the position fixed items and the sequence fixed items, respectively calculating the similarity of the position fixed items and the sequence fixed items and the cross tabu table of the reference chromosome.
Specifically, the calculating the similarity between the position fix item and the sequence fix item and the cross tabu table of the reference chromosome may include:
according to the formula:
Figure BDA0002333446650000111
and respectively calculating the similarity of the position fixed item and the sequence fixed item to the cross tabu table of the reference chromosome. It should be noted that, the similarity between the current position fixation item and each item in the cross tabu table of the sequence fixation item and the reference chromosome needs to be calculated in turn according to the above formula.
Wherein D issIndicating the degree of similarity, CSiRepresenting the number of identical genes in the position-fixed item and the ith item in the cross tabu table; CP (CP)iRepresenting the order-fixed item with theThe number of identical genes in item i of the cross tabu table; CTiRepresents the number of genes in the i-th entry in the cross-tabu table.
Step 210, when the similarity is greater than a first preset value, determining whether the fitness value of the first offspring chromosome is greater than an optimal value in the fitness value of the first parent chromosome, and when the similarity is less than or equal to the first preset value, ending the crossover operation.
The first preset value may be set according to a requirement, and preferably, the first preset value is 0.8, that is, if a certain similarity between the position fixed item and the sequence fixed item is greater than 0.8, the step of step 27 is executed; otherwise, the crossover operation of the first parent chromosome is ended.
Step 220, generating a first sub-population according to the first parent chromosome and the first child chromosome.
After generating the first progeny chromosome in the crossover operation, adding the first progeny chromosome on the basis of the first population to form the first sub-population.
Optionally, performing mutation operations on population individuals within the first population, including:
and 31, selecting population individuals in the first subgroup as second parent chromosomes of the mutation operation. The mutation operator is added to increase the diversity of the population and improve the global search performance of the algorithm. The second parent chromosome participating in the mutation operation may be all population individuals within the first subgroup, i.e., all population individuals within the first subgroup are mutated.
And 32, acquiring a mutation operator tabu table of the second parent chromosome, wherein the mutation operator tabu table comprises at least one tabu item.
When an individual performs mutation operation, it is first determined whether the pair of genes of the mutation operation is the same as or similar to any one of the tabu tables of the mutation operator. The tabu items in the tabu table of the mutation operator can be genes which are not allowed to participate in mutation operation and are set by a user, and can also be mutation operators used in the previous iteration process of the iteration.
Step 33, generating a gene pair of the mutation operation; the gene pairs may be randomly generated.
And step 34, carrying out mutation operation on the second parent chromosome according to the gene pair to generate a second offspring chromosome.
The embodiment of the invention realizes the mutation of the individual by exchanging genes in the chromosome, and simultaneously prevents the repeated mutation of the individual by using the taboo table of the mutation operator. FIG. 4 is a schematic diagram of mutation operators based on gene exchange, and the pairs of genes involved in mutation are 2 and 7.
Step 35, judging whether at least one item in the gene pair is the same as a tabu item in the mutation operator tabu table;
step 36, when at least one of the gene pairs is the same as the tabu item, continuing to execute the step of generating the gene pair of the mutation operation;
and step 37, judging whether the fitness value of the second offspring chromosome is larger than that of the second parent chromosome when the genes identical to the tabu do not exist in the gene pair.
In this embodiment, if the pair of genes involved in mutation is the same as a certain item in the mutation operator tabu table, indicating that there is a possibility of generating an existing individual, in order to improve the global search performance of the algorithm, the step 33 is performed; otherwise, judging whether the fitness value of the second offspring chromosome is larger than the fitness value of the second parent chromosome.
And step 38, when the fitness value of the second offspring chromosome is larger than that of the second parent chromosome, ending the mutation operation, otherwise, continuing to execute the step of generating the gene pair of the mutation operation.
If the second child chromosome is not better than the second parent chromosome, then switching to perform step 33; otherwise, the mutation operation of the second parent chromosome is ended.
And 39, generating the second population according to the second parent chromosome and the second child chromosome.
After generating the second progeny chromosome in the mutation operation, adding the second progeny chromosome on the basis of the first sub-population to form the second population.
Optionally, the step 13 includes:
and step 41, initializing a residual volume C ═ C of the heat treatment furnace, wherein C' represents the residual volume, and C is an initial value of the residual volume.
Step 42, acquiring workpiece information corresponding to chromosomes in the second population, where the workpiece information includes: the workpiece, the single volume V, the number N of workpieces and the number N' of workpieces which are not grouped into batches correspond to the first gene of the chromosome in the second population.
In the production scheduling stage of the heat treatment link, the batch times of the dispersed workpieces of the same job are reduced as much as possible while the utilization rate of the heat treatment furnace is maximized by using the decoding rule based on the volume of the heat treatment furnace.
And 43, judging the volume of the workpieces which are not batched into groups and the size of the residual volume, and updating the residual volume to be: c ═ C '-N' xv, the batch of workpieces is complete;
wherein the volume of the workpieces which are not batched is as follows: n '× V, the residual volume is C', if N '× V is less than or equal to C', the residual volume of the heat treatment furnace can satisfy the heat treatment of the workpieces which are not completely batched, and the residual volume after completion of batching can be updated as follows: c ' -N ' x V, C ' is the remaining volume of the heat treatment furnace after completion of batching the workpieces which are not batched.
And step 44, according to the time node of the heat treatment furnace and the heat treatment working hours of the batches, giving the heat treatment starting time and the heat treatment finishing time of the batches which are completed in batches, and deleting the first gene in the chromosome.
When the start time and the end time of the heat treatment of the lot are given to the lot after completion of the lot, the processing time of the workpieces of the lot can be obtained.
And step 45, updating the residual volume to the initial value C when the C' is zero.
When the updated C is zero, which means that the workpieces which are not batched have no residual volume in the heat treatment furnace after the batching is completed, the residual volume is reset to the initial value C, and step 48 is executed, that is, the number of genes in the current code is 0, and the coding is ended.
And step 46, under the condition that the value C' is not zero, if the target workpieces of the workpiece group corresponding to the first gene do not exist in the chromosome, updating the residual volume to the initial value C, and continuing to execute the step of acquiring the workpiece information corresponding to the chromosome in the second group.
In this embodiment, the target workpiece refers to a workpiece of a workpiece lot that can correspond to the first gene. If the updated C is not zero, it indicates that the workpieces not grouped still have a residual volume in the heat treatment furnace after the completion of the batch, and if there is no target workpiece in the chromosome that can be grouped with the first genome after the first gene, the residual volume is reset to the initial value C, and the step 42 is continued.
And 47, if the target workpieces exist, recording the single volume of the first workpiece in the target workpieces as V, the number of workpieces is N, the number of workpieces which are not batched is N', and continuing to execute the step of judging the volume of the workpieces which are not batched and the size of the residual volume.
In this embodiment, if the updated C "is not zero and there are target workpieces that can be batched with the first genome after the first gene, the single volume of the first workpiece in the target workpieces is recorded as V, the number of workpieces is N, and the number of workpieces that are not batched is N', the step 43 is continued.
And step 48, in the case that the number of genes in the chromosome is zero, ending the coding. And after repeated iterative decoding, ending the coding when the number of the genes in the chromosome is zero.
Optionally, the determining the heat treatment processing time and sequence of the second population based on the heat treatment furnace volume decoding rule further includes:
step 49, in the case where N ' × V > C ', completing batching of C '/V workpieces, updating the remaining volume to the initial value C, and updating the number of workpieces not subjected to batching to: n ═ N '-C'/V; and giving the heat treatment starting time and the heat treatment ending time of the batched batch according to the time node of the heat treatment furnace and the heat treatment working hours of the batch, continuing to execute the step of acquiring the workpiece information corresponding to the chromosomes in the second population, and ending the coding under the condition that the number of the genes in the chromosomes is zero.
In this embodiment, when N '× V > C' indicates that the remaining volume of the heat treatment furnace is insufficient to support the heat treatment of the unbatched workpieces, and only a part of the workpieces corresponding to the remaining volume can be heat treated, the number of workpieces capable of supporting the heat treatment is: c '/V, then the C'/V number of workpieces complete the batching, and the number of remaining unbatched workpieces is: n '-C'/V.
The processing time of the workpieces in the batch can be obtained by assigning the start time and the end time of the heat treatment to the batch in which the batch is completed, based on the time node of the heat treatment furnace and the heat treatment time of the batch. And for the remaining unmarked workpieces, continuing to execute the step 42, and ending the encoding after a plurality of iterative decoding until the number of the genes in the chromosome is zero.
Optionally, the step 14 includes:
and step 51, dividing all the unordered processes into a pre-heat treatment process and a post-heat treatment process, and generating a pre-heat treatment process set and a post-heat treatment process set.
This embodiment divides all the non-arranged processes into two parts, a pre-heat treatment process and a post-heat treatment process. The thermal treatment link is taken as a time anchor point, two targets of maximizing the utilization rate of a thermal treatment furnace and minimizing the maximum processing time are respectively considered, decoding is divided into two parts, namely thermal treatment link decoding and flexible job shop link decoding, and poor-quality solution is avoided. The machining equipment selection rule based on the bottleneck degree considers the bottleneck degree of the equipment which changes along with the arrangement of the process after the processing time and the sequence of the heat treatment process of the workpiece are determined, and the process is uniformly arranged on each equipment as much as possible, so that the process blockage on the bottleneck equipment is avoided.
And step 52, acquiring a first target process set according to the pre-heat treatment process set, wherein the first target process set is a set of processes arranged in a next process in the pre-heat treatment process set.
Step 53, according to the formula:
Figure BDA0002333446650000151
Figure BDA0002333446650000152
calculating a first bottleneck degree of optional equipment of all the procedures in the first target procedure set;
wherein the content of the first and second substances,
Figure BDA0002333446650000153
indicates the first neck degree, SijRepresents OijThe machining start time of the non-heat treatment step (2); o isijDenotes JiJ is 1, 2, … Gi，GiDenotes JiThe number of steps (2); j. the design is a squareiRepresenting the workpieces, i is 1, 2, … n, n represents the number of workpieces; vijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0; mpDenotes the devices p, p is 1, 2, … m, m denotes the number of devices; t isijRepresents OijThe theoretical single-piece processing man-hour of the non-heat treatment process of (2); xijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0;
in this embodiment, the above formula indicates that the device M is not to be currently scheduled and may be presentpAll the thermal pre-processes arranged above are arranged in the apparatus MpBefore the start time of the last first workpiece. Wherein, the smaller the value of the bottleneck degree, the more bottleneck the device is.
And 54, selecting equipment for all the procedures in the first target procedure set according to the first bottleneck degrees of all the optional equipment. And sequentially selecting the equipment with the maximum bottleneck degree value from all machinable equipment, and reversely arranging all the procedures in the current set.
And step 55, in the case that the equipment arrangement of all the processes in the pre-heat treatment process set is completed, performing the equipment arrangement of the post-heat treatment process.
If all the workpieces in the process set before heat treatment are arranged, equipment arrangement of the process after heat treatment is continued; otherwise, the step 52 is executed.
Optionally, the apparatus arrangement for performing the post-heat treatment process comprises:
step 56, acquiring a second target process set according to the post-heat treatment process set, wherein the second target process set is a set of processes arranged in a previous process in the post-heat treatment process set;
step 57, according to the formula:
Figure BDA0002333446650000161
Figure BDA0002333446650000162
calculating a second bottleneck degree of the optional equipment for all the processes in the second target process set, wherein,
Figure BDA0002333446650000163
representing a second degree of bottleneck, EijRepresents OijThe machining end time of the non-heat treatment step (2);
in this embodiment, the above formula represents: will not be currently scheduled and may be at device MpAll the post-heat treatment processes arranged in the above are arranged in the apparatus MpAfter the end time of the last workpiece. Wherein, the larger the value of the bottleneck degree is, the more the value is indicative of the settingThe more the bottleneck is.
And 58, selecting equipment for all the processes in the second target process set according to the second bottleneck degrees of all the selectable equipment. And sequentially selecting the equipment with the minimum bottleneck degree value from all machinable equipment, and arranging all the procedures in the current set in the forward direction.
And step 59, in the case that all the processes in the post-heat treatment process set complete the equipment arrangement, ending the decoding. If all the workpieces in the process set are arranged after the heat treatment, the decoding is finished; otherwise, the step 56 is executed.
In the embodiment, the flexible job shop link constraint and the heat treatment link constraint are comprehensively considered, the aim of minimizing the maximum processing time and maximizing the utilization rate of the heat treatment furnace is fulfilled, the heat treatment link is taken as a time anchor point, the decoding is divided into two parts of heat treatment link decoding and flexible job shop link decoding, the workpieces entering the heat treatment furnace at each time are reasonably selected and combined by reasonably arranging the processing sequence of the workpieces and the selection of processing equipment, the maximum processing time and the utilization rate of the heat treatment furnace are minimized, and the generation of poor quality solutions is avoided.
Optionally, the step 15 includes:
determining the maximum processing time of the workpiece and the utilization rate of the heat treatment equipment according to the heat treatment processing time and sequence and the bottleneck degree;
according to the formula: f ═ Cmax/ηmCalculating the fitness; wherein F represents fitness, CmaxIndicating the maximum processing time of the workpiece, ηmIndicating the heat treatment equipment utilization rate.
To minimize the maximum processing time of a workpiece, the waiting time of the workpiece in the buffer area should be minimized. If the thermal nursing furnace is idle, the volume constraint of the thermal nursing furnace needs to be considered, and workpieces which can enter the thermal treatment furnace in the same batch are selected from the buffer area and enter in a batch mode. If too few workpieces enter the heat treatment furnace in the same batch, the utilization rate of the batch of workpieces to the volume of the heat treatment furnace is reduced, the number of processing batches of the heat treatment furnace is increased, and the maximum processing time is increased.
According to the embodiment of the invention, the processing time of the workpiece can be determined according to the processing time and the processing sequence of the heat treatment, the equipment is selected according to the bottleneck degree of the equipment, the waiting time of the workpiece in the buffer area is minimized, the workpiece with heavy tasks in the subsequent machining link can be scheduled to enter the heat treatment furnace with higher priority, and the phenomenon that the completion time of the workpiece is delayed more than that of other workpieces so as to increase the processing time is avoided.
And determining to continue iteration or terminate the algorithm according to the fitness of the population individuals in the second population, and terminating the algorithm when the fitness meets the condition of user requirements to obtain a final scheduling solution. The user can set iteration times, and when the preset iteration times are reached, the obtained solution is considered as a final scheduling solution; optionally, when the fitness reaches a preset value, the solution obtained at this time may be considered as the optimal solution.
The following specifically describes an implementation process of the workshop scheduling method. Optionally, as shown in fig. 5, first, a population is initialized, where the population includes: initializing a population and algorithm parameters based on the encoding of the workpiece; initializing a tabu table, wherein the tabu table comprises: a cross tabu table and a mutation operator tabu table; the cross tabu table is combined for cross operation, so that the algorithm can be prevented from getting into precocity; the mutation operation is carried out by combining a mutation operator tabu table, so that the global search capability can be improved, and global optimization is carried out through the crossover operation and the mutation operation; calculating population fitness based on a decoding rule of push-pull combination; when the fitness reaches a termination condition, ending the algorithm; otherwise, the crossover and mutation operations are continuously executed. It should be noted that, before the cross operation, if the fitness of the population reaches the termination condition, the algorithm is ended; the termination condition is set according to the requirements of the user, such as: the algorithm is set to be ended when the iteration times are reached, or the algorithm can be ended when the fitness reaches a preset value set by a user.
The embodiment of the invention comprehensively considers the flexible job shop link constraint and the heat treatment link constraint aiming at the scheduling problem of the flexible job shop with the heat treatment link, reasonably selects and combines the workpieces entering the heat treatment furnace each time by reasonably arranging the processing sequence and the processing equipment selection of the workpieces to minimize the maximum completion time of the workpieces and maximize the utilization rate of the heat treatment furnace, thereby providing the scheduling scheme reference for the scheduling personnel of the flexible job shop under various and small batches.
As shown in fig. 6, an embodiment of the present invention further provides a plant scheduling apparatus, including:
a first generating module 610, configured to generate a first population according to an order in which the workpieces reach the thermal processing link, where the first population includes at least one population individual corresponding to the order;
a first processing module 620, configured to perform cross operation and mutation operation on population individuals in the first population to obtain a second population;
a first determining module 630, configured to determine a heat treatment processing time and sequence of the second population based on a heat treatment furnace volume decoding rule;
a first obtaining module 640, configured to obtain a bottleneck degree of the heat treatment apparatus;
a second determining module 650, configured to determine fitness of population individuals in the second population according to the heat treatment processing time and sequence, and the bottleneck degree;
and a third determining module 660, configured to determine a scheduling solution for workshop scheduling according to the fitness.
Optionally, the apparatus further comprises:
the second acquisition module is used for initializing all populations based on the codes of the workpieces and acquiring the sequence of all workpieces reaching a heat treatment link;
the device comprises an initialization module and a mutation module, wherein the initialization module is used for initializing a tabu table, the tabu table comprises a cross tabu table and a mutation operator tabu table, and each population individual corresponds to one cross tabu table and one mutation operator tabu table.
Optionally, the first processing module 620 includes:
the first selecting unit is used for selecting population individuals in the first population as first parent chromosomes of cross operation;
a first obtaining unit, configured to obtain a cross tabu table corresponding to the first parent chromosome, where the cross tabu table includes at least one tabu item;
a first determining unit, which is used for determining a reference chromosome according to the number of tabu items contained in the cross tabu table;
a first generating unit configured to generate a position fixed item and a sequence fixed item of the crossover operation;
the crossover operation unit is used for carrying out crossover operation on the first parent chromosome according to the position fixed item and the sequence fixed item to generate a first child chromosome;
a first judging unit, configured to judge whether at least one of the position fix item and the sequence fix item is the same as a tabu item in a cross tabu table of the reference chromosome;
a second judging unit, configured to judge whether the fitness value of the first child chromosome is greater than an optimal value of the fitness values of the first parent chromosome when at least one of the position fix item and the sequence fix item is the same as the tabu item;
a first processing unit, configured to end the crossover operation when the fitness values of the first child chromosomes are all greater than an optimal value in the fitness values of the first parent chromosome; otherwise, continuing to execute the step of generating the position fixed item and the sequence fixed item of the cross operation;
a second processing unit, configured to calculate similarities of the position fix item and the sequence fix item to a cross tabu table of the reference chromosome, respectively, when there is no gene identical to the tabu item in the position fix item and the sequence fix item;
the third processing unit is used for judging whether the fitness value of the first offspring chromosome is larger than the optimal value in the fitness value of the first parent chromosome or not when the similarity is larger than a first preset value, and finishing the cross operation when the similarity is smaller than or equal to the first preset value;
and the second generation unit is used for generating a first sub-population according to the first parent chromosome and the first child chromosome.
Optionally, the second processing unit is specifically configured to:
according to the formula:
Figure BDA0002333446650000191
respectively calculating the similarity of the position fixed item and the sequence fixed item and the cross tabu table of the reference chromosome;
wherein D issIndicating the degree of similarity, CSiRepresenting the number of identical genes in the position-fixed item and the ith item in the cross tabu table; CP (CP)iRepresenting the number of identical genes in the order fixed item and the ith item in the cross tabu table; CTiRepresents the number of genes in the i-th entry in the cross-tabu table.
Optionally, the first processing module 620 includes:
the second selecting unit is used for selecting population individuals in the first subgroup as second parent chromosomes of the mutation operation;
a second obtaining unit, configured to obtain a mutation operator tabu table of the second parent chromosome, where the mutation operator tabu table includes at least one tabu item;
a third generation unit for generating the pair of mutated genes;
a mutation operation unit, configured to perform a mutation operation on the second parent chromosome according to the gene pair to generate a second offspring chromosome;
a third judging unit, configured to judge whether at least one of the gene pairs is the same as a tabu item in the mutation operator tabu table;
a fourth processing unit, configured to continue to perform the step of generating the pair of genes of the mutation operation when at least one of the pair of genes is the same as the tabu;
a fourth judging unit, configured to judge whether the fitness value of the second child chromosome is greater than the fitness value of the second parent chromosome when no gene identical to the tabu item exists in the gene pair;
a fifth processing unit, configured to end a mutation operation when the fitness value of the second child chromosome is greater than the fitness value of the second parent chromosome, and otherwise, continue to perform the step of generating the pair of genes of the mutation operation;
a fourth generating unit, configured to generate the second population according to the second parent chromosome and the second child chromosome.
Optionally, the first determining module 630 includes:
an initialization unit for initializing a remaining volume C ═ C of the heat treatment furnace, wherein C' denotes the remaining volume and C is an initial value of the remaining volume;
a third obtaining unit, configured to obtain workpiece information corresponding to chromosomes in the second population, where the workpiece information includes: workpieces, single piece volume V, workpiece number N and workpiece number N' which are not completed in batches corresponding to the first gene of the chromosome in the second population;
a sixth processing unit, configured to determine the volume of the workpieces that are not batched and the size of the remaining volume, and update the remaining volume to: c ═ C '-N' xv, the batch of workpieces is complete;
a seventh processing unit for giving a heat treatment start time and an end time of a batched lot to the heat treatment of the batched lot and deleting a first gene in the chromosome, according to a time node of the heat treatment furnace and a heat treatment man-hour of the lot;
a first updating unit configured to update the remaining volume to the initial value C if C ″ is zero;
a second updating unit, configured to, if the C ″ is not zero, if there is no target workpiece of the workpiece batch corresponding to the first gene in the chromosome, update the remaining volume to the initial value C, and continue to perform the step of acquiring workpiece information corresponding to the chromosome in the second population;
an eighth processing unit, configured to, if the target workpiece exists, record a single volume of a first workpiece in the target workpiece as V, where the number of workpieces is N, the number of workpieces that are not batched is N', and continue to perform the step of determining the volume of the workpieces that are not batched and the size of the remaining volume;
a termination unit for terminating the encoding in case the number of genes in the chromosome is zero.
Optionally, the first determining module 630 further includes:
a third updating unit configured to complete batching of C'/V workpieces and update the remaining volume to the initial value C and the number of unbatched workpieces to: n ═ N '-C'/V;
and a ninth processing unit configured to give a start time and an end time of heat treatment to the batched lot according to the time node of the heat treatment furnace and the heat treatment man-hour of the lot, continue to perform the step of acquiring the workpiece information corresponding to the chromosomes in the second population, and end the encoding when the number of genes in the chromosomes is zero.
Optionally, the first obtaining module 640 includes:
a fifth generating unit for dividing all the non-arranged processes into pre-heat treatment processes and post-heat treatment processes, and generating a pre-heat treatment process set and a post-heat treatment process set;
a fourth obtaining unit, configured to obtain a first target process set according to the pre-heat-treatment process set, where the first target process set is a set of processes arranged in a next process in the pre-heat-treatment process set;
according to the formula:
Figure BDA0002333446650000211
calculating a first bottleneck degree of optional equipment of all the procedures in the first target procedure set;
wherein the content of the first and second substances,
Figure BDA0002333446650000212
indicates the first neck degree, SijRepresents OijThe machining start time of the non-heat treatment step (2); o isijDenotes JiJ is 1, 2, … Gi，GiDenotes JiThe number of steps (2); j. the design is a squareiRepresenting the workpieces, i is 1, 2, … n, n represents the number of workpieces; vijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0; mpDenotes the devices p, p is 1, 2, … m, m denotes the number of devices; t isijRepresents OijThe theoretical single-piece processing man-hour of the non-heat treatment process of (2); xijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0;
the third selecting unit is used for selecting equipment for all the procedures in the first target procedure set according to the first bottleneck degrees of all the selectable equipment;
and a device arrangement unit for performing device arrangement of the post-heat treatment process when device arrangement is completed for all processes in the pre-heat treatment process set.
Optionally, the device arrangement unit is specifically configured to:
acquiring a second target process set according to the post-heat treatment process set, wherein the second target process set is a set of processes arranged in a previous process in the post-heat treatment process set;
according to the formula:
Figure BDA0002333446650000221
calculating a second bottleneck degree of the optional equipment for all the processes in the second target process set, wherein,
Figure BDA0002333446650000222
representing a second degree of bottleneck, EijRepresents OijThe machining end time of the non-heat treatment step (2);
selecting equipment for all processes in the second target process set according to the second bottleneck degrees of all the selectable equipment;
in the case where all the processes in the post-heat treatment process set complete the equipment arrangement, the decoding ends.
Optionally, the second determining module 650 includes:
determining the maximum processing time of the workpiece and the utilization rate of the heat treatment equipment according to the heat treatment processing time and sequence and the bottleneck degree;
according to the formula: f ═ Cmax/ηmCalculating the fitness;
wherein F represents fitness, CmaxIndicating the maximum processing time of the workpiece, ηmIndicating the heat treatment equipment utilization rate.
The embodiment of the invention comprehensively considers the flexible job shop link constraint and the heat treatment link constraint aiming at the scheduling problem of the flexible job shop with the heat treatment link, reasonably selects and combines the workpieces entering the heat treatment furnace each time by reasonably arranging the processing sequence and the processing equipment selection of the workpieces to minimize the maximum completion time of the workpieces and maximize the utilization rate of the heat treatment furnace, thereby providing the scheduling scheme reference for the scheduling personnel of the flexible job shop under various and small batches.
It should be noted that the apparatus is an apparatus corresponding to the individual recommendation method, and all implementation manners in the method embodiments are applicable to the embodiment of the apparatus, and the same technical effect can be achieved.
The embodiment of the invention also provides a workshop scheduling device, which comprises a processor, a memory and a computer program which is stored on the memory and can run on the processor, wherein the computer program realizes the steps of the workshop scheduling method when being executed by the processor.
It should be noted that the device is a device corresponding to the individual recommendation method, and all implementation manners in the method embodiments are applicable to the embodiment of the device, and the same technical effect can be achieved.
While the preferred embodiments of the present invention have been described, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims.

Claims (12)

1. A method for scheduling a plant, comprising:
generating a first population according to the sequence of the workpieces reaching the heat treatment link, wherein the first population comprises at least one population individual corresponding to the sequence;
performing cross operation and variation operation on population individuals in the first population to generate a second population;
determining the heat treatment processing time and sequence of the second population based on the heat treatment furnace volume decoding rule;
acquiring the bottleneck degree of the heat treatment equipment;
determining the fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree;
and determining a scheduling solution for scheduling the workshop according to the fitness.
2. The shop scheduling method according to claim 1, wherein before said generating a first population according to the order in which the workpieces arrive at the thermal processing link, the method further comprises:
initializing all populations based on the codes of the workpieces, and obtaining the sequence of all workpieces reaching a heat treatment link;
initializing tabu tables, wherein the tabu tables comprise a cross tabu table and a mutation operator tabu table, and each population individual corresponds to one cross tabu table and one mutation operator tabu table.
3. The plant scheduling method according to claim 1, wherein the interleaving of the population individuals within the first population comprises:
selecting population individuals in the first population as first parent chromosomes of cross operation;
acquiring a cross tabu table corresponding to the first parent chromosome, wherein the cross tabu table comprises at least one tabu item;
determining a reference chromosome according to the number of tabu items contained in the cross tabu table;
generating a position fixed item and a sequence fixed item of the cross operation;
performing cross operation on the first parent chromosome according to the position fixing item and the sequence fixing item to generate a first child chromosome;
judging whether at least one item in the position fixed item and the sequence fixed item is the same as a tabu item in a cross tabu table of the reference chromosome;
when at least one of the position fixed item and the sequence fixed item is the same as the tabu item, judging whether the fitness value of the first child chromosome is greater than the optimal value in the fitness values of the first parent chromosome;
when the fitness values of the first child chromosomes are all larger than the optimal value in the fitness values of the first parent chromosome, ending the crossover operation; otherwise, continuing to execute the step of generating the position fixed item and the sequence fixed item of the cross operation;
when the position fixed item and the sequence fixed item do not have the same genes as the tabu item, respectively calculating the similarity of the position fixed item and the sequence fixed item and a cross tabu table of the reference chromosome;
under the condition that the similarity is greater than a first preset value, judging whether the fitness value of the first offspring chromosome is greater than the optimal value in the fitness value of the first parent chromosome, and under the condition that the similarity is less than or equal to the first preset value, finishing the cross operation;
generating a first sub-population according to the first parent chromosome and the first child chromosome.
4. The method according to claim 3, wherein the calculating the similarity between the position fix term and the sequence fix term and the cross tabu table of the reference chromosome comprises:
according to the formula:
Figure FDA0002333446640000021
respectively calculating the similarity of the position fixed item and the sequence fixed item and the cross tabu table of the reference chromosome;
wherein D issIndicating the degree of similarity, CSiRepresenting the number of identical genes in the position-fixed item and the ith item in the cross tabu table; CP (CP)iRepresenting the number of identical genes in the order fixed item and the ith item in the cross tabu table; CTiRepresents the number of genes in the i-th entry in the cross-tabu table.
5. The plant scheduling method according to claim 3, wherein performing mutation operations on the population individuals in the first population comprises:
selecting population individuals in the first subgroup as second parent chromosomes of the mutation operation;
acquiring a mutation operator tabu table of the second parent chromosome, wherein the mutation operator tabu table comprises at least one tabu item;
generating a pair of genes for the mutation operation;
performing mutation operation on the second parent chromosome according to the gene pair to generate a second offspring chromosome;
judging whether at least one item in the gene pair is the same as a tabu item in the mutation operator tabu table or not;
continuing the step of generating the pair of genes for mutation operation when at least one of the pair of genes is the same as the tabu item;
when the genes identical to the tabu item do not exist in the gene pair, judging whether the fitness value of the second offspring chromosome is larger than that of the second parent chromosome;
when the fitness value of the second offspring chromosome is larger than that of the second parent chromosome, ending mutation operation, otherwise, continuing to execute the step of generating the gene pair of the mutation operation;
and generating the second population according to the second parent chromosome and the second child chromosome.
6. The plant scheduling method of claim 1, wherein said determining the heat treatment processing times and orders for said second population based on heat treatment furnace volume decoding rules comprises:
initializing a residual volume C ═ C of the heat treatment furnace, wherein C' denotes the residual volume and C is an initial value of the residual volume;
acquiring workpiece information corresponding to chromosomes in the second population, wherein the workpiece information comprises: workpieces, single piece volume V, workpiece number N and workpiece number N' which are not completed in batches corresponding to the first gene of the chromosome in the second population;
judging the volume of the workpieces which are not batched into groups and the size of the residual volume, and updating the residual volume to be: c ═ C '-N' xv, the batch of workpieces is complete;
giving the heat treatment start time and the heat treatment end time of the batched batch according to the time node of the heat treatment furnace and the heat treatment working hours of the batch, and deleting a first gene in the chromosome;
updating the remaining volume to the initial value C if the C "is zero;
under the condition that C' is not zero, if the target workpieces of the workpiece group corresponding to the first gene do not exist in the chromosome, updating the residual volume to the initial value C, and continuing to execute the step of acquiring the workpiece information corresponding to the chromosome in the second group;
if the target workpieces exist, recording the single piece volume of the first workpiece in the target workpieces as V, the number of workpieces is N, the number of workpieces which are not batched is N', and continuing to execute the step of judging the volume of the workpieces which are not batched and the size of the residual volume;
in the case where the number of genes in the chromosome is zero, the encoding is ended.
7. The plant scheduling method of claim 6, wherein determining the heat treatment processing times and orders for the second population based on heat treatment furnace volume decoding rules further comprises:
in the case of N ' × V > C ', completing batching of C '/V workpieces, updating the remaining volume to the initial value C, updating the number of workpieces not subjected to batching to: n ═ N '-C'/V;
and giving the heat treatment starting time and the heat treatment ending time of the batched batch according to the time node of the heat treatment furnace and the heat treatment working hours of the batch, continuing to execute the step of acquiring the workpiece information corresponding to the chromosomes in the second population, and ending the coding under the condition that the number of the genes in the chromosomes is zero.
8. The plant scheduling method according to claim 1, wherein the obtaining of the bottleneck degree of the thermal processing equipment comprises:
dividing all the working procedures which are not arranged into a pre-heat treatment working procedure and a post-heat treatment working procedure to generate a pre-heat treatment working procedure set and a post-heat treatment working procedure set;
acquiring a first target process set according to the pre-heat treatment process set, wherein the first target process set is a set of processes arranged in a next process in the pre-heat treatment process set;
according to the formula:
Figure FDA0002333446640000041
calculating optional settings for all processes in the first target process setA first neck finish level;
wherein the content of the first and second substances,
Figure FDA0002333446640000042
indicates the first neck degree, SijRepresents OijThe machining start time of the non-heat treatment step (2); o isijDenotes JiJ is 1, 2, … Gi，GiDenotes JiThe number of steps (2); j. the design is a squareiRepresenting the workpieces, i is 1, 2, … n, n represents the number of workpieces; vijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0; mpDenotes the devices p, p is 1, 2, … m, m denotes the number of devices; t isijRepresents OijThe theoretical single-piece processing man-hour of the non-heat treatment process of (2); xijpIs a constant value, if OijAt device MpThe upper processing is 1, otherwise, the upper processing is 0;
selecting equipment for all processes in the first target process set according to the first bottleneck degrees of all selectable equipment;
the equipment arrangement of the post-heat treatment process is performed in a case where all the processes in the pre-heat treatment process set complete the equipment arrangement.
9. The method according to claim 8, wherein the equipment arrangement for performing the post-heat treatment process comprises:
acquiring a second target process set according to the post-heat treatment process set, wherein the second target process set is a set of processes arranged in a previous process in the post-heat treatment process set;
according to the formula:
Figure FDA0002333446640000043
calculating a second bottleneck degree of the optional equipment for all the processes in the second target process set, wherein,
Figure FDA0002333446640000051
representing a second degree of bottleneck, EijRepresents OijThe machining end time of the non-heat treatment step (2);
selecting equipment for all processes in the second target process set according to the second bottleneck degrees of all the selectable equipment;
in the case where all the processes in the post-heat treatment process set complete the equipment arrangement, the decoding ends.
10. The plant scheduling method of claim 1, wherein determining fitness of population individuals in the second population based on the heat treatment processing time and sequence and the bottleneck degree comprises:
determining the maximum processing time of the workpiece and the utilization rate of the heat treatment equipment according to the heat treatment processing time and sequence and the bottleneck degree;
according to the formula: f ═ Cmax/ηmCalculating the fitness;
wherein F represents fitness, CmaxIndicating the maximum processing time of the workpiece, ηmIndicating the heat treatment equipment utilization rate.
11. A plant scheduling apparatus, comprising:
the first generation module is used for generating a first population according to the sequence of the workpieces reaching the heat treatment link, and the first population comprises at least one population individual corresponding to the sequence;
the first processing module is used for performing cross operation and variation operation on population individuals in the first population to obtain a second population;
a first determining module, configured to determine a heat treatment processing time and sequence of the second population based on a heat treatment furnace volume decoding rule;
the first acquisition module is used for acquiring the bottleneck degree of the heat treatment equipment;
a second determining module, configured to determine fitness of population individuals in the second population according to the heat treatment processing time and sequence and the bottleneck degree;
and the third determining module is used for determining a scheduling solution for workshop scheduling according to the fitness.
12. A plant scheduling apparatus comprising a processor, a memory and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the plant scheduling method according to any one of claims 1 to 10.
CN201911346253.3A 2019-12-24 2019-12-24 Workshop scheduling method, device and equipment Active CN111105164B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911346253.3A CN111105164B (en) 2019-12-24 2019-12-24 Workshop scheduling method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911346253.3A CN111105164B (en) 2019-12-24 2019-12-24 Workshop scheduling method, device and equipment

Publications (2)

Publication Number Publication Date
CN111105164A true CN111105164A (en) 2020-05-05
CN111105164B CN111105164B (en) 2022-04-15

Family

ID=70423597

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911346253.3A Active CN111105164B (en) 2019-12-24 2019-12-24 Workshop scheduling method, device and equipment

Country Status (1)

Country Link
CN (1) CN111105164B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115204525A (en) * 2022-09-14 2022-10-18 中科航迈数控软件(深圳)有限公司 Processing task scheduling method, device, terminal and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103309316A (en) * 2013-05-28 2013-09-18 北京理工大学 Scheduling method of multi-stage variation hybrid flow shop with batch processor
CN103530702A (en) * 2013-10-14 2014-01-22 西安建筑科技大学 Large-scale operation workshop scheduling method based on bottleneck equipment decomposition
CN107862411A (en) * 2017-11-09 2018-03-30 西南交通大学 A kind of extensive flexible job shop scheduling optimization method
CN108122055A (en) * 2016-11-28 2018-06-05 北京理工大学 The resource regulating method and device of a kind of Flow Shop
WO2019153429A1 (en) * 2018-02-07 2019-08-15 江南大学 Constrained stable matching strategy-based flexible job-shop scheduling method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103309316A (en) * 2013-05-28 2013-09-18 北京理工大学 Scheduling method of multi-stage variation hybrid flow shop with batch processor
CN103530702A (en) * 2013-10-14 2014-01-22 西安建筑科技大学 Large-scale operation workshop scheduling method based on bottleneck equipment decomposition
CN108122055A (en) * 2016-11-28 2018-06-05 北京理工大学 The resource regulating method and device of a kind of Flow Shop
CN107862411A (en) * 2017-11-09 2018-03-30 西南交通大学 A kind of extensive flexible job shop scheduling optimization method
WO2019153429A1 (en) * 2018-02-07 2019-08-15 江南大学 Constrained stable matching strategy-based flexible job-shop scheduling method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
丁雷,王爱民,宁汝新: "工时不确定条件下的车间作业调度技术", 《计算机集成制造系统》 *
方水良等: "基于遗传算法的柔性车间多目标优化调度", 《机电工程》 *
李冬妮等: "基于蚁群算法和遗传规划的跨单元调度方法", 《北京理工大学学报》 *
李小涛,彭翀: "基于混合多智能体遗传算法的作业车间调度问题研究", 《北京航空航天大学学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115204525A (en) * 2022-09-14 2022-10-18 中科航迈数控软件(深圳)有限公司 Processing task scheduling method, device, terminal and storage medium
CN115204525B (en) * 2022-09-14 2022-12-16 中科航迈数控软件(深圳)有限公司 Processing task scheduling method, device, terminal and storage medium

Also Published As

Publication number Publication date
CN111105164B (en) 2022-04-15

Similar Documents

Publication Publication Date Title
CN107301473B (en) Similar parallel machine based on improved adaptive GA-IAGA batch dispatching method and system
CN112561225B (en) Flexible job shop scheduling method based on marker post co-evolution algorithm
CN112561194B (en) Integrated scheduling method and system for production and logistics of mixed flow shop
JP5134601B2 (en) Production schedule creation device
CN107831740A (en) A kind of Optimization Scheduling during the distributed manufacturing applied to notebook part
CN112381343A (en) Flexible job shop scheduling method based on genetic-backbone particle swarm hybrid algorithm
CN115471133A (en) Workshop comprehensive scheduling system based on order management and rolling optimization scheduling
CN116227874B (en) Flexible job shop scheduling method and device based on genetic algorithm
CN111144710A (en) Construction and dynamic scheduling method of sustainable hybrid flow shop
CN116540659B (en) Large complex product workshop scheduling method, system, equipment and medium
CN111105164B (en) Workshop scheduling method, device and equipment
CN117555305B (en) NSGAII-based multi-target variable sub-batch flexible workshop job scheduling method
CN111210125A (en) Multi-target workpiece batch scheduling method and device based on historical information guidance
CN109214695B (en) High-end equipment research, development and manufacturing cooperative scheduling method and system based on improved EDA
CN113139720B (en) Casting shop production scheduling optimization method with learning effect
CN111985841B (en) Injection workshop scheduling method and system based on improved genetic algorithm
CN111596622B (en) Flexible job shop scheduling method of ECM (electronic model control) rule distribution estimation algorithm
CN112926896A (en) Production scheduling method for cigarette cut tobacco production
CN117148796A (en) Optimization method for solving scheduling problem of multi-target flexible job shop
CN110928261B (en) Distributed estimation scheduling method and system for distributed heterogeneous flow shop
CN112990716A (en) Dual-resource constraint flexible workshop scheduling and layout integrated optimization method and system
Demir et al. Process planning and due-date assignment with ATC dispatching where earliness, tardiness and due-dates are punished
CN113792494B (en) Multi-target flexible job shop scheduling method based on migration bird swarm algorithm and cross fusion
JP5087013B2 (en) Parallel type batch processing schedule creation apparatus and method
CN114676987A (en) Intelligent flexible job shop active scheduling method based on hyper-heuristic 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