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

Abstract

The invention provides a two-machine pipeline scheduling method, device and equipment considering transportation time, and the method comprises the steps: dividing each to-be-processed object based on the processing duration and volume of the to-be-processed object, obtaining a plurality of first objects and a plurality of second objects except the first objects, the volume of the first objects being greater than a preset volume threshold value, or the volume of the second objects being greater than a preset volume threshold value; the processing duration of the first object at the first position or the second position is greater than a preset duration threshold; generating a first scheduling scheme based on a preset transportation frequency target, wherein the first scheduling scheme comprises a processing batch of the first object at the first position, a processing batch of the first object at the second position and a transportation batch; based on the residual transportation space in the first scheduling scheme, a second scheduling scheme is constructed, and the second scheduling scheme comprises a processing batch of a second object at the first position, a processing batch of the second object at the second position and a transportation batch; based on the first scheduling scheme and the second scheduling scheme, a plurality of total scheduling schemes are obtained, a target scheduling scheme is determined in all the total scheduling schemes, and the target scheduling scheme is used for scheduling the to-be-processed object. According to the invention, two-machine pipeline scheduling considering transportation time for mixed processing of different types of to-be-processed objects can be realized.

Description

Technical Field

[0001] The present invention relates to the technical field of scheduling, and in particular to a two-machine flow scheduling method, device and equipment considering transportation time. Background Art

[0002] In the industrial field, manufacturers often encounter problems of integrated production and transportation, such as products being transported from the production workshop to the packaging workshop for packaging, workpieces being turned on lathes and then transferred to milling machines for milling, or products being roughly processed by upstream manufacturers and then transported to downstream manufacturers for further processing. In this scenario where objects are processed in two locations in sequence and need to be transported between the two locations, how to schedule the objects to be processed so that all objects to be processed can be processed and the number of transportations can be minimized to achieve efficient resource utilization and rapid production can be called a two-machine flow scheduling problem considering transportation time. In the prior art, for the two-machine flow scheduling problem considering transportation time, only the same type of objects to be processed are scheduled, and there is no method for scheduling multiple types of objects to be processed. Summary of the invention

[0003] The present invention provides a two-machine flow scheduling method, device and equipment considering transportation time, so as to solve the defect in the prior art that there is no two-machine flow scheduling method considering transportation time for various types of objects to be processed, and realize two-machine flow scheduling considering transportation time for various types of objects to be processed.

[0004] The present invention provides a two-machine flow scheduling method considering transportation time, comprising: Based on the processing time and volume of the object to be processed, each of the objects to be processed is divided to obtain a plurality of first objects and a plurality of second objects other than the first object, 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; Generate a first scheduling plan based on a preset transportation frequency target, wherein the first scheduling plan includes a processing batch of the first object at the first location, a processing batch at the second location, and a transportation batch; Based on the remaining transportation space in the first scheduling plan, construct a second scheduling plan, wherein the second scheduling plan includes a processing batch at the first location, a processing batch at the second location, and a transportation batch of the second object; Based on the first scheduling scheme and the second scheduling scheme, multiple overall scheduling schemes are obtained, a target scheduling scheme is determined in each of the overall scheduling schemes, and the objects to be processed are scheduled based on the target scheduling scheme.

[0005] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the first scheduling scheme is generated based on a preset transportation number target, including: Based on the transportation frequency target, the first scheduling plan is generated based on enumeration method.

[0006] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the second scheduling scheme is constructed based on the remaining transportation space in the first scheduling scheme, including: Determine constraints of decision variables based on the remaining transport space in the first scheduling scheme and the processing time of the second object, the decision variables corresponding to the processing batch of the second object at the first location, the processing batch at the second location, and the transport batch; The linear programming problem for the decision variables is solved based on the constraint conditions to obtain the second scheduling solution.

[0007] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the constraints include: ; ; ; ; ; in, is the decision variable, Indicates Second object In the first position Batch processing, in transport batches, at the second location Batch processing, , Respectively represent Second object the processing time at the first location and at the second location, Indicates Second object The volume of and is the preset total processing time limit of the second object in each processing batch, Indicates The transport space occupied by the first object in a transport batch, P is the capacity of the transport vehicle, N is the target number of transports, is the number of the second object.

[0008] According to the two-machine flow scheduling method considering transportation time provided by the present invention, solving the linear programming problem for the decision variables based on the constraint conditions to obtain the second scheduling solution includes: The processing batch of the second object at the first location, the processing batch at the second location, and the transport batch corresponding to the decision variable whose solution result is an integer; The second object corresponding to the decision variable whose solution result is a score is added to the newly added transport batch.

