Two-machine flow scheduling method, device and equipment considering transportation time

Abstract

This invention provides a two-machine flow scheduling method, apparatus, and equipment that considers transportation time. The method includes: dividing each object to be processed into multiple first objects and multiple second objects other than the first objects, based on the processing time and volume of the objects to be processed; the volume of the first objects is greater than a preset volume threshold, or the processing time of the first objects at a first position or a second position is greater than a preset time threshold; generating a first scheduling scheme based on a preset transportation number target, the first scheduling scheme including processing batches of the first objects at the first position, processing batches at the second position, and transportation batches; constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme, the second scheduling scheme including processing batches of the second objects at the first position, processing batches at the second position, and transportation batches; obtaining multiple overall scheduling schemes based on the first and second scheduling schemes, and determining a target scheduling scheme among the overall scheduling schemes, the target scheduling scheme being used to schedule the objects to be processed. This invention can realize two-machine flow scheduling that considers transportation time for mixed processing of different types of objects to be processed.

Description

Technical Field

[0001] This invention relates to the field of scheduling technology, and in particular to a two-machine flow scheduling method, apparatus and equipment that takes into account transportation time. Background Technology

[0002] In the industrial sector, manufacturers frequently encounter integrated production and transportation challenges. For example, products are often transferred from the production workshop to the packaging workshop for packaging; workpieces are machined on a lathe and then transferred to a milling machine for milling; or products are roughly processed by an upstream manufacturer and then transported to a downstream manufacturer for further processing. In scenarios where processing occurs sequentially at two locations with transportation required between them, the challenge lies in scheduling the processing objects to ensure all objects are processed while minimizing transportation trips, thus achieving efficient resource utilization and rapid production. This can be termed the two-machine flow scheduling problem considering transportation time. Current technologies for this problem only address scheduling for objects of the same type, lacking methods for scheduling multiple types of objects. Summary of the Invention

[0003] This invention provides a two-machine flow scheduling method, apparatus, and equipment that takes into account transportation time, in order to overcome the shortcomings of existing technologies that do not have a two-machine flow scheduling method that takes into account transportation time for multiple types of objects to be processed, and to realize two-machine flow scheduling that takes into account transportation time for multiple types of objects to be processed.

[0004] This invention provides a two-machine flow scheduling method that considers transportation time, comprising:

[0005] Based on the processing time and volume of the objects to be processed, each object to be processed is divided into multiple first objects and multiple second objects other than the first objects. The volume of the first object is greater than a preset volume threshold, or the processing time of the first object at the first position or the second position is greater than a preset time threshold.

[0006] A first scheduling scheme is generated based on a preset transportation target. The first scheduling scheme includes the processing batch of the first object at the first location, the processing batch at the second location, and the transportation batch.

[0007] Based on the remaining transportation space in the first scheduling scheme, a second scheduling scheme is constructed, which includes the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch.

[0008] Based on the first scheduling scheme and the second scheduling scheme, multiple overall scheduling schemes are obtained. A target scheduling scheme is determined among the various overall scheduling schemes, and the objects to be processed are scheduled based on the target scheduling scheme.

[0009] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the step of generating a first scheduling scheme based on a preset target number of transportation trips includes:

[0010] Based on the target number of transportation trips, the first scheduling scheme is generated using an enumeration method.

[0011] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the step of constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme includes:

[0012] Based on the remaining transportation space in the first scheduling scheme and the processing time of the second object, the constraints of the decision variables are determined. The decision variables correspond to the processing batch, the processing batch and the transportation batch of the second object at the first location;

[0013] Based on the constraints, the linear programming problem for the decision variables is solved to obtain the second scheduling scheme.

[0014] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the constraints include:

[0015] ; ; ; ; ;

[0016] in, Let be the decision variable. Indicates the first The second object The first position Batch processing, in the The first shipment batch was transported, in the second position. Batch processing, , They represent the first The second object Processing time at the first and second positions, Indicates the first The second object volume, and The pre-set limit for the total processing time of the second object in each processing batch. Indicates the first The transportation space occupied by the first object in each transportation batch, where P is the capacity of the transportation vehicle and N is the target number of transportation trips. The number of the second object.

[0017] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the step of solving the linear programming problem for the decision variables based on the constraints to obtain the second scheduling scheme includes:

