CN118278722A

CN118278722A - Bottleneck procedure-based scheduling method, device and storage medium

Info

Publication number: CN118278722A
Application number: CN202410714365.4A
Authority: CN
Inventors: 殷作银; 曾光; 虢彦; 李承龙; 雷旭辉; 刘向阳
Original assignee: Zhongke Yungu Technology Co Ltd
Current assignee: Zhongke Yungu Technology Co Ltd
Priority date: 2024-06-04
Filing date: 2024-06-04
Publication date: 2024-07-02

Abstract

The embodiment of the application provides a bottleneck process-based production scheduling method, a bottleneck process-based production scheduling device and a storage medium. The method comprises the following steps: acquiring a plurality of orders to be scheduled; determining a first earliest start time of a bottleneck process of each workpiece in each product according to the product parameters of each product in the plurality of to-be-scheduled orders; determining an available time period of processing equipment capable of processing bottleneck processes according to the bottleneck processes of each workpiece in each product; determining the optimal start-up time of the bottleneck process based on the available time period of processing equipment capable of processing the bottleneck process, the first earliest start-up time of the bottleneck process and preset production constraint conditions; and determining the working procedure starting time of each key working procedure in the key process working procedures of each workpiece except the bottleneck working procedure according to the optimal starting time of the bottleneck working procedure of each workpiece in each product, and discharging the bottleneck working procedure and then discharging the non-bottleneck working procedure, so that the production is more reasonable.

Description

Bottleneck procedure-based scheduling method, device and storage medium

Technical Field

The application relates to the technical field of industrial manufacturing, in particular to a bottleneck process-based production scheduling method, a bottleneck process-based production scheduling device and a storage medium.

Background

In conventional manufacturing, production process scheduling plans are typically manually formulated based on experience and rules. Manual scheduling has certain advantages in small-scale production, simple production flow and fewer production orders. However, when facing complex and large-scale production environments, if the production is still manually performed in sequence of the working procedures, the production process is long in time consumption, the production efficiency is low, the production process is easily affected by subjective factors, the reliability of the production scheme is low, the production efficiency of subsequent products is possibly low, and the productivity of the production line where the products are located is reduced.

Disclosure of Invention

The embodiment of the application aims to provide a bottleneck process-based production scheduling method, a bottleneck process-based production scheduling device and a storage medium, which are used for solving the problem of unreasonable production scheduling in the prior art.

In order to achieve the above object, a first aspect of the present application provides a bottleneck process-based scheduling method, including:

acquiring a plurality of orders to be scheduled;

Determining a first earliest start time of a bottleneck process of each workpiece in each product according to the product parameters of each product in the plurality of to-be-scheduled orders;

determining processing equipment capable of processing bottleneck processes and available time periods of the processing equipment aiming at the bottleneck processes of each workpiece in each product;

for each bottleneck process of each workpiece in each product, scheduling the bottleneck process based on the available time period of processing equipment capable of processing the bottleneck process, the first earliest start time of the bottleneck process and preset scheduling constraint conditions to determine the optimal start time of the bottleneck process;

And (3) scheduling each key process except the bottleneck process in the key process of each workpiece according to the optimal start time of the bottleneck process of each workpiece in each product so as to obtain the process start time of each key process.

In the embodiment of the present application, the preset scheduling constraint conditions include a workpiece scheduling order constraint condition, a workpiece processing frequency constraint condition, a processing equipment load constraint condition, a capacity constraint condition of a production line where each product is located, a first constraint condition corresponding to a start time of a key process procedure, a bottleneck procedure constraint condition, a second constraint condition corresponding to a finishing time of the key process procedure, and a priority constraint condition of a plurality of to-be-scheduled orders, and the scheduling method further includes: before the bottleneck process of each workpiece in each product is scheduled, a workpiece scheduling sequence constraint condition is constructed based on the processing sequence and processing equipment of each workpiece; constructing a workpiece machining number constraint condition based on a total number of times each workpiece is machined on all machining equipment capable of machining each workpiece; constructing a processing equipment load constraint condition based on the working time of each processing equipment and the time of key process procedures of all the workpieces required to be processed by each processing equipment; constructing capacity constraint conditions based on daily capacity load of a production line where each product is located and planned machining quantity of each product; constructing a first constraint condition based on a finishing time of a key process of each workpiece, a duration of the key process of each workpiece processed by each processing device, and a first earliest start time of a bottleneck process of each workpiece; constructing bottleneck process constraints based on the delivery time of each workpiece and the finish time of the bottleneck process of each workpiece; constructing a second constraint condition based on the duration of the key process steps of each processing device for finishing all the workpieces to be processed and the latest finishing time in the finishing time of all the workpieces; priority constraints are constructed based on the order priority and product priority of each to-be-placed order.

In the embodiment of the application, the workpiece production sequence constraint condition is defined by the expression (1):

Expression (1)

Wherein p andAll refer to workpieces, k refers to processing equipment,It means that the workpiece p is machined on the machining device k,0 Means that the workpiece p is not being processed on the processing device k,=1 Means that the workpiece p precedes the workpieceThe processing is carried out,By 0 is meant that the workpiece p is later than the workpieceAnd (5) processing.

In the embodiment of the application, the workpiece processing number constraint condition is defined by the expression (2):

expression (2)

Wherein P is the workpiece, P is the workpiece included in all products,Refers to any workpiece, and the like,Refers to the total number of times the workpiece p is machined on all machining equipment that can machine the workpiece p,Refers to all processing equipment that can process the workpiece p,Refers to the number of times the workpiece p is machined on the jth machining apparatus that can machine the workpiece p.

