Production line collaborative scheduling method and system for printing workshop

Abstract

The invention discloses a production line collaborative scheduling method and system for a printing workshop, and relates to the technical field of scheduling control, and the method comprises the steps: obtaining the product type, the processing sequence, the processing equipment and the order deadline of each printing product, and distributing the processing starting time according to the order deadline; according to the machining equipment, the workshop position and the machining equipment position are obtained, and the out-workshop transportation time and the in-workshop transportation time are calculated; according to the processing starting time, processing completion time and timeout time of the printed product are calculated; according to the transportation time outside the workshop, the transportation time inside the workshop and the timeout time, constructing a minimum objective function with cost minimization; and solving the minimum objective function by adopting a genetic algorithm to obtain a scheduling scheme. According to the invention, the transportation cost of the processing operation is calculated by acquiring the workshops through which the processing operation of the printed product needs to pass and the processing equipment in the workshops, and meanwhile, the processing overtime cost is considered, and the production is scheduled according to the cost minimization, so that the production cost is reduced.

Description

Technical Field

[0001] The present invention relates to the technical field of scheduling control, and in particular to a production line collaborative scheduling method and system for a printing workshop. Background Art

[0002] The production scheduling of the printing workshop is the process of rationally arranging and managing the processing of printing products, including the receipt, scheduling, execution and quality control of the processing of printing products. Good production scheduling can bring necessary benefits to the production of printing products, such as improving production efficiency, reducing waste and ensuring product quality. Therefore, production scheduling of the printing workshop is very important for the production of printing products.

[0003] The existing workshop production scheduling technology is already very mature, especially in the scenario of improving production efficiency and making quick adjustments in the face of urgent needs. However, the above scheduling method is to improve a link in the production line, and does not consider the overall situation of the printing workshop before and after scheduling, resulting in high processing costs for printed products. Summary of the invention

[0004] The purpose of the present invention is to provide a method and system for collaborative scheduling of production lines in a printing workshop. The present invention obtains the workshops that the processing tasks of printed products need to pass through and the processing equipment in the workshops, calculates the transportation cost of the processing tasks, and takes into account the processing overtime costs. The production is scheduled based on cost minimization, thereby reducing production costs.

[0005] The purpose of the present invention is achieved by the following technical means: In a first aspect, the present invention provides a production line collaborative scheduling method for a printing workshop, comprising the following steps: Acquire the product type of each printed product, and acquire the processing sequence and processing equipment of each printed product according to the product type; Obtaining order cut-off times for various printed products, and allocating processing start times for various printed products according to the order cut-off times; According to the processing equipment, obtaining the workshop location and the processing equipment location; Calculate the out-of-workshop transportation time based on the workshop location; Calculating the transportation time within the workshop according to the processing sequence and the location of the processing equipment; Calculating the processing completion time of the printed product according to the processing start time; Calculate the overtime time based on the processing completion time and the order deadline; According to the out-of-workshop transportation time, the in-workshop transportation time and the overtime time, a minimum objective function is constructed by minimizing the cost; A genetic algorithm is used to solve the minimum objective function to obtain a scheduling solution.

[0006] Preferably, the calculating of the out-of-workshop transportation time according to the workshop location comprises the following steps: According to the processing sequence and the location of the workshop, calculating the transportation time of the printed product between workshops, and recording it as the first transportation time; According to the order deadline and the workshop location, calculating the transportation time of the printed product between the workshop and the warehouse, and recording it as the second transportation time; The first transportation time and the second transportation time are added together to obtain the out-of-workshop transportation time.

[0007] Preferably, the method of calculating the transportation time of the printed product between the workshop and the warehouse according to the order cut-off time and the workshop location, recorded as the second transportation time, comprises the following steps: When the processing completion time of the printed product is before the order deadline, obtaining the processing completion workshop location; Calculating the second transportation time according to the processing completion workshop location and the warehouse location; When the processing completion time of the printed product is equal to the order cut-off time or when the processing completion time of the printed product is after the order cut-off time, the second transportation time is zero.