[0018] Based on the decision variables whose solution results are integers, the processing batch, the processing batch, and the transportation batch of the second object at the first position;

[0019] The second object corresponding to the decision variable whose solution result is a score is added to the new transportation batch.

[0020] According to the two-machine flow scheduling method considering transportation time provided by the present invention, determining the target scheduling scheme among the various overall scheduling schemes includes:

[0021] Obtain the maximum completion time corresponding to the overall scheduling scheme, and determine the target scheduling scheme based on the maximum completion time.

[0022] The present invention also provides a two-machine flow scheduling device that takes into account transportation time, comprising:

[0023] The object partitioning module is used to partition each of the objects to be processed based on the processing time and volume of the objects to be processed, to obtain multiple first objects and multiple second objects other than the first objects. The volume of the first object is greater than a preset volume threshold, or the processing time of the first object at the first position or the second position is greater than a preset time threshold.

[0024] The first scheme generation module is used to generate a first scheduling scheme based on a preset transportation number target. The first scheduling scheme includes the processing batch of the first object at the first location, the processing batch at the second location, and the transportation batch.

[0025] The second scheme generation module is used to construct a second scheduling scheme based on the remaining transportation space in the first scheduling scheme. The second scheduling scheme includes the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch.

[0026] The overall scheme generation module is used to obtain multiple overall scheduling schemes based on the first scheduling scheme and the second scheduling scheme, and to determine a target scheduling scheme among the overall scheduling schemes. The target scheduling scheme is used to schedule the object to be processed.

[0027] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the two-machine flow scheduling method considering transportation time as described above.

[0028] The present invention also provides a computer program product, including a computer program that, when executed by a processor, implements the two-machine flow scheduling method considering transportation time as described above.

[0029] The present invention provides a two-machine flow scheduling method, apparatus, and equipment that considers transportation time. The method includes: dividing each object to be processed based on its processing time and volume to obtain multiple first objects and multiple second objects other than the first objects. The volume of the first objects is greater than a preset volume threshold, or the processing time of the first objects at a first position or a second position is greater than a preset time threshold; generating a first scheduling scheme based on a preset transportation number target, the first scheduling scheme including a processing batch of the first objects at the first position, a processing batch at the second position, and a transportation batch; constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme, the second scheduling scheme including a processing batch of the second objects at the first position, a processing batch at the second position, and a transportation batch; obtaining multiple overall scheduling schemes based on the first and second scheduling schemes, determining a target scheduling scheme among the overall scheduling schemes, and scheduling the objects to be processed based on the target scheduling scheme.

[0030] This invention categorizes objects to be processed based on their processing time and volume. A first-order object, characterized by a long processing time or large volume occupying significant transport space, is selected. A first scheduling scheme, including only the first-order object, is generated based on a pre-set transport frequency target. Then, the remaining transport space in the first scheduling scheme is used to schedule other objects (second-order objects) to obtain a second scheduling scheme. The first and second scheduling schemes are combined to obtain a final scheduling scheme. Finally, a target scheduling scheme is determined within the final scheduling scheme to schedule the objects to be processed. This achieves a two-machine flow scheduling system that considers transport time for mixed processing of different types of objects. Attached Figure Description

[0031] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0032] Figure 1This is a flowchart illustrating a two-machine flow scheduling method that takes into account transportation time, provided by the present invention.

[0033] Figure 2 This is a schematic diagram of a two-machine flow scheduling scenario that takes into account transportation time, provided by the present invention.

[0034] Figure 3 This is a schematic diagram illustrating the effect of a two-machine flow scheduling method that takes into account transportation time, provided by the present invention.

[0035] Figure 4 This is a schematic diagram of the structure of the two-machine flow scheduling device that takes into account transportation time provided by the present invention.

[0036] Figure 5 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation

[0037] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0038] In the existing technology, for the two-machine flow scheduling problem that takes into account transportation time, scheduling is only performed on the same type of object to be processed, and there is no method for scheduling multiple types of objects to be processed.

[0039] To address the shortcomings of existing technologies that lack a two-machine flow scheduling method that considers transportation time for various types of objects to be processed, this invention provides a two-machine flow scheduling method, apparatus, and equipment that considers transportation time, enabling two-machine flow scheduling for various types of objects to be processed that takes transportation time into account.