In the embodiment of the present application, the processing equipment load constraint condition is defined by expression (3):

Expression (3)

Wherein K is the processing equipment, K is the processing equipment required by processing all workpieces,Refers to any processing equipment which is used for processing the steel,Refers to the operating time of the processing device k,Refers to the duration of the key process steps of the processing equipment k for finishing all the workpieces to be processed,Refers to the processing of a workpiece by a processing device kIs a key process step required for the processing time,Refers to all workpieces processed on the processing apparatus k.

In the embodiment of the present application, the capacity constraint is defined by expression (4):

Expression (4)

Wherein M is a product parameter of a product, M is a product parameter of all products,Representing the product parameters of any one of the products,Refers to the workpiece number of a product with a product parameter of m,Is daily capacity load of a production line where a product with a product parameter of m is located,Refers to the number of times the workpiece of the product with the ith product parameter of m is processed on all processing equipment,Refers to the planned machining quantity of the whole product with the product parameter m,Refers to the number of times the ith product parameter, m, is processed on the jth processing apparatus.

In the embodiment of the present application, the first constraint corresponding to the start time of the critical process step is defined by expression (5) and expression (6):

Expression (5)

Expression (6)

Wherein,The finishing time for the critical process steps of the workpiece p,The first earliest start-up time for the bottleneck process of the workpiece p,Refers to the processing of a workpiece by a processing device kThe processing time of the key process procedure of (2),，Refers to the processing equipment k processing the workpieceA collection of workpieces that have been previously processed,Refers to the duration of the critical process steps for the machining device k to machine the workpiece p,Refers to the start-up time of the workpiece p.

In the embodiment of the present application, the bottleneck process constraint is defined by expression (7):

Expression (7)

Wherein,Is used for setting the index coefficient to be the preset index coefficient,Refers to a workpieceIs used for the delivery time of (a),Is a workpieceThe time required for the finish of the bottleneck process,Refers to a workpieceIs the time of the subtraction of the workpieceThe difference between the delivery time of the (c) and the completion time of the corresponding bottleneck process,Refers to the sum of the time of the cross-over of all the workpieces, and P refers to the workpieces included in all the products.

In the embodiment of the present application, the second constraint corresponding to the completion time of the critical process step is defined by expression (8):

Expression (8)

Wherein,Refers to the latest finishing time among finishing times of all the workpieces,Refers to the duration of the key process steps of the processing equipment k for finishing all the workpieces to be processed,Refers to the processing of a workpiece by a processing device kThe processing time of the key process procedure of (2),，Refers to all workpieces processed on the processing apparatus k.

In the embodiment of the present application, the priority constraint is defined by expression (9):

Expression (9)

Wherein,For the preset evaluation coefficient, the method comprises the following steps of,Refers to the workpiece with higher priority on the processing equipment kThe high aggregate of the work pieces,Refers to a workpieceIs added to the finish time of the bottleneck process,Refers to a workpiece with a same processing equipmentIs higher in priority of work pieceIs used for the completion time of the (c) process,Refers to a workpieceIs equal to the finishing time of a workpiece on the same processing equipmentIs higher in priority of work pieceIs used to determine the difference between the finishing times of (c),Refers to the priority rating value of all the workpieces.

In the embodiment of the application, the production scheduling of each key process except the bottleneck process in the key process of each workpiece according to the optimal start-up time of the bottleneck process of each workpiece in each product to obtain the process start-up time of each key process comprises the following steps: determining, for each bottleneck process of the workpiece, a reverse order corresponding to a processing order of all the critical processes preceding the bottleneck process as a first production order for all the critical processes preceding the bottleneck process; scheduling all key processes before the bottleneck process of each workpiece according to the first scheduling sequence and the optimal start time to obtain the process start time of each key process before the bottleneck process; determining, for each bottleneck process of the workpiece, a reverse order corresponding to a processing order of all the critical processes after the bottleneck process as a second production order for all the critical processes after the bottleneck process; and carrying out production scheduling on all key processes after the bottleneck process of each workpiece according to the second production scheduling sequence and the optimal start time so as to obtain the process start time of each key process after the bottleneck process.

In an embodiment of the present application, determining a first earliest start time of a bottleneck process for each workpiece in each product according to product parameters of each product in a plurality of to-be-scheduled orders includes: determining key process procedures of each workpiece in each product according to product parameters of each product in a plurality of to-be-scheduled orders, wherein the key process procedures comprise bottleneck procedures; determining a process processing period between an initial process of each product and a bottleneck process of each workpiece in each product, and determining a second earliest start time from the start times of all the initial processes; and determining the first earliest start time of the bottleneck process of each workpiece in each product according to the second earliest start time and the process processing period of each workpiece in each product.

The second aspect of the present application provides a bottleneck process-based scheduling apparatus, comprising:

a memory configured to store instructions; and

And a processor configured to call instructions from the memory and to enable the bottleneck-process-based scheduling method described above when executing the instructions.

A third aspect of the application provides a machine-readable storage medium having instructions stored thereon that, when executed by a processor, cause the processor to be configured to perform the bottleneck-process-based scheduling method described above.