[0008] Preferably, the calculating of the in-workshop transportation time according to the processing sequence and the location of the processing equipment comprises the following steps: Acquire the processing sequence and the processing equipment location of the printed products processed in the same workshop within a time period; Determine the transportation route within the workshop according to the processing sequence and the location of the processing equipment; The intra-workshop transportation time is calculated according to the intra-workshop transportation route.

[0009] Preferably, the calculating of the intra-workshop transportation time according to the intra-workshop transportation route comprises the following steps: According to the transport route within the workshop, obtain the straight distance and turning radius; Calculating the straight travel time according to the straight travel distance; Calculating a turning time according to the turning radius; Adding the straight travel time and the turning time to obtain the intra-workshop transportation time; The calculation formula of the straight travel time is as follows: , in, is the straight time, is the straight distance, is the transport speed; The calculation formula of the turning time is as follows: , in, is the turning time, is the turning radius, For transport speed.

[0010] Preferably, constructing a minimum objective function by minimizing cost according to the out-of-workshop transportation time, the in-workshop transportation time and the overtime time comprises the following steps: Calculate the total transportation time based on the transportation time outside the workshop and the transportation time inside the workshop; Calculating the total storage time based on the processing completion time of each printed product; Calculate the total timeout time according to the timeout time of each printed product; Calculate the transportation cost based on the total transportation time; Calculating storage cost according to the total storage time; Calculate the penalty cost according to the total timeout time; According to the transportation cost, the storage cost and the penalty cost, constructing the minimum objective function by minimizing the cost; The formula of the minimum objective function is as follows: , , in, is the minimum objective function, is the transportation cost weight coefficient, is the transportation cost per unit transportation time, is the total transportation time, is the storage cost weight coefficient, is the storage cost per unit storage time, is the total storage time, is the penalty cost weight coefficient, is the penalty cost per unit timeout, is the total time of timeout; is the total shipping time for any printed product, The storage time of any printed product, The timeout period for any printed product.

[0011] Preferably, the adopting of a genetic algorithm to solve the minimum objective function to obtain a scheduling solution comprises the following steps: encoding the printed product according to the processing sequence, the processing equipment and the processing start time; Randomly generate the initial population; Set the population size, crossover probability, mutation probability, and number of iterations; Constructing a fitness function according to the minimum objective function; Performing a selection operation on the initialized population; According to the crossover probability, a multi-point crossover method is used to perform a crossover operation until there is no repeated processing sequence code; According to the mutation probability, a single-point mutation method is used to perform mutation operations on the processing sequence code, the processing equipment code and the processing start time code respectively; Repeating the selection, crossover and mutation operations until the number of iterations is reached to obtain the scheduling solution; The fitness function formula is as follows: , in, is the fitness function, is the minimum objective function.

[0012] In a second aspect, the present invention provides a production line collaborative scheduling system for a printing workshop, which implements the above-mentioned production line collaborative scheduling method for a printing workshop, including: a processing data acquisition module, a deadline acquisition module, a start time allocation module, a position data acquisition module, a transportation time calculation module, a completion time calculation module, a timeout time calculation module, an objective function construction module and an objective function solution module; The processing data acquisition module is used to acquire the product type of each printed product, and acquire the processing sequence and processing equipment of each printed product according to the product type; The cut-off time acquisition module is used to acquire the order cut-off time of each printing product; The start time allocation module is used to allocate the processing start time of each printed product according to the order deadline; The position data acquisition module is used to acquire the workshop position and the processing equipment position according to the processing equipment; The transport time calculation module calculates the transport time outside the workshop according to the workshop location; and calculates the transport time inside the workshop according to the processing sequence and the processing equipment location; The completion time calculation module is used to calculate the processing completion time of the printed product according to the processing start time; The timeout calculation module is used to calculate the timeout according to the processing completion time and the order deadline; The objective function construction module is used to construct a minimum objective function by minimizing the cost according to the out-of-workshop transportation time, the in-workshop transportation time and the overtime time; The objective function solving module is used to solve the minimum objective function using a genetic algorithm to obtain a scheduling solution.