[0040] The following is combined with Figure 1-3 The present invention describes a two-machine flow scheduling method that takes into account transportation time, such as... Figure 1 As shown, the present invention provides a two-machine flow scheduling method that considers transportation time, comprising the following steps:

[0041] S110. Based on the processing time and volume of the objects to be processed, divide each object to be processed into multiple first objects and multiple second objects other than the first objects. The volume of the first object is greater than a preset volume threshold, or the processing time of the first object at the first position or the second position is greater than a preset time threshold.

[0042] S120. Generate a first scheduling scheme based on a preset transportation number target. The first scheduling scheme includes a processing batch of the first object at a first location, a processing batch at a second location, and a transportation batch.

[0043] S130. Construct a second scheduling scheme based on the remaining transportation space in the first scheduling scheme. The second scheduling scheme includes the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch.

[0044] S140. Based on the first scheduling scheme and the second scheduling scheme, multiple overall scheduling schemes are obtained. Among the various overall scheduling schemes, a target scheduling scheme is determined. The target scheduling scheme is used to schedule the objects to be processed.

[0045] The method provided by this invention classifies objects to be processed based on their processing time and volume. A first object with a long processing time or large volume occupying a large transportation space is selected. A first scheduling scheme that includes only the first object is generated based on a pre-set target number of transportations. Then, the remaining transportation space in the first scheduling scheme is used to schedule the objects to be processed other than the first object (the second object) to obtain a second scheduling scheme. The first and second scheduling schemes are combined to obtain a total scheduling scheme. Finally, a target scheduling scheme is determined in the total scheduling scheme to schedule the objects to be processed. This achieves two-machine flow scheduling that takes into account transportation time for mixed processing of different types of objects to be processed.

[0046] like Figure 2 As shown, in a two-machine flow scheduling scenario considering transportation time, each object to be processed is first processed at position A, and then transported by transport machine V to position B for further processing. Infinite buffers are set in both positions A and B, meaning that objects already processed may exist at either position A or B but are not currently being processed, without affecting the processing of other objects. Since all objects to be processed must undergo at least one transport to complete their processing, the maximum completion time of the scheduling scheme is at least the sum of the processing time of all objects to be processed at a single position and the transportation time of the objects from position A to position B. That is, the maximum completion time satisfies the formula: . The completion time for processing all pending objects. This represents the i-th object to be processed. Object to be processed Processing time in the first position, Object to be processed Processing time in the second position, This represents the transportation time from the first location to the second location. Clearly, transporting all pending objects from the first location to the second location at once would yield the shortest completion time, but this is not frequently encountered in practical applications. The shorter the maximum completion time, the better the corresponding scheduling scheme.

[0047] The objects to be processed can be products, workpieces, packages, etc. The processing of these objects is determined by their type. For example, if the object is a workpiece, processing refers to machining the workpiece. The first and second positions are the locations where the objects are processed; for example, the first and second positions could be different workshops or different manufacturers. In scenarios with multiple types of objects to be processed, the volume, processing time, etc., vary, but they all need to be processed at the first position before being transported to the second position for further processing. In the method provided by this invention, the objects to be processed are first divided based on processing time and volume.

[0048] The processing time and volume of each object to be processed can be obtained based on its processing technology documents, design data, and historical processing history. After obtaining the processing time and volume of each object, a preset volume threshold is applied. Preset duration threshold Each object to be processed is divided into either a first object or a second object. If the volume of an object to be processed is greater than a preset volume threshold, or if the processing time at any point within it exceeds a preset time threshold, then the object to be processed is classified as a first object; otherwise, it is classified as a second object. (Preset volume threshold) Preset duration threshold The two parameters provided in this invention can be tried and adjusted according to the actual scheduling situation.

[0049] The first object will occupy a relatively large transportation space or take a long time to process. The method provided by the present invention first schedules the first object to obtain a first scheduling scheme. The first scheduling scheme includes the processing batch of the first object at the first position, the processing batch at the second position, and the transportation batch. Then, the spare transportation space in the first scheduling scheme is used to arrange the processing and transportation batch of the second object, which can achieve finding an approximate optimal solution in polynomial time.

[0050] A first scheduling scheme is generated based on a preset target number of transport trips, including:

[0051] Based on the target number of transportation trips, the first scheduling scheme is generated using an enumeration method.

[0052] The target number of transports is a pre-defined, ideal number of transports. This is an ideal value; when scheduling all pending objects, the total number of transports should ideally not exceed the target, but exceeding it is permissible. When the target number of transports N=1, selecting one batch to transport all pending objects is the optimal scheduling scheme. When the target number of transports N≥2, multiple first scheduling schemes are first generated using enumeration. The number of transports in each first scheduling scheme is the target number. In other words, in generating the first scheduling scheme, the number of transports is not allowed to exceed the target. In subsequent second scheduling schemes, the number of transports can exceed the target. Since the first scheduling scheme is limited by the number of transports, it is clear that the number of first scheduling schemes is finite, which can be obtained through enumeration.

[0053] In the first scheduling scheme, the first object is processed or transported in batch order. There may be some idle time or remaining space during the processing or transportation process. If these resources are used effectively, the utilization rate of resources can be improved and the maximum completion time can be reduced.

[0054] Specifically, based on the remaining transportation space in the first scheduling scheme, multiple second scheduling schemes are constructed, including:

[0055] Based on the remaining transportation space in the first scheduling scheme and the processing time of the second object, the constraints of the decision variables are determined. The decision variables correspond to the processing batch, processing batch and transportation batch of the second object at the first location, the second location and the second location.

[0056] Solving the linear programming problem with respect to the decision variables based on the constraints yields the second scheduling scheme.

[0057] Constructing a second scheduling scheme can be viewed as solving a linear programming problem, where the decision variable is a quantity reflecting the processing batches and transportation batches of the second object, denoted as . Considering the production and transportation scenario, the constraints for constructing the linear programming problem are as follows:

[0058] ; ; ; ; ;

[0059] in, Let be the decision variable. Indicates the first The second object The first position Batch processing, in the The first shipment batch was transported, in the second position. Batch processing, , They represent the first The second object Processing time at the first and second positions, Indicates the first The second object volume, and The pre-set limit for the total processing time of the second object in each processing batch. Indicates the first The transportation space occupied by the first object in each transportation batch, where P is the capacity of the transport vehicle, and the volume of each first or second object does not exceed P. In practical applications, for ease of calculation, P can be set to 1, and N is the target number of transportations. The number of the second object.

[0060] For each processing batch in the first scheduling scheme, the total processing time of the batch can be extended to accommodate the processing of the second object. To improve efficiency, this invention sets a limit on the total delay of the processing batches in the first scheduling scheme, that is, a limit on the total processing time of the second object in each batch in the first and second positions. In one possible implementation, the limit on the total processing time of the second object in a batch can be the preset time threshold mentioned above. This means that the total processing time for each batch can be an integer multiple of the total processing time, which is equivalent to the total processing time for each batch. .

[0061] Understandable Indicates the first The second object The first position Batch processing, in the The first shipment batch was transported, in the second position. Batch processing; therefore, ideally, if the decision variables corresponding to each second object... Each variable has only one value and is equal to 1. However, this may lead to solution failure. The method provided in this invention does not restrict the decision variable to be equal to 1, but allows it to be a fraction. For example, the decision variable corresponding to the second object exists... , These two non-zero values, and their sum of 1, indicate that a portion of the second object is processed in the first batch at the first position, and another portion is processed in the second batch at the first position. This type of decision variable, which corresponds to a split-processing or transportation of the second object, allows us to extract the corresponding second object and merge it into a single batch for transportation.

[0062] Based on the decision variables whose solution results are integers, the second object corresponds to the processing batch at the first position, the processing batch at the second position, and the transportation batch;

[0063] Add the second object corresponding to the decision variable whose solution is a score to the new transportation batch.

[0064] For decision variables whose solutions result in scores, the processing batch of the second object in the first position is no later than the new transportation batch, and the processing batch in the second position is no earlier than the new transportation batch.

[0065] Based on the constraints, the linear programming problem has at most one set of basic feasible solutions. There are positive variables. For decision variables... In the case where =1, the second object will be arranged to Batch processing or transportation is carried out. Therefore, for decision variables that satisfy... The second object, whose quantity is bounded by an upper limit to a constant. By adjusting the parameters, the second object obtained from the fractional solution can be transported in a batch. Therefore, when N is finite, the number of transport batches can be obtained. The method provided by this invention provides a batching scheme. In other words, based on the method provided by this invention, a scheduling scheme with a maximum of N+1 transportation batches can be obtained, which can achieve a maximum increase of only one transportation batch compared to the ideal optimal transportation batch target.