According to the technical scheme, the first earliest starting time of the bottleneck process of each workpiece in each product, the processing equipment capable of processing the bottleneck process and the available time of the processing equipment are determined, the bottleneck process is scheduled based on the available time of the processing equipment capable of processing the bottleneck process, the first earliest starting time of the bottleneck process and preset scheduling constraint conditions, so that the optimal starting time of the bottleneck process is determined, each key process except the bottleneck process in the key process of each workpiece is scheduled according to the optimal starting time of the bottleneck process of each workpiece in each product, the process starting time of each key process is obtained, the time cost required by manual scheduling is reduced, the scheduling efficiency is improved, and the non-bottleneck process is scheduled after the bottleneck process is scheduled, so that the scheduling is more reasonable.

Additional features and advantages of embodiments of the application will be set forth in the detailed description which follows.

Drawings

The accompanying drawings are included to provide a further understanding of embodiments of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain, without limitation, the embodiments of the application. In the drawings:

FIG. 1 schematically illustrates a flow diagram of a bottleneck process-based scheduling method in accordance with an embodiment of the application;

fig. 2 schematically shows an internal structural view of a computer device according to an embodiment of the present application.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it should be understood that the detailed description described herein is merely for illustrating and explaining the embodiments of the present application, and is not intended to limit the embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.

If there is a description of "first", "second", etc. in an embodiment of the present application, the description of "first", "second", etc. is for descriptive purposes only and is not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In addition, the technical solutions of the embodiments may be combined with each other, but it is necessary to base that the technical solutions can be realized by those skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be considered to be absent and not within the scope of protection claimed in the present application.

Fig. 1 schematically shows a flow diagram of a bottleneck process-based scheduling method according to an embodiment of the application. As shown in fig. 1, in an embodiment of the present application, a bottleneck process-based production scheduling method is provided, which includes the following steps:

step 101: and acquiring a plurality of to-be-scheduled production orders.

The order to be placed includes products of different product parameters. The product parameters include a product model and a product specification. For example, 100 large excavators of model A may be included in order D1 to be placed, and 100 small excavators of model B may be included in order D2 to be placed. The processor may obtain a plurality of to-be-scheduled orders.

In the embodiment of the application, acquiring a plurality of to-be-scheduled orders comprises: acquiring a plurality of orders, wherein each order corresponds to a sequence number; screening the orders, and if products of the same model exist in the orders, namely products with the same product parameters, screening the orders with smaller sequence numbers as the orders corresponding to the model to obtain a plurality of orders to be produced.

Step 102: and determining the first earliest start time of the bottleneck process of each workpiece in each product according to the product parameters of each product in the plurality of to-be-scheduled orders.

The processor may determine a first earliest start time for a bottleneck process for each workpiece in each product based on product parameters for each product in the plurality of to-be-scheduled orders. The product parameters of the products corresponding to any two to-be-scheduled orders can be the same or different.

The processor may determine bottleneck processes that include critical process steps for each workpiece in each product based on product parameters for each product. Specifically, for each product, the processor may match the process information data for each workpiece of the product according to the product parameters of the product. The process information data comprises the process sequence, the dependency relationship, the material requirement and the like of the workpiece. The processor may determine key process steps for each workpiece in the product based on the process information data for each workpiece. The key process steps include a bottleneck step, which is a key process step for limiting the overall productivity or efficiency of the product in the production process of the product. The processing speed or resource supply capacity of the bottleneck process is much lower than other critical process steps, thereby limiting the speed and throughput of the overall product production process.

The processor may determine a process cycle between an initial process for each product and a bottleneck process for each workpiece in each product, and may determine a second earliest start time from the start times of all of the initial processes. The processor may then determine a first earliest start time for the bottleneck process for each workpiece in each product based on the second earliest start time and the process cycle for each workpiece in each product. Specifically, the processor may determine a sum of the second earliest start time and the process cycle of each workpiece as the first earliest start time of the bottleneck process of each workpiece.

Step 103: for each bottleneck process of each workpiece in each product, a processing apparatus and a usable time period of the processing apparatus for processing the bottleneck process are determined.

Step 104: and aiming at the bottleneck process of each workpiece in each product, scheduling the bottleneck process based on the available time period of processing equipment capable of processing the bottleneck process, the first earliest start time of the bottleneck process and preset scheduling constraint conditions so as to determine the optimal start time of the bottleneck process.

For each bottleneck process of each workpiece in each product, the processor may determine processing equipment and a usable time period of the processing equipment that can process the bottleneck process. For each bottleneck process of each workpiece in each product, the processor may schedule the bottleneck process based on an available time period of a processing apparatus that can process the bottleneck process, a first earliest start time of the bottleneck process, and a preset scheduling constraint to determine an optimal start time of the bottleneck process. Specifically, the processor may determine an optimal start time of the bottleneck process for each workpiece based on a preset algorithm and according to an available time period of the processing equipment capable of processing the bottleneck process, a first earliest start time of the bottleneck process, and a preset scheduling constraint. The preset algorithm comprises a branch delimitation method, a cutting plane method and a heuristic algorithm.

The processor may construct workpiece scheduling sequence constraints based on the processing sequence and processing equipment of each workpiece prior to scheduling the bottleneck process for each workpiece in each product. In the embodiment of the application, the workpiece production sequence constraint condition is defined by the expression (1):

Expression (1)

The processor may construct the workpiece processing number constraint based on a total number of times each workpiece is processed on all processing equipment that can process each workpiece. The workpiece processing number constraint condition is used to constrain processing of a processed workpiece on a processing apparatus, and the processing apparatus can process the workpiece. In the embodiment of the application, the workpiece processing number constraint condition is defined by the expression (2):

expression (2)