[0013] In a third aspect, the present invention provides an electronic device comprising a processor and a memory, wherein the memory is used to store computer program code, and the computer program code comprises computer instructions. When the processor executes the computer instructions, the electronic device executes the above-mentioned method for collaborative scheduling of production lines in a printing workshop.

[0014] In a fourth aspect, the present invention provides a computer-readable storage medium, in which a computer program is stored. The computer program includes program instructions, and when the program instructions are executed by a processor of an electronic device, the processor executes the above-mentioned production line collaborative scheduling method for a printing workshop.

[0015] Compared with the prior art, the present invention has the following beneficial effects: The present invention obtains the workshops that the processing of printed products needs to pass through and the processing equipment in the workshops, calculates the transportation time of the processing operations according to the workshop locations and the processing equipment locations, calculates the timeout time of the processing operations by obtaining the processing completion time and the order deadline of the printed products, constructs a minimum objective function according to the transportation time and the timeout time, solves the minimum objective function to schedule production with minimum cost, and reduces the production cost of the printing workshop; The present invention reduces the production cost of a printing workshop by constructing a minimum objective function based on transportation time, storage time and overtime time; The present invention improves the accuracy of production scheduling of a printing workshop by encoding according to processing sequence, processing equipment and processing start time, performing cross operations on individuals according to the processing sequence, and performing variation operations on each segment of coding. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.

[0017] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0018] Figure 1A schematic diagram of a flow chart of a production line collaborative scheduling method for a printing workshop provided in this embodiment; Figure 2 Step S4 provided in this embodiment is a flow chart of calculating the transportation time outside the workshop according to the workshop location; Figure 3 Step S42 provided in this embodiment calculates the transportation time of the printed product between the workshop and the warehouse according to the order deadline and the workshop location, which is recorded as a flow chart of the second transportation time; Figure 4 Step S5 provided in this embodiment is a flow chart of calculating the transportation time within the workshop according to the processing sequence and the location of the processing equipment; Figure 5 Step S53 provided in this embodiment is a flow chart of calculating the in-workshop transportation time according to the in-workshop transportation route; Figure 6 Step S8 provided in this embodiment is a flowchart of constructing a minimum objective function by minimizing the cost according to the transportation time outside the workshop, the transportation time inside the workshop and the overtime time; Figure 7 In step S9 provided in this embodiment, a genetic algorithm is used to solve the minimum objective function to obtain a flow chart of a scheduling solution; Figure 8 A schematic diagram of the structure of a production line collaborative scheduling system for a printing workshop provided in this embodiment; Fig. 9 A schematic diagram of the structure of an electronic device provided in this embodiment. DETAILED DESCRIPTION

[0019] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0020] It should be noted that all directional indications (such as up, down, left, right, front, back, etc.) in the embodiments of the present invention are only used to explain the relative position relationship, movement status, etc. between the components in a certain specific posture. If the specific posture changes, the directional indication will also change accordingly.

[0021] In addition, the descriptions of "first", "second", etc. in the present invention are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of ordinary technicians in the field to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such a combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0022] Embodiment 1 This embodiment provides a production line collaborative scheduling method for a printing workshop, such as Figure 1 As shown, the following steps are included: S1, obtaining the product type of each printed product, and according to the product type, obtaining the processing sequence and processing equipment of each printed product; S2, obtaining the order deadline of each printing product, and allocating the processing start time of each printing product according to the order deadline; S3, obtaining the workshop location and the processing equipment location according to the processing equipment; S4, calculate the transportation time outside the workshop according to the workshop location; S5, calculating the transportation time within the workshop according to the processing sequence and the location of the processing equipment; S6, calculating the processing completion time of the printed product according to the processing start time; S7, calculating the overtime time according to the processing completion time and the order deadline; S8, constructing the minimum objective function by minimizing the cost according to the transportation time outside the workshop, the transportation time inside the workshop and the overtime time; S9, using genetic algorithm to solve the minimum objective function and obtain the scheduling plan.