[0066] By merging the first and second scheduling schemes, a total scheduling scheme can be obtained. This process can be based on the following constraints:

[0067] (1) Based on the information of the objects to be processed in each batch, arrange for the objects in the batch with the smaller index to be processed or transported first. Process the objects in the first position A, transport machine V, and second position B in sequence. Batch of objects to be processed:

[0068] (2): No. The batch of objects to be processed is first processed at position A, and the first object at position A is processed first. The start time of processing the batch of objects to be processed shall not be earlier than the first position A. Completion time of the batch of pending objects.

[0069] (3) The first The batch of objects to be processed is transported from position A to position B using transport aircraft V. The first batch of objects on transport aircraft V... The start time for shipping the batch of objects to be processed shall not be earlier than the [number]th [number]. The completion time of the batch of pending objects at the first position A and the first The maximum time for batch transport aircraft V to complete transport.

[0070] (4) No. The batch of objects to be processed must be processed at the second position B to ensure that the second position B is in the [missing information]. The processing time for the batch of objects to be processed shall not be earlier than the first batch. The completion time of the transport of batch transport aircraft V and the second position B. The maximum completion time for the batch of objects to be processed.

[0071] (5) A batch of feasible overall scheduling schemes were obtained.

[0072] Among all the overall scheduling schemes, the overall scheduling scheme with the shortest maximum completion time is selected as the target scheduling scheme output. The target scheduling scheme is used to schedule the objects to be processed.

[0073] like Figure 3 As shown in the figure, experiments were conducted based on the method provided by the present invention. It can be seen that as long as the number of transportation batches is slightly larger, the approximation ratio between the scheduling scheme (approximate solution) obtained by the method provided by the present invention and the ideal optimal solution can be close to 1, which has a very good effect.

[0074] The following describes the two-machine flow scheduling device that takes into account transportation time provided by the present invention. The two-machine flow scheduling device that takes into account transportation time described below can be referred to in correspondence with the two-machine flow scheduling method that takes into account transportation time described above. Figure 4 As shown, the two-machine flow scheduling device considering transportation time provided by the present invention includes:

[0075] The object partitioning module 410 is used to partition each object to be processed based on the processing time and volume of the object to be processed, to obtain multiple first objects and multiple second objects other than the first objects. The volume of the first object is greater than a preset volume threshold, or the processing time of the first object at the first position or the second position is greater than a preset time threshold.

[0076] The first scheme generation module 420 is used to generate a first scheduling scheme based on a preset transportation number target. The first scheduling scheme includes a processing batch of the first object at a first location, a processing batch at a second location, and a transportation batch.

[0077] The second scheme generation module 430 is used to construct a second scheduling scheme based on the remaining transportation space in the first scheduling scheme. The second scheduling scheme includes the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch.

[0078] The overall scheme generation module 440 is used to obtain multiple overall scheduling schemes based on the first scheduling scheme and the second scheduling scheme, and to determine the target scheduling scheme among the overall scheduling schemes. The target scheduling scheme is used to schedule the objects to be processed.

[0079] Figure 5 An example is a schematic diagram of the physical structure of an electronic device, such as... Figure 5 As shown, the electronic device may include: a processor 510, a communication interface 520, a memory 530, and a communication bus 540, wherein the processor 510, the communication interface 520, and the memory 530 communicate with each other through the communication bus 540. The processor 510 can call logic instructions in the memory 530 to execute a two-machine pipeline scheduling method that considers transportation time. The two-machine pipeline scheduling method that considers transportation time includes: dividing each object to be processed based on the processing time and volume of the objects to be processed, obtaining multiple first objects and multiple second objects other than the first objects, wherein the volume of the first objects is greater than a preset volume threshold, or the processing time of the first objects at the first or second position is greater than a preset time threshold; generating a first scheduling scheme based on a preset transportation number target, the first scheduling scheme including the processing batch of the first objects at the first position, the processing batch at the second position, and the transportation batch; constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme, the second scheduling scheme including the processing batch of the second objects at the first position, the processing batch at the second position, and the transportation batch; obtaining multiple overall scheduling schemes based on the first and second scheduling schemes, and determining a target scheduling scheme in each overall scheduling scheme, the target scheduling scheme being used to schedule the objects to be processed.