If the total number of times of processing the workpiece p on all the processing apparatuses that can process the workpiece p is less than 1, it can be determined that the processed workpiece p is not processed. If the total number of times the workpiece p is machined on all the machining apparatuses that can machine the workpiece p is equal to 1, it can be determined that the machined workpiece p has been machined.

The processor may construct the processing tool load constraints based on the operating time of each processing tool and the time of the critical process sequence for each processing tool to complete all of the workpieces to be processed. The processing equipment load constraint condition is used for constraining the load capacity of the processing equipment, namely the load capacity of the processing equipment is longer than the processing time of the key process procedures of all the processed workpieces processed by the processing equipment. In the embodiment of the present application, the processing equipment load constraint condition is defined by expression (3):

Expression (3)

Wherein K is the processing equipment, K is the processing equipment required by processing all workpieces,Refers to any processing equipment which is used for processing the steel,Refers to the operating time of the processing device k,Refers to the duration of the key process steps of the processing equipment k for finishing all the workpieces to be processed,Refers to the processing of a workpiece by a processing device kIs a key process step required for the processing time,Refers to all workpieces processed on the processing apparatus k.Refers to the h-th workpiece to be machined on the machining device k.

In the embodiment of the application, the processing time length of the key process procedure of each workpiece required to be processed by the processing equipment can be determined for any processing equipment. Thereafter, a sum of processing durations of key process steps of the processing apparatus for processing each workpiece to be processed may be determined. And then, acquiring the working time length of the processing equipment, namely the starting-up operation time length of the processing equipment. When the production is performed based on the load constraint condition of the processing equipment, the working time of the processing equipment can be longer than or equal to the sum of the processing time of the key process procedures of each workpiece required to be processed by the processing equipment, namely the load of the processing equipment can meet the processing requirements of all the workpieces required to be processed by the processing equipment during the production.

The processor may construct capacity constraints for each product line based on daily capacity loads of each product line and the projected number of processes for each product. The capacity constraint conditions are used for constraining the production capacity of the product with any product parameters to meet the capacity load requirement of the corresponding production line. In the embodiment of the present application, the capacity constraint is defined by expression (4):

Expression (4)

In the embodiment of the application, for each workpiece of a product (i.e., any machine type) with any one product parameter, the machining times of the workpiece on all machining devices can be determined, the total machining times of all the workpiece on all the machining devices can be determined, and then the total number of required machining of the product with the product parameter can be determined according to the total machining times. When the production scheduling is performed based on the productivity constraint condition, the total number of required processing of the products with the product parameters is smaller than or equal to the daily productivity load of the production line where the products with the product parameters are located, namely, when the production scheduling is performed, the total number of processing of each product needs to be enabled to meet the productivity load requirement of the production line where the products with the product parameters are located.

The processor may construct a first constraint corresponding to a start time of the critical process sequence for each workpiece based on a finish time of the critical process sequence for each workpiece, a duration of the critical process sequence for each processing tool to process each workpiece, and a first earliest start time of the bottleneck sequence for each workpiece. In the embodiment of the present application, the first constraint corresponding to the start time of the critical process step is defined by expression (5) and expression (6):

Expression (5)

Expression (6)

Wherein,The finishing time for the critical process steps of the workpiece p,The first earliest start-up time for the bottleneck process of the workpiece p,Refers to the processing of a workpiece by a processing device kThe processing time of the key process procedure of (2),，Refers to the processing equipment k processing the workpieceA collection of workpieces that have been previously processed,Refers to the duration of the critical process steps for the machining device k to machine the workpiece p,Refers to the start-up time of the workpiece p. Machining work pieceRefers to the g-th workpiece that has been processed on the processing apparatus k before the workpiece p is processed.The starting time of the key process of the workpiece p needs to be after the productivity factors are satisfied.

In the embodiment of the application, for any one workpiece, the duration of the key process of each processed workpiece arranged in front of the workpiece on processing equipment can be obtained, the sum of the durations of the key process of each processed workpiece arranged in front of the workpiece is determined, and then the sum and the duration of the key process of the workpiece are determined as the finishing time of the key process of the workpiece. Then, a difference between the duration of the critical process for machining the workpiece and the completion time of the critical process for machining the workpiece is determined, wherein the difference is the start time of the critical process for machining the workpiece. When the production scheduling is performed based on the first constraint condition corresponding to the starting time of the key process, the starting time of the key process of the workpiece is enabled to be later than the first earliest starting time of the bottleneck process of the workpiece, namely, after the productivity factors such as materials, manpower, processing equipment and the like required by the bottleneck process of the workpiece are in place, the workpiece can be started to be processed.

The processor may construct bottleneck process constraints based on the delivery time of each workpiece and the completion time of the bottleneck process for each workpiece. The bottleneck process constraint is used to constrain the bottleneck process of the work piece with an early lead time to finish as early as possible. In the embodiment of the present application, the bottleneck process constraint is defined by expression (7):

Expression (7)

Wherein,Is used for setting the index coefficient to be the preset index coefficient,Refers to a workpieceIs used for the delivery time of (a),Is a workpieceThe time required for the finish of the bottleneck process,Refers to a workpieceIs the time of the subtraction of the workpieceThe difference between the delivery time of the (c) and the completion time of the corresponding bottleneck process,Refers to the sum of the time of the cross-over of all the workpieces, and P refers to the workpieces included in all the products. Preset index coefficientThe numerical value of the numerical value is larger and better, and the numerical value can be preset in advance according to the requirement.