[0023] It should be noted that different printing products need to go through different printing processes, and different printing processes also need to go through different processing equipment. Therefore, according to the product type of each printing product, the processing sequence and processing equipment are obtained. After obtaining the processing equipment that the printing process needs to go through, the location of the workshop where the processing equipment is located, that is, the workshop location, and the location of the processing equipment in the workshop, that is, the processing equipment location. In addition, the order deadline of each printing product is obtained, and the start priority of the printing product is adjusted according to the order deadline, and the corresponding processing start time is allocated. By analyzing the processing sequence, workshop location and processing equipment location, the transportation time of the printing product is obtained. At the same time, the time required for the processing process is obtained according to the historical processing information. The processing completion time can be estimated by combining the processing start time and the transportation time. The minimum objective function is constructed with the minimum cost of the process as the goal, and the minimum objective function is solved by the genetic algorithm to obtain the optimal scheduling solution.

[0024] In this embodiment, by obtaining the workshops that the processing work of the printed products needs to pass through and the processing equipment in the workshops, the transportation time of the processing work is calculated according to the location of the workshop and the location of the processing equipment, and the timeout time of the processing work is calculated by obtaining the processing completion time and the order deadline of the printed products. The minimum objective function is constructed according to the transportation time and the timeout time, and the minimum objective function is solved to schedule production to minimize the cost, thereby reducing the production cost of the printing workshop.

[0025] In some embodiments, step S4 calculates the transportation time outside the workshop according to the workshop location, such as Figure 2 As shown, the following steps are included: S41, calculating the transportation time of the printed product between workshops according to the processing sequence and the workshop location, and recording it as the first transportation time; S42, calculating the transportation time of the printed product between the workshop and the warehouse according to the order deadline and the workshop location, and recording it as the second transportation time; S43, adding the first transportation time and the second transportation time to obtain the out-of-workshop transportation time.

[0026] In some embodiments, step S42 calculates the transportation time of the printed product between the workshop and the warehouse according to the order deadline and the workshop location, and records it as the second transportation time. Figure 3 As shown, the following steps are included: S421, when the processing completion time of the printed product is before the order deadline, the location of the processing completion workshop is obtained; S422, calculating a second transportation time according to the location of the processing completion workshop and the location of the warehouse; S423, when the processing completion time of the printed product is equal to the order deadline or when the processing completion time of the printed product is after the order deadline, the second transportation time is zero.

[0027] It should be noted that the transportation time outside the workshop includes the first transportation time and the second transportation time. The first transportation time is the transportation time of the printed product between workshops. The second transportation time is the transportation time of the printed product between the processing workshop and the warehouse. Specifically, assuming that the printed product needs to pass through workshop A, workshop B and workshop C in sequence during printing and processing, the first transportation time includes the transportation time from workshop A to workshop B and the transportation time from workshop B to workshop C. Workshop C is the processing workshop for the printed product, and the second transportation time is the transportation time from workshop C to the warehouse. However, in the actual production process, there will be urgent needs that cause the processing work to be delayed or cannot be completed on time, and the processing completion time is on or after the order deadline. At this time, there is no need to transport the printed product to the warehouse for storage. Therefore, the second transportation time is zero, and the transportation time outside the workshop at this time is the first transportation time.

[0028] In some embodiments, step S5 calculates the transportation time within the workshop according to the processing sequence and the location of the processing equipment, such as Figure 4 As shown, the following steps are included: S51, obtaining the processing sequence and processing equipment locations of printed products processed in the same workshop within a time period; S52, determining the transportation route within the workshop according to the processing sequence and the location of the processing equipment; S53, calculating the in-workshop transportation time according to the in-workshop transportation route.