[0009] According to the two-machine flow scheduling method considering transportation time provided by the present invention, the target scheduling scheme is determined in each of the total scheduling schemes, including: The maximum completion time corresponding to the overall scheduling scheme is obtained, and the target scheduling scheme is determined based on the maximum completion time.

[0010] The present invention also provides a two-machine flow scheduling device taking transportation time into consideration, comprising: an object division module, configured to divide each of the objects to be processed based on the processing time and volume of the objects to be processed, to obtain a plurality of first objects and a plurality of 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 position or the second position is greater than a preset time threshold; A first plan generating module, configured to generate a first scheduling plan based on a preset transportation frequency target, wherein the first scheduling plan includes a processing batch of the first object at the first location, a processing batch at the second location, and a transportation batch; A second plan generating module, configured to construct a second scheduling plan based on the remaining transportation space in the first scheduling plan, wherein the second scheduling plan includes a processing batch of the second object at the first location, a processing batch at the second location, and a transportation batch; The overall plan generation module is used to obtain multiple overall scheduling plans based on the first scheduling plan and the second scheduling plan, and determine a target scheduling plan in each of the overall scheduling plans, and the target scheduling plan is used to schedule the object to be processed.

[0011] The present invention also provides a non-transitory computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the two-machine flow scheduling method considering the transportation time as described in any of the above methods is implemented.

[0012] The present invention also provides a computer program product, comprising a computer program, which, when executed by a processor, implements any of the above-mentioned two-machine flow scheduling methods considering transportation time.

[0013] The present invention provides a two-machine flow scheduling method, device and equipment considering transportation time, wherein the method includes: based on the processing time and volume of the object to be processed, each object to be processed is divided to obtain multiple first objects and multiple second objects other than the first object, 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 the preset time threshold; based on a preset transportation number target, a first scheduling scheme is generated, and the first scheduling scheme includes a processing batch of the first object at the first position, a processing batch at the second position and a transportation batch; based on the remaining transportation space in the first scheduling scheme, a second scheduling scheme is constructed, and the second scheduling scheme includes a processing batch of the second object at the first position, a processing batch at the second position and a transportation batch; based on the first scheduling scheme and the second scheduling scheme, multiple total scheduling schemes are obtained, a target scheduling scheme is determined in each total scheduling scheme, and the objects to be processed are scheduled based on the target scheduling scheme.

[0014] The present invention classifies the objects to be processed according to their processing time and volume, selects out the first object which has a long processing time or a large volume and occupies a large transportation space at one location, first generates a first scheduling scheme including only the first object according to a preset transportation number target, then uses the remaining transportation space in the first scheduling scheme to schedule the objects to be processed (second objects) other than the first object to obtain a second scheduling scheme, integrates the first scheduling scheme and the second scheduling scheme to obtain a total scheduling scheme, and finally determines the target scheduling scheme in the total scheduling scheme to schedule the objects to be processed, thereby realizing two-machine flow scheduling considering transportation time for mixed processing of different types of objects to be processed. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0016] Figure 1 It is a flow chart of a two-machine flow scheduling method considering transportation time provided by the present invention.

[0017] Figure 2 It is a schematic diagram of a two-machine flow scheduling scenario considering transportation time provided by the present invention.

[0018] Figure 3 It is a schematic diagram of the effect of a two-machine flow scheduling method considering transportation time provided by the present invention.

[0019] Figure 4 It is a structural schematic diagram of a two-machine flow scheduling device considering transportation time provided by the present invention.

[0020] Figure 5 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0021] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are 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.

[0022] In the prior art, for the two-machine flow scheduling problem considering the transportation time, only the same type of objects to be processed are scheduled, and there is no method for scheduling multiple types of objects to be processed.

[0023] In order to solve the defect in the prior art that there is no two-machine flow scheduling method considering the transportation time for various types of objects to be processed, the present invention provides a two-machine flow scheduling method, device and equipment considering the transportation time to realize two-machine flow scheduling considering the transportation time for various types of objects to be processed.