In the embodiment of the application, the delivery time of the workpiece is obtained for any one workpiece, the finishing time of the bottleneck process of the workpiece is obtained, and then the difference between the delivery time of the workpiece and the finishing time of the bottleneck process of the workpiece can be determined, and the sum of the differences between the delivery times of all the workpieces and the finishing time of the bottleneck process of the workpiece can be determined. When the production scheduling is performed based on the bottleneck process constraint conditions, the finish time of the bottleneck process of each workpiece can be adjusted to adjust the sum of the differences between the delivery time of all the workpieces and the finish time of the bottleneck process of the workpiece, so that the finish time of the bottleneck process of each workpiece corresponding to the largest sum of the differences is selected, and the bottleneck process of the workpiece with the early delivery time can be completed as soon as possible.

The processor may construct a second constraint corresponding to a finishing time of the critical process steps based on a duration of the critical process step for each processing apparatus to finish all of the workpieces to be processed and a latest finishing time of finishing times of all of the workpieces. The second constraint condition is used for constraining the key process to be completed as soon as possible and balancing the division of work of each processing device. In the embodiment of the present application, the second constraint corresponding to the completion time of the critical process step is defined by expression (8):

Expression (8)

Wherein,Refers to the latest finishing time among finishing times of all the workpieces,Refers to the duration of the key process steps of the processing equipment k for finishing all the workpieces to be processed,Refers to the processing of a workpiece by a processing device kThe processing time of the key process procedure of (2),，Refers to all workpieces processed on the processing apparatus k. Machining work pieceRefers to the h-th workpiece to be machined on the machining device k.

In the embodiment of the application, the processing time length of the key process procedure of each workpiece required to be processed by the processing equipment can be determined for any processing equipment. Thereafter, a sum of processing durations of key process steps of the processing apparatus for processing each workpiece to be processed may be determined. When the scheduling is performed based on the second constraint condition corresponding to the finishing time of the key process procedure, a processing device corresponding to the maximum value of the sum of the processing time durations of each processing device can be selected, the finishing time of the selected processing device is taken as the latest finishing time in the finishing time of all the workpieces, and then the finishing time after each processing device finishes all the workpieces to be processed can be adjusted according to the latest finishing time, so that the latest finishing time in the finishing time of all the workpieces is adjusted, the key process procedure of each workpiece can be finished early, and the processing devices are balanced in division. The processor may construct a priority constraint for a plurality of orders to be placed based on the order priority and the product priority of each order to be placed.

Expression (9)

Wherein,For the preset evaluation coefficient, the method comprises the following steps of,Refers to the workpiece with higher priority on the processing equipment kThe high aggregate of the work pieces,Refers to a workpieceIs added to the finish time of the bottleneck process,Refers to a workpiece with a same processing equipmentIs higher in priority of work pieceIs used for the completion time of the (c) process,Refers to a workpieceIs equal to the finishing time of a workpiece on the same processing equipmentIs higher in priority of work pieceIs used to determine the difference between the finishing times of (c),Refers to the priority rating value of all the workpieces. Preset evaluation coefficientCan be set in advance according to the requirement, and the larger the data is, the better the data is. If it isIf the value of (2) is greater than 0, then the workpiece can be determinedAndFollow priority scheduling, ifIf the value of (2) is less than 0, then the workpiece can be determinedAndPriority scheduling is not followed.

In the embodiment of the application, for each workpiece, the finish time of the bottleneck process of the workpiece and the finish time of the workpiece with the processing priority before the workpiece are obtained, then, the difference between the finish time of the bottleneck process of the workpiece and the finish time of the workpiece with each processing priority before the workpiece can be determined, and the sum of all the differences corresponding to the workpiece is determined. Then, a sum of the sum of all the differences for each workpiece may be determined. When the scheduling is performed based on the priority constraint condition, the finishing time of the bottleneck process of each workpiece can be adjusted to adjust the sum of all the differences of each workpiece, so that the sum of all the differences of each workpiece is adjusted, the sum of all the differences of each workpiece is maximized, and the scheduling meets the order priority and the product model priority.

Step 105: and (3) scheduling each key process except the bottleneck process in the key process of each workpiece according to the optimal start time of the bottleneck process of each workpiece in each product so as to obtain the process start time of each key process.

The processor can schedule each key process except the bottleneck process in the key process of each workpiece according to the optimal start time of the bottleneck process of each workpiece in each product so as to obtain the process start time of each key process.

For each of the bottleneck processes of the workpiece, the processor may determine a reverse order corresponding to a processing order of all of the critical processes preceding the bottleneck process as a first production order for all of the critical processes preceding the bottleneck process. And then, the processor can schedule all key processes before the bottleneck process of each workpiece according to the first scheduling sequence and the optimal start time so as to obtain the process start time of each key process before the bottleneck process. For example, if the bottleneck process of a certain workpiece is S4, when the processes S1 to S3 of the workpiece are performed, the process S3 may be performed first, then the process S2 may be performed, and finally the process S1 may be performed. Specifically, when the production scheduling is performed for each process before the bottleneck process, corresponding processing equipment can be matched on the production line for each process before the bottleneck process, and the production scheduling can be performed for each process before the bottleneck process according to the available time period of the processing equipment and the optimal start time of the bottleneck process of the workpiece. For example, when the process S2 is scheduled, the process S2 may be scheduled based on the optimal start-up time of the bottleneck process S4, the process start-up time of the process S3, and the available time period of the processing equipment for the process S2.