[0029] In some embodiments, step S53 calculates the in-workshop transportation time according to the in-workshop transportation route, such as Figure 5 As shown, the following steps are included: S531, obtaining the straight distance and turning radius according to the transport route within the workshop; S532, calculating the straight travel time according to the straight travel distance; S533, calculating the turning time according to the turning radius; S534, adding the straight travel time and the turning time to obtain the intra-workshop transportation time; The formula for calculating the straight-line time is as follows: , in, is the straight time, is the straight distance, is the transport speed; The formula for calculating the turning time is as follows: , in, is the turning time, is the turning radius, For transport speed.

[0030] It should be noted that multiple printed products are processed at the same time in the printing workshop, and there will be multiple printed products being processed in the same workshop within the same time period. At this time, the transportation route within the workshop is planned according to the processing sequence of the printed products and the location of the processing equipment, so as to calculate the transportation time within the workshop. Specifically, the transportation time within the workshop includes straight-line time and turning time. Specifically, the straight-line time is calculated by obtaining the straight-line distance of the transportation route within the workshop. The turning time is calculated in units of 90 degrees, and is calculated by obtaining the number of turns of the transportation route within the workshop and the turning radius of each turn.

[0031] In some embodiments, step S8 constructs a minimum objective function based on the out-of-workshop transportation time, the in-workshop transportation time, and the overtime time by minimizing the cost, such as Figure 6 As shown, the following steps are included: S81, calculate the total transportation time based on the transportation time outside the workshop and the transportation time inside the workshop; S82, calculating the total storage time according to the processing completion time of each printed product; S83, calculating the total timeout time according to the timeout time of each printing product; S84, calculating the transportation cost based on the total transportation time; S85, calculating storage cost according to the total storage time; S86, calculating the penalty cost according to the total timeout time; S87, construct the minimum objective function by minimizing the cost based on the transportation cost, storage cost and penalty cost; The formula of the minimum objective function is as follows: , , in, is the minimum objective function, is the transportation cost weight coefficient, is the transportation cost per unit transportation time, is the total transportation time, is the storage cost weight coefficient, is the storage cost per unit storage time, is the total storage time, is the penalty cost weight coefficient, is the penalty cost per unit timeout, is the total time of timeout; is the total shipping time for any printed product, The storage time of any printed product, The timeout period for any printed product.

[0032] It should be noted that the minimum objective function includes three components, namely transportation cost, storage cost and penalty cost. Specifically, the transportation cost is obtained by calculating the out-of-workshop transportation time and in-workshop transportation time of all printed products and combining the transportation cost per unit transportation time. Storage cost refers to the cost of storing printed products whose processing completion time is before the order deadline in the warehouse before the order is delivered. It is obtained by calculating the storage time of all printed products and combining the storage cost per unit storage time. Penalty cost refers to the overtime payment cost incurred by printed products whose processing completion time is after the order deadline. It is obtained by obtaining the overtime time of all printed products and combining the penalty cost per unit overtime time. Afterwards, weight coefficients are assigned to the three costs through expert opinions to obtain the minimum objective function.

[0033] In this embodiment, the production cost of the printing workshop is reduced by constructing a minimum objective function according to the transportation time, storage time and timeout time.

[0034] In some embodiments, in step S9, a genetic algorithm is used to solve the minimum objective function to obtain a scheduling solution, such as Figure 7 As shown, the following steps are included: S91, coding the printed products according to the processing sequence, processing equipment and processing start time; S92, randomly generate an initial population; S93, set population size, crossover probability, mutation probability and number of iterations; S94, constructing a fitness function according to the minimum objective function; S95, performing selection operation on the initialized population; S96, according to the crossover probability, a multi-point crossover method is used to perform a crossover operation until there is no repeated processing sequence code; S97, according to the mutation probability, using the single-point mutation method to perform mutation operations on the processing sequence code, the processing equipment code and the processing start time code respectively; S98, repeat the selection, crossover and mutation operations until the number of iterations is reached and a scheduling solution is obtained; The formula of the fitness function is as follows: , in, is the fitness function, is the minimum objective function.