[0024] Combine the following Figure 1-3 The two-machine flow scheduling method considering transportation time provided by the present invention is described as follows: Figure 1 As shown, the present invention provides a two-machine flow scheduling method considering transportation time, comprising the steps of: S110, dividing each object to be processed based on the processing time and volume of the object to be processed to obtain a plurality of first objects and a plurality of second objects other than the first objects, the volume of the first object being greater than a preset volume threshold, or the processing time of the first object at the first position or the second position being greater than a preset time threshold; S120, generating a first scheduling plan based on a preset transportation frequency target, the first scheduling plan including a processing batch of the first object at the first location, a processing batch at the second location, and a transportation batch; S130, constructing a second scheduling plan based on the remaining transportation space in the first scheduling plan, wherein the second scheduling plan includes a processing batch of the second object at the first location, a processing batch at the second location, and a transportation batch; S140, obtaining multiple total scheduling schemes based on the first scheduling scheme and the second scheduling scheme, and determining a target scheduling scheme in each total scheduling scheme, where the target scheduling scheme is used to schedule the object to be processed.

[0025] The method provided by the present invention classifies the objects to be processed according to the processing time and volume of the objects to be processed, selects the first object whose processing time is long or whose volume is large and occupies a large transportation space at one position, first generates a first scheduling scheme including only the first object according to a preset transportation number target, then uses the remaining transportation space in the first scheduling scheme to schedule the objects to be processed (second objects) other than the first object to obtain a second scheduling scheme, integrates the first scheduling scheme and the second scheduling scheme to obtain a total scheduling scheme, and finally determines the target scheduling scheme in the total scheduling scheme to schedule the objects to be processed, thereby realizing two-machine flow scheduling considering the transportation time for mixed processing of different types of objects to be processed.

[0026] like Figure 2 As shown, in the two-machine flow scheduling scenario considering the transportation time, each object to be processed is first processed at the first position A, and then transported to the second position B by the conveyor V for processing. An infinite buffer is set in the first position A and the second position B, that is, the objects that have been processed have objects that are not being processed at the first position A or the second position B, which does not affect the processing of the remaining objects. Since all objects to be processed must be transported at least once to complete the 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 to be processed from the first position to the second position, that is, the maximum completion time satisfies the formula: . The time it takes for all pending objects to be processed to be completed. represents the i-th object to be processed, Object to be processed The processing time in the first position, Object to be processed Processing time in the second location, Indicates the transportation time from the first location to the second location. Obviously, transporting all the objects to be processed from the first location to the second location at one time can get the shortest completion time, but this situation is not often encountered in actual applications. The smaller the maximum completion time, the better the corresponding scheduling solution.

[0027] The object to be processed may be a product to be processed, a workpiece, a package, etc., and the processing of the object to be processed is determined based on the type of the object to be processed. For example, when the object to be processed is a workpiece, the processing of the object to be processed refers to processing the workpiece. The first position and the second position are the positions where the object to be processed is processed. For example, the first position and the second position may be different workshops, different manufacturers, etc. In various types of scenes of objects to be processed, different types of objects to be processed have different volumes, processing times, etc., but they all need to be processed at the first position and then transported to the second position for further processing. In the method provided by the present invention, the objects to be processed are first divided based on the processing time and volume.

[0028] The processing time and volume of the object to be processed can be obtained based on the processing technology file, design data, historical processing process, etc. of the object to be processed. After the processing time and volume of each object to be processed are obtained, the volume threshold is set according to the preset volume threshold. , preset duration threshold Each object to be processed is divided into the first object or the second object. If the volume of the object to be processed is greater than the preset volume threshold, or the processing time of a certain position in it is greater than the preset time threshold, then the object to be processed is regarded as the first object, otherwise it is regarded as the second object. Preset volume threshold , preset duration threshold As two parameters in the method provided by the present invention, they can be tried and adjusted according to actual scheduling conditions.

[0029] The first object will occupy a relatively large transportation space or take a relatively long time to process. The method provided by the present invention first schedules the first object to obtain a first scheduling plan, which includes a processing batch of the first object at a first position, a processing batch at a second position, and a transportation batch. Then, the free transportation space in the first scheduling plan is used to arrange the processing and transportation batches of the second object, so that an approximate optimal solution can be found within polynomial time.

[0030] Generate a first dispatching plan based on the preset transportation frequency target, including: Based on the transportation frequency target, the first scheduling plan is generated based on the enumeration method.