[0080] Furthermore, the logical instructions in the aforementioned memory 530 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0081] On the other hand, the present invention also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the two-machine pipeline scheduling method considering transportation time provided above. The two-machine pipeline scheduling method considering transportation time includes: dividing each object to be processed based on the processing time and volume of the objects to be processed, obtaining multiple first objects and multiple second objects other than the first objects, wherein the volume of the first objects is greater than a preset volume threshold, or the processing time of the first objects at the first or second position is greater than a preset time threshold; generating a first scheduling scheme based on a preset transportation number target, wherein the first scheduling scheme includes a processing batch of the first objects at the first position, a processing batch at the second position, and a transportation batch; constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme, wherein the second scheduling scheme includes a processing batch of the second objects at the first position, a processing batch at the second position, and a transportation batch; obtaining multiple overall scheduling schemes based on the first and second scheduling schemes, and determining a target scheduling scheme in each overall scheduling scheme, wherein the target scheduling scheme is used to schedule the objects to be processed.

[0082] In another aspect, the present invention also provides a non-transitory computer-readable storage medium storing a computer program thereon. When executed by a processor, the computer program is implemented to perform the two-machine pipeline scheduling method considering transportation time described above. The two-machine pipeline scheduling method considering transportation time includes: dividing each object to be processed based on the processing time and volume of the objects to be processed, obtaining multiple first objects and multiple second objects other than the first objects, wherein the volume of the first objects is greater than a preset volume threshold, or the processing time of the first objects at a first position or a second position is greater than a preset time threshold; generating a first scheduling scheme based on a preset transportation number target, wherein the first scheduling scheme includes a processing batch of the first objects at a first position, a processing batch at a second position, and a transportation batch; constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme, wherein the second scheduling scheme includes a processing batch of the second objects at a first position, a processing batch at a second position, and a transportation batch; obtaining multiple overall scheduling schemes based on the first scheduling scheme and the second scheduling scheme, and determining a target scheduling scheme among the various overall scheduling schemes, wherein the target scheduling scheme is used to schedule the objects to be processed.

[0083] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0084] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0085] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A two-machine flow scheduling method considering transportation time, characterized in that, include: Based on the processing time and volume of the objects to be processed, each object to be processed is divided into multiple first objects and multiple second objects other than the first objects. The volume of the first object is greater than a preset volume threshold, or the processing time of the first object at the first position or the second position is greater than a preset time threshold. Each object to be processed is first processed at the first position and then transported to the second position for processing. A first scheduling scheme is generated based on a preset transportation number target. The first scheduling scheme includes the processing batch of the first object at the first location, the processing batch at the second location, and the transportation batch. The number of transportations in the first scheduling scheme does not exceed the transportation number target. Based on the remaining transportation space in the first scheduling scheme, a second scheduling scheme is constructed. The second scheduling scheme includes the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch. The number of transportations in the second scheduling scheme is allowed to exceed the target number of transportations. Based on the first scheduling scheme and the second scheduling scheme, multiple overall scheduling schemes are obtained. A target scheduling scheme is determined from each of the overall scheduling schemes, and the object to be processed is scheduled based on the target scheduling scheme. The step of constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme includes: Based on the remaining transportation space in the first scheduling scheme and the processing time of the second object, the constraints of the decision variables are determined. The decision variables correspond to the processing batch, the processing batch and the transportation batch of the second object at the first location; The constraints include: ∑ o,p,q x j,(o,p,q) =1;∑ j,p,q a j ·x j,(o,p,q) ≤α0;∑ j,o,q s j ·x j,(o,p,q) +l p ≤P;∑ j,o,p b j ·x j,(o,p,q) ≤β q ;1≤j≤n′;1≤o≤p≤q≤N; Where, x j,(o,p,q) Let x be the decision variable. j,(o,p,q) =1 indicates that the j-th second object J j Processing in the 0th batch at the first position, transporting in the pth transport batch, processing in the qth batch at the second position, a j b j Representing the j-th second object J respectively j Processing time at the first and second positions, s j Represents the j-th second object J j The volume, α0 and β q For the pre-set total processing time limit of the second object in each processing batch, l p This represents the transportation space occupied by the first object in the p-th transportation batch, where P is the capacity of the transportation vehicle, N is the target number of transportations, and n′ is the quantity of the second object. Determine the processing batch, processing batch, and transportation batch of the second object at the first position corresponding to the decision variable whose solution result is an integer; The second object corresponding to the decision variable whose solution result is a fraction is added to the new transportation batch. The processing batch of the second object corresponding to the decision variable whose solution result is a fraction at the first position is no later than the new transportation batch, and the processing batch at the second position is no earlier than the new transportation batch.