For the bottleneck process of each workpiece, the processor may determine a reverse order corresponding to a processing order of all the critical processes after the bottleneck process as a second production order for all the critical processes after the bottleneck process. And then, the processor can carry out production scheduling on all key processes after the bottleneck process of each workpiece according to the second production order and the optimal start time so as to obtain the process start time of each key process after the bottleneck process. For example, if the bottleneck process of a certain workpiece is S4, when the processes S5 to S7 of the workpiece are performed, the process may be performed first for the process S5, then for the process S6, and finally for the process S7. Specifically, when the production scheduling is performed for each process after the bottleneck process, corresponding processing equipment may be matched on the production line for each process after the bottleneck process, and the production scheduling may be performed for each process after the bottleneck process according to the available time period of the processing equipment and the optimal start time of the bottleneck process of the workpiece. For example, when the process S6 is scheduled, the process S6 may be scheduled based on the optimal start-up time of the bottleneck process S4, the process start-up time of the process S5, and the available time period of the processing equipment for the process S6.

In the embodiment of the application, after the bottleneck process is scheduled, the rest processes on the process path can be scheduled, the former process of the bottleneck process adopts reverse scheduling, and the latter process of the bottleneck process adopts forward scheduling. Specifically, the time interval selected by the order may be determined based on the earliest start time and latest delivery time of the order information, and the available time period on the production line may be calculated based on the attendance data and the processing equipment information data, converted to absolute time using a codec. And then, reversely producing the previous process of the bottle neck process: the process path topology graph can be established according to the production date and time of the bottleneck procedure in the order information data and the product model matching process information data. The process path topology is a graphical representation in which individual elements (nodes) are connected to one another by connecting lines (edges). In the process path topology, nodes represent different manufacturing processes, while edges represent associations between these processes. By combining the nodes and edges together, the structure of the process flow and the sequencing of each process can be presented. And then, adding order processing information as graph attributes, performing iterative reverse pushing through graph searching, matching available time periods, decomposing the previous process of the bottleneck process to different processing equipment, and finally determining the processing date and time of the previous process of the bottleneck process. The post-process forward production of the bottleneck process: on the established process path topological graph, the post-process of the bottleneck process is decomposed into different processing equipment by carrying out backward graph searching, iterating forward pushing and matching with the available time period based on the bottleneck process, and finally, the processing date and time of the post-process of the bottleneck process are determined.

In the embodiment of the application, after the working procedure starting time of each key working procedure is determined, if conditions such as order change, processing equipment fault or maintenance, material supply problem, manpower resource problem, emergency order and the like occur, the working procedure starting time of each key working procedure can be adjusted through review, and the production of each key working procedure can be resumed through adjusting part of preset production constraint conditions.

In one embodiment, the bottleneck process may be determined based on the bottleneck process schedule. Specifically, it may be checked whether the bottleneck process input is empty. If the input of the bottleneck process is not empty, the bottleneck process may be determined. If the input of the bottleneck process is empty, a configuration parameter analysis module can be called to acquire order information data and process information data. The bottleneck analysis module may then be invoked to determine a bottleneck process from the received order information data and process information data.

After determining the bottleneck process, a start time of the bottleneck process may be determined. And then, the bottleneck process can be preferentially scheduled based on the conditions of order priority, product model priority, factory daily capacity load, machine type daily capacity load, factory machine type constraint and the like, so that the scheduling result of the bottleneck process accords with the actual production condition. Specifically, the date and time of the bottleneck process of each order may be determined according to the bottleneck process parameter, the schedule start time parameter, the order information data, the process information data, the processing equipment information data, and the attendance data. The bottleneck process parameters comprise the identification and the name of the bottleneck process and the average processing time of the bottleneck process. The schedule start time parameters include start time and end time of a process, priority of a process, or planned completion date. The order information data includes an identification and number of the customer order or production order, an order quantity, a delivery date, or a delivery deadline. The process information data includes sequence of processes, dependencies, and material requirements. The process equipment information data includes identification and number of production process equipment, process equipment status, process equipment capacity and efficiency parameters, availability of process equipment and downtime. The attendance data includes the attendance schedule of the producer and staff work shift and shift information.

After the bottleneck process is finished, the non-bottleneck process can be finished. Specifically, the date and time of the production of each process on each order process path can be determined according to the order information data, the process information data, the processing equipment information data and the attendance data of the production of the bottleneck process. And then judging whether the production results of the non-bottleneck process reach the standard. If the scheduling result of the non-bottleneck process does not reach the standard, the scheduling constraint parameters can be readjusted, and scheduling can be repeated. And if the scheduling result for the non-bottleneck process reaches the standard, determining that the scheduling is finished.

Fig. 1 is a flow chart of a bottleneck process-based scheduling method in an embodiment. It should be understood that, although the steps in the flowchart of fig. 1 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 1 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, or the order in which the sub-steps or stages are performed is not necessarily sequential, but may be performed in rotation or alternatively with at least a portion of the other steps or other steps.

In one embodiment, there is provided a bottleneck process-based scheduling apparatus including:

a memory configured to store instructions; and

In one embodiment, a storage medium is provided, on which a program is stored, which when executed by a processor, implements the bottleneck process-based scheduling method described above.

In one embodiment, a processor is provided for running a program, where the program executes the bottleneck-process-based scheduling method described above.