[0035] It should be noted that solving the minimum objective function by genetic algorithm includes the following steps: first, the printed product is encoded. Specifically, the chromosome encoding of the printed product is divided into three sections, namely, the processing order sub-chromosome, the processing equipment sub-chromosome and the processing start time sub-chromosome, that is, the processing order encoding, the processing equipment encoding and the processing start time encoding. After the encoding is completed, the initialization population is randomly generated, and the population size, crossover probability, mutation probability and number of iterations are set according to the number of printed products. The fitness function is constructed according to the minimum objective function, and the individuals in the population are copied and selected. The individuals with larger fitness functions are more likely to be selected. After the individuals are selected, the multi-point crossover method is used for crossover operation according to the crossover probability. At the same time, in order to ensure that there are no erroneous individuals with the same processing order encoding, multiple crossovers are required until there is no repeated processing order encoding. Finally, the individuals are mutated by the single-point mutation method, and the mutation process also needs to consider each segment of the encoding separately.

[0036] In this embodiment, by encoding according to the processing sequence, processing equipment and processing start time, cross-operating individuals according to the processing sequence, and performing mutation operations on each segment of the code, the accuracy of the production scheduling of the printing workshop is improved.

[0037] Embodiment 2 This embodiment provides a production line collaborative scheduling system for a printing workshop, which implements the above-mentioned production line collaborative scheduling method for a printing workshop, such as Figure 8 As shown, it includes: a processing data acquisition module, a deadline acquisition module, a start time allocation module, a position data acquisition module, a transportation time calculation module, a completion time calculation module, a timeout time calculation module, an objective function construction module and an objective function solution module; A processing data acquisition module is used to acquire the product type of each printed product, and based on the product type, acquire the processing sequence and processing equipment of each printed product; A deadline acquisition module is used to obtain the order deadline of each printing product; The start time allocation module is used to allocate the processing start time of each printing product according to the order deadline; A location data acquisition module is used to obtain the location of the workshop and the location of the processing equipment according to the processing equipment; The transportation time calculation module is used to calculate the transportation time outside the workshop according to the workshop location; and calculate the transportation time within the workshop according to the processing sequence and the location of the processing equipment; A completion time calculation module is used to calculate the processing completion time of the printed product according to the processing start time; The timeout calculation module is used to calculate the timeout according to the processing completion time and the order deadline; An objective function building module, used to build a minimum objective function by minimizing the cost according to the out-of-workshop transportation time, the in-workshop transportation time and the overtime time; The objective function solving module is used to solve the minimum objective function using a genetic algorithm to obtain a scheduling solution.

[0038] In this embodiment, by obtaining the workshop that the processing work of the printing product needs to pass through and the processing equipment in the workshop, the transportation time of the processing work is calculated according to the location of the workshop and the location of the processing equipment, and the minimum objective function is constructed according to the transportation time. The minimum objective function is solved to schedule production in order to minimize the cost, thereby reducing the production cost of the printing workshop.

[0039] It should be understood that the disclosed system can be implemented in other ways. For example, the system embodiments described above are merely schematic. For example, the division of the above modules is only a logical function division. There may be other division methods in actual implementation. For example, multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, each functional module can be integrated into a processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules.

[0040] Embodiment 3 This embodiment provides an electronic device 2, such as Fig. 9 As shown, a processor 21 and a memory 22, the memory 22 is used to store computer program codes, the computer program codes include computer instructions, when the processor 21 executes the computer instructions, the electronic device executes the above-mentioned production line collaborative scheduling method of a printing workshop.

[0041] The electronic device 2 includes a processor 21, a memory 22, an output device 23, and an input device 24. The processor 21, the memory 22, the output device 23, and the input device 24 are coupled via a connector, and the connector includes various interfaces, transmission lines, or buses, etc., which are not limited in the embodiments of the present invention. It should be understood that in various embodiments of the present invention, coupling refers to mutual connection in a specific manner, including direct connection or indirect connection through other devices, for example, through various interfaces, transmission lines, buses, etc.