[0031] The transportation frequency target is the most ideal transportation frequency set in advance. It can be understood that this value is an ideal value. When scheduling all objects to be processed, the total transportation frequency should be as much as possible not exceeding the transportation frequency target, but the total transportation frequency is allowed to exceed the transportation frequency target. When the transportation frequency target N=1, select a batch to transport all objects to be processed. This scheduling plan is the optimal plan. When the transportation frequency target N≥2, multiple first scheduling plans are first generated based on the enumeration method. The transportation frequency in the first scheduling plan is the transportation frequency target. That is to say, in the generation of the first scheduling plan, the transportation frequency is not allowed to exceed the transportation frequency target. In the subsequent second scheduling plan, the transportation frequency can be allowed to exceed the transportation frequency target. Since the first scheduling plan is limited by the transportation frequency, it is obvious that the first scheduling plan must be a finite number, which can be obtained by enumeration.

[0032] 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 effectively utilized, the resource utilization rate can be effectively improved and the maximum completion time can be reduced.

[0033] Specifically, based on the remaining transportation space in the first scheduling plan, multiple second scheduling plans are constructed, including: Based on the remaining transportation space in the first scheduling scheme and the processing time of the second object, determining the constraint conditions of the decision variables, the decision variables corresponding to the processing batch of the second object at the first location, the processing batch at the second location, and the transportation batch; Solve the linear programming problem for decision variables based on the constraints and get the second scheduling solution

[0034] Constructing the second scheduling scheme can be regarded as solving a linear programming problem. The decision variable is a quantity that reflects the processing batch and transportation batch of the second object, which is recorded as , considering the production and transportation scenario, the constraints for constructing the linear programming problem are as follows: ; ; ; ; ; in, is the decision variable, Indicates Second object In the first position Batch processing, in transport batches, at the second location Batch processing, , Respectively represent Second object the processing time at the first location and at the second location, Indicates Second object The volume of and is the preset total processing time limit of the second object in each processing batch, Indicates The transport space occupied by the first object in a transport batch, P is the capacity of the transport vehicle, and the volume of each first object or second object does not exceed P. In practical applications, P=1 can be set for the convenience of calculation, N is the target number of transports, is the number of the second object.

[0035] For each processing batch in the first scheduling scheme, the total processing time of the processing batch can be extended to accommodate the processing of the second object. In order to improve efficiency, in the present invention, a limit value for extending the total delay of the processing batch in the first scheduling scheme is set, that is, a limit value for the total processing time of the second object in each batch in the first position and the second position is set. In a possible implementation, the limit value for the total processing time of the second object in a batch can be the preset time threshold value mentioned above. Integer multiples of, that is, the total processing time of each batch can be longer .

[0036] Understandably, Indicates Second object In the first position Batch processing, in transport batches, at the second location Batch processing, therefore, ideally, if each second object corresponds to a decision variable There is only one and it is equal to 1. However, this may cause the solution to fail. In the method provided by the present invention, the decision variable is not limited to 1, but it is allowed to be a fraction. For example, the decision variable corresponding to the second object exists , These two non-zero values, and their sum is 1, indicate that part of the corresponding second object is processed in the first batch at the first position, and part of it is processed in the second batch at the first position. This corresponding second object is a decision variable for split processing or transportation. The corresponding second object is extracted and merged into one batch for transportation, that is: The processing batch at the first location, the processing batch at the second location, and the transport batch of the second object corresponding to the decision variable whose solution result is an integer; The second object corresponding to the decision variable whose solution result is a score is added to the newly added transport batch.

[0037] The processing batch of the second object corresponding to the decision variable whose solution result is a score is no later than the newly added transport batch at the first position, and the processing batch at the second position is no earlier than the newly added transport batch.

[0038] According to constraint solving, the set of basic feasible solutions of this linear programming has at most positive variables. For decision variables = 1, arrange the second object to The batches are processed or transported. Therefore, for the decision variables satisfy The second object, whose number is bounded by a constant By adjusting the parameters, the second object with fractional solution can be transported in one batch. Therefore, when N is finite, the transport batch can be obtained as That is to say, based on the method provided by the present invention, a scheduling scheme with a maximum of N+1 transport batches can be obtained, and compared with the ideal optimal transport batch target, at most one transport batch can be added.

[0039] The first scheduling scheme and the second scheduling scheme are combined to obtain the overall scheduling scheme. In this process, the overall scheduling scheme can be generated according to the following constraints: (1) According to the information of each batch of objects to be processed, arrange the objects to be processed in the batch with smaller index to be processed first. The first position A, the conveyor V and the second position B are processed in sequence. Batch of objects to be processed: (2): No. The batch of objects to be processed are first processed at the first position A, and the first position A The start time of processing the batch of objects to be processed is no earlier than the first position A. The completion time of the objects to be processed in the batch.