In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in FIG. 2. The computer device includes a processor a01, a network interface a02, a memory (not shown) and a database (not shown) connected by a system bus. Wherein the processor a01 of the computer device is adapted to provide computing and control capabilities. The memory of the computer device includes internal memory a03 and nonvolatile storage medium a04. The nonvolatile storage medium a04 stores an operating system B01, a computer program B02, and a database (not shown in the figure). The internal memory a03 provides an environment for the operation of the operating system B01 and the computer program B02 in the nonvolatile storage medium a04. The database of the computer equipment is used for storing data such as the start-up time of each process in the key process processes. The network interface a02 of the computer device is used for communication with an external terminal through a network connection. The computer program B02, when executed by the processor a01, implements a bottleneck process-based scheduling method.

It will be appreciated by persons skilled in the art that the architecture shown in fig. 2 is merely a block diagram of some of the architecture relevant to the present inventive arrangements and is not limiting as to the computer device to which the present inventive arrangements are applicable, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.

The embodiment of the application provides equipment, which comprises a processor, a memory and a program stored in the memory and capable of running on the processor, wherein the processor realizes the following steps when executing the program: acquiring a plurality of orders to be scheduled; determining a first earliest start time of a bottleneck process of each workpiece in each product according to the product parameters of each product in the plurality of to-be-scheduled orders; determining processing equipment capable of processing bottleneck processes and available time periods of the processing equipment aiming at the bottleneck processes of each workpiece in each product; for each bottleneck process of each workpiece in each product, scheduling the bottleneck process based on the available time period of processing equipment capable of processing the bottleneck process, the first earliest start time of the bottleneck process and preset scheduling constraint conditions to determine the optimal start time of the bottleneck process; and (3) scheduling each key process except the bottleneck process in the key process of each workpiece according to the optimal start time of the bottleneck process of each workpiece in each product so as to obtain the process start time of each key process.

In one embodiment, the preset scheduling constraint conditions include a workpiece scheduling order constraint condition, a workpiece processing number constraint condition, a processing equipment load constraint condition, a capacity constraint condition of a production line where each product is located, a first constraint condition corresponding to a start time of a key process procedure, a bottleneck procedure constraint condition, a second constraint condition corresponding to a finish time of the key process procedure, and a priority constraint condition of a plurality of to-be-scheduled orders, and the scheduling method further includes: before the bottleneck process of each workpiece in each product is scheduled, a workpiece scheduling sequence constraint condition is constructed based on the processing sequence and processing equipment of each workpiece; constructing a workpiece machining number constraint condition based on a total number of times each workpiece is machined on all machining equipment capable of machining each workpiece; constructing a processing equipment load constraint condition based on the working time of each processing equipment and the time of key process procedures of all the workpieces required to be processed by each processing equipment; constructing capacity constraint conditions based on daily capacity load of a production line where each product is located and planned machining quantity of each product; constructing a first constraint condition based on a finishing time of a key process of each workpiece, a duration of the key process of each workpiece processed by each processing device, and a first earliest start time of a bottleneck process of each workpiece; constructing bottleneck process constraints based on the delivery time of each workpiece and the finish time of the bottleneck process of each workpiece; constructing a second constraint condition based on the duration of the key process steps of each processing device for finishing all the workpieces to be processed and the latest finishing time in the finishing time of all the workpieces; priority constraints are constructed based on the order priority and product priority of each to-be-placed order.

In one embodiment, the workpiece throughput sequence constraint is defined by expression (1):

Expression (1)

In one embodiment, the workpiece processing number constraint is defined by expression (2):

expression (2)

In one embodiment, the process equipment load constraints are defined by expression (3):

Expression (3)

In one embodiment, the capacity constraint is defined by expression (4):

Expression (4)

In one embodiment, the first constraint corresponding to the start time of the critical process sequence is defined by expression (5) and expression (6):

Expression (5)

Expression (6)

In one embodiment, bottleneck process constraints are defined by expression (7):

Expression (7)

In one embodiment, the second constraint corresponding to the completion time of the critical process sequence is defined by expression (8):

Expression (8)

In one embodiment, the priority constraint is defined by expression (9):

Expression (9)

In one embodiment, scheduling each of the critical process steps of each workpiece except the bottleneck step according to the optimal start time of the bottleneck step of each workpiece in each product to obtain the process start time of each critical step comprises: determining, for each bottleneck process of the workpiece, a reverse order corresponding to a processing order of all the critical processes preceding the bottleneck process as a first production order for all the critical processes preceding the bottleneck process; scheduling all key processes before the bottleneck process of each workpiece according to the first scheduling sequence and the optimal start time to obtain the process start time of each key process before the bottleneck process; determining, for each bottleneck process of the workpiece, a reverse order corresponding to a processing order of all the critical processes after the bottleneck process as a second production order for all the critical processes after the bottleneck process; and carrying out production scheduling on all key processes after the bottleneck process of each workpiece according to the second production scheduling sequence and the optimal start time so as to obtain the process start time of each key process after the bottleneck process.

In one embodiment, determining a first earliest start time for a bottleneck process for each workpiece in each product based on product parameters for each product in a plurality of to-be-scheduled orders comprises: determining key process procedures of each workpiece in each product according to product parameters of each product in a plurality of to-be-scheduled orders, wherein the key process procedures comprise bottleneck procedures; determining a process processing period between an initial process of each product and a bottleneck process of each workpiece in each product, and determining a second earliest start time from the start times of all the initial processes; and determining the first earliest start time of the bottleneck process of each workpiece in each product according to the second earliest start time and the process processing period of each workpiece in each product.