[0042] The processor 21 may be one or more graphics processing units (GPUs). When the processor 21 is a GPU, the GPU may be a single-core GPU or a multi-core GPU. Optionally, the processor 21 may be a processor group consisting of multiple GPUs, and the multiple processors are coupled to each other via one or more buses. Optionally, the processor 21 may also be other types of processors, etc., which are not limited in the embodiments of the present invention.

[0043] The memory 22 can be used to store computer program instructions and various computer program codes including program codes for executing the scheme of the present invention. Optionally, the memory 22 includes but is not limited to random access memory (RAM), read-only memory (ROM), erasable programmable read only memory (EPROM), or portable read only memory (CD-ROM), and the memory 22 is used for related instructions and data.

[0044] The input device 24 is used to input data and / or signals, and the output device 23 is used to output data and / or signals. The output device 23 and the input device 24 can be independent devices or an integrated device.

[0045] This embodiment provides a computer-readable storage medium, in which a computer program is stored. The computer program includes program instructions. When the program instructions are executed by a processor of an electronic device, the processor executes the above-mentioned production line collaborative scheduling method for a printing workshop.

[0046] The above are only specific embodiments of the present invention, which enable those skilled in the art to understand or implement the present invention. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features claimed herein.

Claims

1. A production line collaborative scheduling method for a printing workshop, characterized in that: The following steps are involved: Acquire the product type of each printed product, and acquire the processing sequence and processing equipment of each printed product according to the product type; Obtaining order cut-off times for various printed products, and allocating processing start times for various printed products according to the order cut-off times; According to the processing equipment, obtaining the workshop location and the processing equipment location; Calculate the out-of-workshop transportation time based on the workshop location; Calculating the transportation time within the workshop according to the processing sequence and the location of the processing equipment; Calculating the processing completion time of the printed product according to the processing start time; Calculate the overtime time based on the processing completion time and the order deadline; According to the out-of-workshop transportation time, the in-workshop transportation time and the overtime time, a minimum objective function is constructed by minimizing the cost; Using a genetic algorithm to solve the minimum objective function to obtain a scheduling solution; The constructing of a minimum objective function by minimizing the cost according to the transport time outside the workshop, the transport time inside the workshop and the overtime time comprises the following steps: Calculate the total transportation time based on the transportation time outside the workshop and the transportation time inside the workshop; Calculating the total storage time based on the processing completion time of each printed product; Calculate the total timeout time according to the timeout time of each printed product; Calculate the transportation cost based on the total transportation time; Calculating storage cost according to the total storage time; Calculate the penalty cost according to the total timeout time; The minimum objective function is constructed by minimizing the cost according to the transportation cost, the storage cost and the penalty cost.

2. The production line collaborative scheduling method of a printing workshop according to claim 1, characterized in that: The formula of the minimum objective function is as follows: ， ， in, is the minimum objective function, is the transportation cost weight coefficient, is the transportation cost per unit transportation time, is the total transportation time, is the storage cost weight coefficient, is the storage cost per unit storage time, is the total storage time, is the penalty cost weight coefficient, is the penalty cost per unit timeout, is the total time of timeout; is the total shipping time for any printed product, The storage time of any printed product, The timeout period for any printed product.

3. The production line collaborative scheduling method of a printing workshop according to claim 1, characterized in that: The step of calculating the out-of-workshop transportation time according to the workshop location comprises the following steps: According to the processing sequence and the location of the workshop, calculating the transportation time of the printed product between workshops, and recording it as the first transportation time; According to the order deadline and the workshop location, calculating the transportation time of the printed product between the workshop and the warehouse, and recording it as the second transportation time; The first transportation time and the second transportation time are added together to obtain the out-of-workshop transportation time.