[0040] (3) The batch of objects to be processed is transported from the first position A to the second position B by the conveyor V. The transportation of the batch of objects to be processed shall start no earlier than The completion time of the batch of objects to be processed at the first position A is The maximum value of the transport completion time of batch conveyor V.

[0041] (4) No. The batch of objects to be processed is processed at the second position B to ensure that the second position B is in the first The processing of the batch of objects to be processed should start no earlier than The transport completion time of batch conveyor V and the transport completion time of the second position B The maximum completion time of objects to be processed in a batch.

[0042] (5) Obtain a batch of feasible overall scheduling plans.

[0043] Among various total scheduling plans, the total scheduling plan with the shortest maximum completion time is selected as the target scheduling plan output, and the target scheduling plan is used to schedule the objects to be processed.

[0044] like Figure 3 As shown, based on the experiment conducted based on the method provided by the present invention, it can be seen that as long as there are slightly more transport batches, the approximation ratio of the scheduling solution (approximate solution) obtained by the method provided by the present invention to the ideal optimal solution can be close to 1, which has a very good effect.

[0045] The following is a description of the two-machine flow scheduling device considering the transportation time provided by the present invention. The two-machine flow scheduling device considering the transportation time described below and the two-machine flow scheduling method considering the transportation time described above can be referred to each other. Figure 4 As shown, the two-machine flow scheduling device considering the transportation time provided by the present invention includes: The object division module 410 is used to divide each object to be processed based on the processing time and volume of the object to be processed to obtain a plurality of first objects and a plurality of second objects other than the first objects, wherein 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; A first plan generating module 420, configured to generate a first scheduling plan based on a preset transportation number target, wherein the first scheduling plan includes a processing batch of the first object at the first location, a processing batch at the second location, and a transportation batch; A second plan generating module 430, configured to construct a second scheduling plan based on the remaining transportation space in the first scheduling plan, wherein the second scheduling plan includes a processing batch of the second object at the first location, a processing batch at the second location, and a transportation batch; The overall plan generating module 440 is used to obtain multiple overall scheduling plans based on the first scheduling plan and the second scheduling plan, and determine a target scheduling plan in each overall scheduling plan, and the target scheduling plan is used to schedule the object to be processed.

[0046] Figure 5 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 5As shown, the electronic device may include: a processor (processor) 510, a communication interface (Communications Interface) 520, a memory (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 the logic instructions in the memory 530 to execute the two-machine flow scheduling method considering the transportation time. The two-machine flow scheduling method considering the transportation time includes: based on the processing time and volume of the object to be processed, each object to be processed is divided to obtain multiple first objects and multiple second objects other than the first object, the volume of the first object is greater than the preset volume threshold, or the processing time of the first object at the first position or the second position is greater than the preset time threshold; based on the preset transportation number target, a first scheduling scheme is generated, and the first scheduling scheme includes a processing batch of the first object at the first position, a processing batch at the second position, and a transportation batch; based on the remaining transportation space in the first scheduling scheme, a second scheduling scheme is constructed, and the second scheduling scheme includes a processing batch of the second object at the first position, a processing batch at the second position, and a transportation batch; based on the first scheduling scheme and the second scheduling scheme, multiple total scheduling schemes are obtained, and a target scheduling scheme is determined in each total scheduling scheme, and the target scheduling scheme is used to schedule the object to be processed.

[0047] In addition, the logic instructions in the above-mentioned memory 530 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0048] On the other hand, the present invention also provides a computer program product, which includes a computer program. The computer program 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 flow scheduling method considering the transportation time provided above. The two-machine flow scheduling method considering the transportation time includes: based on the processing time and volume of the object to be processed, each object to be processed is divided to obtain multiple first objects and multiple second objects other than the first object, 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 the preset time threshold; based on a preset transportation number target, a first scheduling scheme is generated, and the first scheduling scheme includes a processing batch of the first object at the first position, a processing batch at the second position, and a transportation batch; based on the remaining transportation space in the first scheduling scheme, a second scheduling scheme is constructed, and the second scheduling scheme includes a processing batch of the second object at the first position, a processing batch at the second position, and a transportation batch; based on the first scheduling scheme and the second scheduling scheme, multiple total scheduling schemes are obtained, and a target scheduling scheme is determined in each total scheduling scheme, and the target scheduling scheme is used to schedule the object to be processed.