2. The two-machine flow scheduling method considering transportation time according to claim 1, characterized in that, The generation of the first scheduling scheme based on the preset target number of transportation trips includes: Based on the target number of transportation trips, the first scheduling scheme is generated using an enumeration method.

3. The two-machine flow scheduling method considering transportation time according to claim 1, characterized in that, The step of determining the target scheduling scheme among the various overall scheduling schemes includes: Obtain the maximum completion time corresponding to the overall scheduling scheme, and determine the target scheduling scheme based on the maximum completion time.

4. A two-machine flow scheduling device that considers transportation time, characterized in that, include: The object partitioning module is used to partition each of the objects to be processed based on the processing time and volume of the objects to be processed, to obtain multiple first objects and multiple second objects other than the first objects. The volume of the first object is greater than a preset volume threshold, or the processing time of the first object at the first position or the second position is greater than a preset time threshold. Each object to be processed is first processed at the first position and then transported to the second position for processing. The first scheme generation module is used to generate a first scheduling scheme based on a preset transportation number target. The first scheduling scheme includes the processing batch of the first object at the first location, the processing batch at the second location, and the transportation batch. The number of transportations in the first scheduling scheme does not exceed the transportation number target. The second scheme generation module is used to construct a second scheduling scheme based on the remaining transportation space in the first scheduling scheme. The second scheduling scheme includes the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch. The number of transportations in the second scheduling scheme is allowed to exceed the target number of transportations. The overall scheme generation module is used to obtain multiple overall scheduling schemes based on the first scheduling scheme and the second scheduling scheme, and to determine a target scheduling scheme among the overall scheduling schemes. The target scheduling scheme is used to schedule the object to be processed. The step of constructing a second scheduling scheme based on the remaining transportation space in the first scheduling scheme includes: Based on the remaining transportation space in the first scheduling scheme and the processing time of the second object, the constraints of the decision variables are determined. The decision variables correspond to the processing batch, the processing batch and the transportation batch of the second object at the first location; The constraints include: ∑ o,p,q x j,(o,p,q) =1;∑ j,p,q a j ·x j,(o,p,q) ≤α0;∑ j,o,q s j ·x j,(o,p,q) +l p ≤P;∑ j,o,p b j ·x j,(o,p,q) ≤β q ;1≤j≤n′;1≤o≤p≤q≤N; Where, x j,(o,p,q) Let x be the decision variable. j,(o,p,q) =1 indicates that the j-th second object J j Processing in the 0th batch at the first position, transporting in the pth transport batch, processing in the qth batch at the second position, a j b j Representing the j-th second object J respectively j Processing time at the first and second positions, s j Represents the j-th second object J j The volume, α0 and β q For the pre-set total processing time limit of the second object in each processing batch, l p This represents the transportation space occupied by the first object in the p-th transportation batch, where P is the capacity of the transportation vehicle, N is the target number of transportations, and n′ is the quantity of the second object. Determine the processing batch, processing batch, and transportation batch of the second object at the first position corresponding to the decision variable whose solution result is an integer; The second object corresponding to the decision variable whose solution result is a fraction is added to the new transportation batch. The processing batch of the second object corresponding to the decision variable whose solution result is a fraction at the first position is no later than the new transportation batch, and the processing batch at the second position is no earlier than the new transportation batch.

5. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the two-machine flow scheduling method that takes into account transportation time as described in any one of claims 1-3.

6. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the two-machine flow scheduling method that takes into account transportation time as described in any one of claims 1-3.

7. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the two-machine flow scheduling method that takes into account transportation time as described in any one of claims 1-3.

Images