4. The production line collaborative scheduling method of a printing workshop according to claim 3, characterized in that: The method of calculating the transportation time of the printed product between the workshop and the warehouse according to the order deadline and the workshop location, and recording it as the second transportation time, comprises the following steps: When the processing completion time of the printed product is before the order deadline, obtaining the processing completion workshop location; Calculating the second transportation time according to the processing completion workshop location and the warehouse location; When the processing completion time of the printed product is equal to the order cut-off time or when the processing completion time of the printed product is after the order cut-off time, the second transportation time is zero.

5. The production line collaborative scheduling method of a printing workshop according to claim 1, characterized in that: The step of calculating the transportation time within the workshop according to the processing sequence and the location of the processing equipment comprises the following steps: Acquire the processing sequence and the processing equipment location of the printed products processed in the same workshop within a time period; Determine the transportation route within the workshop according to the processing sequence and the location of the processing equipment; The intra-workshop transportation time is calculated according to the intra-workshop transportation route.

6. The production line collaborative scheduling method of a printing workshop according to claim 5, characterized in that: The step of calculating the intra-workshop transportation time according to the intra-workshop transportation route comprises the following steps: According to the transport route within the workshop, obtain the straight distance and turning radius; Calculating the straight travel time according to the straight travel distance; Calculating a turning time according to the turning radius; Adding the straight travel time and the turning time to obtain the intra-workshop transportation time; The calculation formula of the straight travel time is as follows: ， in, is the straight time, is the straight distance, is the transport speed; The calculation formula of the turning time is as follows: ， in, is the turning time, is the turning radius, For transport speed.

7. The production line collaborative scheduling method of a printing workshop according to claim 1, characterized in that: The method of using a genetic algorithm to solve the minimum objective function to obtain a scheduling solution includes the following steps: encoding the printed product according to the processing sequence, the processing equipment and the processing start time; Randomly generate the initial population; Set the population size, crossover probability, mutation probability, and number of iterations; Constructing a fitness function according to the minimum objective function; Performing a selection operation on the initialized population; According to the crossover probability, a multi-point crossover method is used to perform a crossover operation until there is no repeated processing sequence code; According to the mutation probability, a single-point mutation method is used to perform mutation operations on the processing sequence code, the processing equipment code and the processing start time code respectively; Repeating the selection, crossover and mutation operations until the number of iterations is reached to obtain the scheduling solution; The fitness function formula is as follows: ， in, is the fitness function, is the minimum objective function.

8. A production line collaborative scheduling system for a printing workshop, implementing a production line collaborative scheduling method for a printing workshop as claimed in any one of claims 1 to 7, characterized in that: include: Processing data acquisition module, deadline acquisition module, start time allocation module, position data acquisition module, transportation time calculation module, completion time calculation module, timeout time calculation module, objective function construction module and objective function solution module; The processing data acquisition module is used to acquire the product type of each printed product, and acquire the processing sequence and processing equipment of each printed product according to the product type; The cut-off time acquisition module is used to acquire the order cut-off time of each printing product; The start time allocation module is used to allocate the processing start time of each printed product according to the order deadline; The position data acquisition module is used to acquire the workshop position and the processing equipment position according to the processing equipment; The transportation time calculation module calculates the transportation time outside the workshop according to the workshop location; and calculates the transportation time inside the workshop according to the processing sequence and the processing equipment location; The completion time calculation module is used to calculate the processing completion time of the printed product according to the processing start time; The timeout calculation module is used to calculate the timeout according to the processing completion time and the order deadline; The objective function construction module is used to construct a minimum objective function by minimizing the cost according to the out-of-workshop transportation time, the in-workshop transportation time and the overtime time; The objective function solving module is used to solve the minimum objective function using a genetic algorithm to obtain a scheduling solution.

9. An electronic device, characterized in that: It includes a processor and a memory, the memory is used to store computer program code, the computer program code includes computer instructions, when the processor executes the computer instructions, the electronic device executes a production line collaborative scheduling method for a printing workshop as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, which includes program instructions. When the program instructions are executed by a processor of an electronic device, the processor executes a production line collaborative scheduling method for a printing workshop as described in any one of claims 1 to 7.

Images