[0049] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the processor executes the two-machine flow scheduling method considering the transportation time provided above, and the two-machine flow scheduling method considering the transportation time includes: based on the processing time and volume of the object to be processed, each object to be processed is divided to obtain multiple first objects and multiple second objects other than the first object, 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 the preset time threshold; based on a preset transportation number target, a first scheduling scheme is generated, the first scheduling scheme includes a processing batch of the first object at the first position, a processing batch at the second position, and a transportation batch; based on the remaining transportation space in the first scheduling scheme, a second scheduling scheme is constructed, the second scheduling scheme includes a processing batch of the second object at the first position, a processing batch at the second position, and a transportation batch; based on the first scheduling scheme and the second scheduling scheme, multiple total scheduling schemes are obtained, and a target scheduling scheme is determined in each total scheduling scheme, and the target scheduling scheme is used to schedule the object to be processed.

[0050] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0051] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0052] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions 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 object to be processed, each of the objects to be processed is divided to obtain a plurality of first objects and a plurality of second objects other than the first object, 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; Generate a first scheduling plan based on a preset transportation frequency target, wherein the first scheduling plan includes a processing batch of the first object at the first location, a processing batch at the second location, and a transportation batch; Based on the remaining transportation space in the first scheduling plan, construct a second scheduling plan, wherein the second scheduling plan includes a processing batch at the first location, a processing batch at the second location, and a transportation batch of the second object; Based on the first scheduling scheme and the second scheduling scheme, multiple overall scheduling schemes are obtained, a target scheduling scheme is determined in each of the overall scheduling schemes, and the objects to be processed are scheduled based on the target scheduling scheme.

2. The two-machine flow scheduling method considering transportation time according to claim 1 is characterized in that: The generating of the first dispatching scheme based on the preset transport frequency target includes: Based on the transportation frequency target, the first scheduling plan is generated based on enumeration method.

3. The two-machine flow scheduling method considering transportation time according to claim 1 is characterized in that: The constructing a second scheduling plan based on the remaining transportation space in the first scheduling plan includes: Determine constraints of decision variables based on the remaining transport space in the first scheduling scheme and the processing time of the second object, the decision variables corresponding to the processing batch of the second object at the first location, the processing batch at the second location, and the transport batch; The linear programming problem for the decision variables is solved based on the constraint conditions to obtain the second scheduling solution.

4. The two-machine flow scheduling method considering transportation time according to claim 3 is characterized in that: The constraints include: ； ； ； ； ； in, is the decision variable, Indicates Second object In the first position Batch processing, in transport batches, at the second location Batch processing, , Respectively represent Second object the processing time at the first location and at the second location, Indicates Second object The volume of and is the preset total processing time limit of the second object in each processing batch, Indicates The transport space occupied by the first object in a transport batch, P is the capacity of the transport vehicle, N is the target number of transports, is the number of the second object.

5. The two-machine flow scheduling method considering transportation time according to claim 4 is characterized in that: The step of solving the linear programming problem for the decision variables based on the constraint conditions to obtain the second scheduling solution includes: The processing batch of the second object at the first location, the processing batch at the second location, and the transport batch corresponding to the decision variable whose solution result is an integer; The second object corresponding to the decision variable whose solution result is a score is added to the newly added transport batch.

6. The two-machine flow scheduling method considering transportation time according to claim 1 is characterized in that: Determining the target scheduling scheme in each of the overall scheduling schemes includes: The maximum completion time corresponding to the overall scheduling scheme is obtained, and the target scheduling scheme is determined based on the maximum completion time.

7. A two-machine flow scheduling device considering transportation time, characterized in that: include: an object division module, configured to divide each of the objects to be processed based on the processing time and volume of the objects to be processed, to obtain a plurality of first objects and a plurality of 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 position or the second position is greater than a preset time threshold; A first plan generating module, configured to generate a first scheduling plan based on a preset transportation frequency target, wherein the first scheduling plan includes a processing batch of the first object at the first location, a processing batch at the second location, and a transportation batch; A second plan generating module, configured to construct a second scheduling plan based on the remaining transportation space in the first scheduling plan, wherein the second scheduling plan includes a processing batch of the second object at the first location, a processing batch at the second location, and a transportation batch; The overall plan generation module is used to obtain multiple overall scheduling plans based on the first scheduling plan and the second scheduling plan, and determine a target scheduling plan in each of the overall scheduling plans, and the target scheduling plan is used to schedule the object to be processed.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the two-machine flow scheduling method considering the transportation time as described in any one of claims 1-6 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the two-machine flow scheduling method considering transportation time as described in any one of claims 1-6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the two-machine flow scheduling method considering transportation time as described in any one of claims 1-6 is implemented.

Images