The application also provides a computer program product adapted to perform a program initialized with steps of a bottleneck-based scheduling method when executed on a data processing apparatus.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, etc., such as Read Only Memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.

Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises an element.

The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.

Claims

1. The scheduling method based on the bottleneck process is characterized by comprising the following steps of:

acquiring a plurality of orders to be scheduled;

Determining processing equipment capable of processing the bottleneck process and an available time period of the processing equipment for the bottleneck process of each workpiece in each product;

For each bottleneck process of each workpiece in each product, scheduling the bottleneck process based on an available time period of processing equipment capable of processing the bottleneck process, a first earliest start time of the bottleneck process and a preset scheduling constraint condition to determine an optimal start time of the bottleneck process;

And carrying out production scheduling on each key process except the bottleneck process in the key process of each workpiece according to the optimal start time of the bottleneck process of each workpiece in each product so as to obtain the process start time of each key process.

2. The bottleneck process-based scheduling method of claim 1, wherein the preset scheduling constraint includes a workpiece scheduling order constraint, a workpiece processing number constraint, a processing equipment load constraint, a capacity constraint of a production line in which each product is located, a first constraint corresponding to a start time of a critical process, a bottleneck process constraint, a second constraint corresponding to a finish time of the critical process, and a priority constraint of the plurality of orders to be scheduled, the scheduling method further comprising:

before the bottleneck process of each workpiece in each product is scheduled, constructing a constraint condition of the workpiece scheduling sequence based on the processing sequence and processing equipment of each workpiece;

Constructing the workpiece processing number constraint condition based on a total number of times each workpiece is processed on all processing apparatuses that can process each workpiece;

constructing a load constraint condition of each processing device based on the working time of each processing device and the time of key process procedures of all workpieces required to be processed by each processing device;

constructing the productivity constraint condition based on daily productivity load of a production line where each product is located and planned machining quantity of each product;

Constructing the first constraint condition based on the finishing time of the key process of each workpiece, the duration of the key process of each processing device for processing each workpiece and the first earliest start time of the bottleneck process of each workpiece;

Constructing the bottleneck process constraint based on the delivery time of each workpiece and the finish time of the bottleneck process of each workpiece;

constructing the second constraint condition based on the duration of the key process procedure of each processing device for finishing all the workpieces to be processed and the latest finishing time in the finishing time of all the workpieces;

The priority constraint is constructed based on the order priority and the product priority of each to-be-placed order.

3. The bottleneck-process-based scheduling method of claim 2, wherein the workpiece scheduling order constraint condition is defined by expression (1):

Expression (1)

4. The bottleneck-process-based scheduling method of claim 2, wherein the workpiece processing number constraint condition is defined by expression (2):

expression (2)

5. The bottleneck process-based scheduling method of claim 2, wherein the process equipment load constraint is defined by expression (3):

Expression (3)

6. The bottleneck-process-based scheduling method of claim 2, wherein the capacity constraint is defined by expression (4):

Expression (4)

7. The bottleneck-based production method of claim 2, wherein the first constraint corresponding to the start time of the critical process is defined by expression (5) and expression (6):

Expression (5)

Expression (6)

8. The bottleneck process-based scheduling method of claim 2, wherein the bottleneck process constraint is defined by expression (7):

Expression (7)

9. The bottleneck process-based scheduling method of claim 2, wherein the second constraint corresponding to the finishing time of the critical process is defined by expression (8):

Expression (8)

10. The bottleneck-process-based scheduling method of claim 2, wherein the priority constraint is defined by expression (9):

Expression (9)

11. The bottleneck process-based scheduling method of claim 1, wherein the scheduling each critical process except the bottleneck process according to the optimal start time of each bottleneck process of each workpiece in each product to obtain the process start time of each critical process comprises:

Determining, for each bottleneck process of each workpiece, a reverse order corresponding to a processing order of all critical processes preceding the bottleneck process as a first production order for all critical processes preceding the bottleneck process;

Performing production scheduling on all key processes before a bottleneck process of each workpiece according to the first production scheduling sequence and the optimal start time to obtain the process start time of each key process before the bottleneck process;

Determining, for each bottleneck process of the workpiece, a reverse order corresponding to a processing order of all critical processes after the bottleneck process as a second production order for all critical processes after the bottleneck process;

And carrying out production scheduling on all key processes after the bottleneck process of each workpiece according to the second production scheduling sequence and the optimal start time so as to obtain the process start time of each key process after the bottleneck process.

12. The bottleneck-process-based scheduling method of claim 1, wherein determining the first earliest start time of the bottleneck process for each workpiece in each product based on the product parameters for each product in the plurality of to-be-scheduled orders comprises:

Determining key process procedures of each workpiece in each product according to the product parameters of each product in the plurality of to-be-scheduled orders, wherein the key process procedures comprise bottleneck procedures;

determining a process processing period between an initial process of each product and a bottleneck process of each workpiece in each product, and determining a second earliest start time from the start times of all the initial processes;

And determining the first earliest start time of the bottleneck process of each workpiece in each product according to the second earliest start time and the process processing period of each workpiece in each product.

13. A bottleneck process-based scheduling device, characterized in that the scheduling device comprises:

a memory configured to store instructions; and

A processor configured to invoke the instructions from the memory and when executing the instructions is capable of implementing a bottleneck process based scheduling method according to any one of claims 1 to 12.

14. A machine-readable storage medium having stored thereon instructions for causing a machine to perform the bottleneck process-based production method of any one of claims 1 to 12.