CN111680877A

CN111680877A - Production line scheduling method and device, computer equipment and computer readable storage medium

Info

Publication number: CN111680877A
Application number: CN202010373284.4A
Authority: CN
Inventors: 董雁适; 黄子昊; 丁伟; 崔玉龙; 朱捷强; 蔡阳春
Original assignee: Hangzhou Chuanhua Intelligent Manufacturing Technology Co ltd
Current assignee: Hangzhou Ruijiang Technology Co.,Ltd.
Priority date: 2020-05-06
Filing date: 2020-05-06
Publication date: 2020-09-18

Abstract

The application relates to a production line scheduling method, a production line scheduling device, computer equipment and a computer-readable storage medium, wherein the production line scheduling method comprises the following steps: setting a production scheduling period of a product, wherein the production scheduling period is the total time for completing a plurality of working procedures when the product is produced; acquiring a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table comprises resource names, current quantity and target quantity; constructing a mixed integer programming model according to the work procedure table, the resource table and the production scheduling period; the mixed integer programming model includes an objective function having constraints; and solving the objective function to obtain a production line scheduling strategy. Through the method and the device, the problem that a production line scheduling strategy is unreasonable is solved.

Description

Production line scheduling method and device, computer equipment and computer readable storage medium

Technical Field

The present application relates to the field of automatic scheduling technologies, and in particular, to a method and an apparatus for scheduling a production line, a computer device, and a computer-readable storage medium.

Background

The production method has obvious production characteristics of multiple varieties, small batches and multiple batches in the fine chemical industry and the pharmaceutical industry, so the production mode of production according to the stock is generally adopted. The scheduling scheme in the production mode needs to reduce the inventory as much as possible, reduce the total energy consumption, evenly distribute the production tasks of each production line device and avoid the problem of overlarge load of a single production line device on the premise of meeting a certain service level. Therefore, aiming at the problems of short production scheduling period and large production scheduling workload, the computer algorithm is adopted to realize automatic production scheduling, and the method has obvious practical significance.

In the related technology, automatic production scheduling can be realized by using an automatic production scheduling algorithm based on heuristic rules, and the production scheduling method has the advantage of high production scheduling efficiency, but a mathematically optimal production scheduling scheme cannot be obtained, so that the production line scheduling strategy is not reasonable enough. In addition, some complex optimization objectives cannot be processed by adopting the scheduling method.

At present, no effective solution is provided for the problem of unreasonable production line scheduling strategy in the related art.

Disclosure of Invention

The embodiment of the application provides a production line scheduling method, a production line scheduling device, computer equipment and a computer readable storage medium, so as to at least solve the problem that a production line scheduling strategy is unreasonable in the related art.

In a first aspect, an embodiment of the present application provides a production line scheduling method, where the method includes:

setting a production scheduling period of a product, wherein the production scheduling period is the total time for completing a plurality of working procedures when the product is produced;

acquiring a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table comprises resource names, current quantity and target quantity;

constructing a mixed integer programming model according to the work procedure table, the resource table and the production scheduling period; the mixed integer programming model includes an objective function having constraints;

and solving the objective function to obtain a production line scheduling strategy.

In some embodiments, the constructing a mixed integer programming model according to the work process table, the resource table, and the production scheduling period includes:

acquiring the starting number of the working procedures corresponding to the same working procedure name according to the working procedure table;

setting a first constraint condition according to the starting number of the working procedures and the time for completing the working procedures;

updating the current quantity of each resource in the resource table according to the type of the resource required by each procedure and the quantity of the corresponding resource in the production process;

setting a second constraint condition according to the current quantity;

calculating the final quantity of each resource when the scheduling period is reached;

and determining the objective function according to the first constraint condition, the second constraint condition, the final quantity of each resource and the corresponding target quantity.

In some embodiments, the setting of the first constraint condition according to the number of starting processes and the time of completing the processes includes:

the number of starts of the process being equal to zero at the time of completion of the process is taken as the first constraint.

In some embodiments, said setting a second constraint according to said current number comprises:

and taking the current number greater than or equal to zero at any time in a scheduling period as the second constraint condition.

In some embodiments, the determining the objective function according to the first constraint, the second constraint, the final quantity of each resource, and the corresponding target quantity includes:

calculating the absolute value of the difference between the final quantity of each resource and the corresponding target quantity;

acquiring the weight of each resource;

and determining the objective function according to the absolute value of the difference, the weight, the first constraint condition and the second constraint condition.

In some embodiments, the obtaining the weight value of each resource includes:

and determining the weight of each resource according to the importance degree of the resource relative to the product.

In some of these embodiments, the method further comprises:

and dividing the resources belonging to the same resource name into resources in different states according to the process names.

In a second aspect, an embodiment of the present application provides a production line scheduling device, where the device includes:

the system comprises a setting module, a judging module and a control module, wherein the setting module is used for setting a production scheduling period of a product, and the production scheduling period is the total time length for completing a plurality of working procedures when the product is produced;

the acquisition module is used for acquiring a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table comprises resource names, current quantity and target quantity;

the modeling module is used for constructing a mixed integer programming model according to the work procedure table, the resource table and the production scheduling period; the mixed integer programming model includes an objective function having constraints;

and the calculation module is used for solving the objective function to obtain a production line scheduling strategy.

In a third aspect, an embodiment of the present application provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor, when executing the computer program, implements the production line scheduling method according to the first aspect.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the production line scheduling method according to the first aspect.

Compared with the related art, the production line scheduling method, the production line scheduling device, the computer equipment and the computer readable storage medium provided by the embodiment of the application have the advantages that the production scheduling period of the product is set, and the production scheduling period is the total time for completing a plurality of working procedures of the product; acquiring a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table comprises resource names, current quantity and target quantity; constructing a mixed integer programming model according to the work procedure table, the resource table and the production scheduling period; the mixed integer programming model includes an objective function having constraints; and solving the objective function to obtain a production line scheduling strategy, thereby solving the problem of unreasonable production line scheduling strategy.

The details of one or more embodiments of the application are set forth in the accompanying drawings and the description below to provide a more thorough understanding of the application.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:

fig. 1 is a flowchart of a production line scheduling method according to an embodiment of the present application;

FIG. 2 is a flow chart of a method for constructing a mixed integer programming model according to an embodiment of the present application;

FIG. 3 is a flow chart of determining an objective function in an embodiment of the present application;

fig. 4 is a flowchart of a production line scheduling method according to an embodiment of the present application;

fig. 5 is a block diagram of a production line scheduling device according to an embodiment of the present application;

fig. 6 is a schematic diagram of a hardware structure of the production line scheduling device according to the embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described and illustrated below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments provided in the present application without any inventive step are within the scope of protection of the present application.

It is obvious that the drawings in the following description are only examples or embodiments of the present application, and that it is also possible for a person skilled in the art to apply the present application to other similar contexts on the basis of these drawings without inventive effort. Moreover, it should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another.

Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the specification. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of ordinary skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments without conflict.

Unless defined otherwise, technical or scientific terms referred to herein shall have the ordinary meaning as understood by those of ordinary skill in the art to which this application belongs. Reference to "a," "an," "the," and similar words throughout this application are not to be construed as limiting in number, and may refer to the singular or the plural. The present application is directed to the use of the terms "including," "comprising," "having," and any variations thereof, which are intended to cover non-exclusive inclusions; for example, a process, method, system, article, or apparatus that comprises a list of steps or modules (elements) is not limited to the listed steps or elements, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. Reference to "connected," "coupled," and the like in this application is not intended to be limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The term "plurality" as referred to herein means two or more. "and/or" describes an association relationship of associated objects, meaning that three relationships may exist, for example, "A and/or B" may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. Reference herein to the terms "first," "second," "third," and the like, are merely to distinguish similar objects and do not denote a particular ordering for the objects.

The various technologies described in the present application can be applied to industries such as fine chemical engineering and medicine, but not limited to, and automatic production scheduling is realized.

The embodiment provides a production line scheduling method. Fig. 1 is a flowchart of a production line scheduling method according to an embodiment of the present application, and as shown in fig. 1, the process includes the following steps:

and step S110, setting a production scheduling period of the product, wherein the production scheduling period is the total time for completing a plurality of working procedures for producing the product.

The scheduling time unit can be determined firstly, and the scheduling period of the product is set according to the scheduling time unit. For example, 8 hours and one shift are set as a production scheduling time unit, a plurality of procedures required for completing production of a product are scheduled for at most 5 days, and if 3 shifts are scheduled for production every day, the production scheduling period of the product is 15 production scheduling time units.

Step S120, acquiring a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table includes a resource name, a current quantity, and a target quantity.

The process table and the resource table can be preset and updated according to the current production condition. The current production situation includes, but is not limited to, at least one of completion of a process, consumption of resources, and output of a product. And the process table and the resource table after the automatic update of the computer can also be directly obtained, and the application is not limited.

In some of these embodiments, the process names may be represented by corresponding process numbers, which may be, but are not limited to, at least one of letters, numbers, and characters. The resource type includes a name and a number of the resource, and the number of the resource may be, but is not limited to, at least one of a letter, a number, and a character. The present application will be described with reference to process numbers as examples.

The work order table is used for counting the types and the quantity of required resources for completing a plurality of working procedures for producing a certain product. The work order table may be expressed as:

c (I, j, t), I ═ 0.., I; j is 0,.. J formula (1)

Where I denotes a process number, J denotes a resource number, C (I, J, t) denotes the number of resources J required to complete the process I at time t, I denotes the total number of processes, and J denotes the total number of resources.

The types of resources include, but are not limited to, raw materials, equipment, and products, and the amount of resources includes, but is not limited to, consumption of raw materials, occupancy of production equipment, production volume of finished products, and release volume of production equipment.

The process table will be described with reference to table 1.

TABLE 1 work order table

Name of procedure	Time of day	Resource type	Amount of resources
				Semi-finished product 1	0	Kettle 1	-1
		Starting materials 1	-1
						Raw material 2	-1
	1	Semi-finished product 1	3
						Kettle 1	1
Semi-finished product 2	0	Kettle 2	-1
						Starting materials 1	-1
		Raw material 3	-1
					1	Semi-finished product 2	2
		Kettle 2	1
				Finished product 1	0	Kettle 1	-1
		Semi-finished product 1	-1
						Semi-finished product 2	-1
	1	Finished product 1	3
						Kettle 1	1

As shown in table 1, there is a semi-finished product manufacturing process 1. Its production cycle requires 1 unit of scheduling time. At start-up, i.e., at time 0, the occupancy of tank 1, the consumption of feed 1, and the consumption of feed 2 were all 1. After the production of the semifinished product 1 was completed, that is, at time 1, the amount of discharge of the pot 1 was 1 and the amount of production of the semifinished product 1 was 3. Here, time 0 represents an initial time, and time 1 represents a process completion time.

In some of these embodiments, the current number of resources includes the number of finished products, raw materials, production equipment, and personnel at each production start. The target quantity of resources includes the expected target quantity of finished products, raw materials, production equipment and personnel after the scheduling is finished.

It should be noted that the target quantity of the resource is not necessarily the actual quantity of the resource after the completion of the scheduling, and there may be a case where the actual quantity of the resource after the completion of the scheduling is the same as the target quantity, or there may be a case where the actual quantity of the resource after the completion of the scheduling is greater than or less than the target quantity. The difference between the actual quantity of the resources and the target quantity after the scheduling is finished is reduced as much as possible, and a better scheduling effect can be achieved.

The resource table is illustrated by taking table 2 as an example:

TABLE 2 resource Table

Resource name	Current number of	Target number
			Starting materials 1	10	2
Raw material 2	10	2
			Raw material 3	10	2
Semi-finished product 1	0	2
			Semi-finished product 2	0	2
Semi-finished product 3	0	2
			Finished product 1	0	6
Finished product 2	0	4
			Finished product 3	0	4
Kettle 1	2	2
			Kettle 2	1	1
Kettle 3	1	1

The resource table shown in table 2 includes the current and target quantities of raw materials, semi-finished products, kettles. Wherein, when the scheduling begins, the current quantity of the raw materials 1 is 10, and the target quantity after the scheduling is finished is 2.

Step S130, constructing a mixed integer planning model according to the work procedure table, the resource table and the production scheduling period; the mixed integer programming model includes an objective function having constraints.

And setting a target function and constraint conditions corresponding to the target function according to the work procedure table, the resource table and the scheduling period to obtain a mixed integer programming model. The scheduling problem can be converted into an optimization solving problem of an objective function by constructing a mixed integer programming model so as to obtain a mathematically optimal scheduling scheme, and further obtain a more reasonable production line scheduling strategy.

And step S140, solving the objective function to obtain a production line scheduling strategy.

Specifically, the objective function and the constraint condition thereof may be input to an MIP solver, and the objective function is solved to obtain a production line scheduling policy.

Setting a production scheduling period of the product through the steps S110 to S140, and acquiring a process table and a resource table; constructing a mixed integer programming model according to the work procedure table, the resource table and the production scheduling period; solving the objective function to obtain a production line scheduling strategy, solving the actual problem by constructing a mixed integer programming model, converting the production line scheduling problem into a mathematical problem, facilitating optimization solution, obtaining a more scientific and accurate production line scheduling strategy, and solving the problem that the production line scheduling strategy is unreasonable.

In some embodiments, fig. 2 is a flowchart of constructing a mixed integer programming model in the embodiments of the present application, and as shown in fig. 2, the flowchart includes the following steps:

and step S210, acquiring the starting number of the working procedures corresponding to the same working procedure name according to the working procedure table.

The number of the processes i started at the time t can be set to be x (i, t) ≧ 0, where x is a positive integer.

In step S220, a first constraint condition is set according to the number of starting processes and the time when the processes are completed.

Specifically, the first constraint condition may be set according to the number of starts of the process i at the time of completion of the process i. The first constraint is for constraining the number of starts of the process i at the time of completion of the process i.

In some of these embodiments, the first constraint is that the number of starts of a process at the time of completion of the process is equal to zero.

The number of starts of the process i at the time of completion of the process i may be set as:

x (i, T) ═ 0, T ═ p (i),.., T, equation (2)

Wherein p (i) represents the time when the process i is completed, T represents the production scheduling period, and x represents the number of starts.

As shown in equation (2), the number of starts per process is equal to zero at the time of completion of each process, which is within the scheduling period.

Step S230, updating the current amount of each resource in the resource table according to the type of the resource required for completing each process and the amount of the corresponding resource in the production process.

In some embodiments, the current number of resources j can be obtained by calculating the cumulative number of resources j required to complete process i in the production process:

where r (j, t) represents the current number of resources j at time t, S (j) represents the number of resources j before updating the resource table, C (i, j, l) represents the number of resources j required to complete process i at time l, and x (i, k) represents the number of processes initiated at time k.

As shown in equation (3), the current number of resources j at time t can be expressed as the product of the cumulative number of resources required for all processes started at time k from time k to time t and the starting number of processes i.

Step S240, a second constraint condition is set according to the current number.

In some embodiments, the second constraint is that the current number is greater than or equal to zero at any time during the scheduling period.

Specifically, the current number of each resource may be set to be greater than or equal to zero at any time within the scheduling period, as shown in equation (4):

r (J, t) is not less than 0, J is 0,. T is 0, a.t, formula (4)

Wherein r (J, T) represents the current number of the resource J at the time T, J represents the total number of the resource, and T represents the scheduling period.

Step S250, calculate the final amount of each resource when the scheduling period is reached.

The final quantity of each resource when the scheduling period is reached may be calculated according to the formula (5), or the final quantity of each resource when the scheduling period is reached may be directly obtained according to the updated resource table, which is not limited in the present application.

Where r (j, T) represents the final number of resources j when the scheduling period is reached, C (i, j, l) represents the number of resources j required to complete process i at time l, and x (i, T)₀) Is shown at an initial time t₀Number of starts of process i.

Step S260, determining an objective function according to the first constraint condition, the second constraint condition, the final quantity of each resource and the corresponding target quantity.

It is understood that the objective function with the first constraint and the second constraint is determined according to the difference between the final quantity of each resource and the corresponding target quantity.

Through the steps S210 to S260, the final quantity of each resource is obtained by setting and constructing the first constraint condition and the second constraint condition, the objective function is determined according to the first constraint condition, the second constraint condition, the final quantity of each resource and the corresponding target quantity, the mixed integer programming model is simply and quickly constructed, the actual scheduling scenarios of the mixed integer programming model are combined, the mixed integer programming model suitable for solving the scheduling problem of scheduling of.

In some embodiments, fig. 3 is a flowchart of determining an objective function in the embodiment of the present application, and as shown in fig. 3, the flowchart includes the following steps:

step S310, calculate the absolute value of the difference between the final quantity of each resource and the corresponding target quantity.

Specifically, the difference between the final quantity of each resource and the corresponding target quantity may be calculated, and then the absolute value of the difference may be calculated.

In step S320, a weight of each resource is obtained.

In some of these embodiments, the weight for each resource is determined based on the importance of the resource relative to the product.

Through the embodiment, the difference of the importance degree of each resource relative to the product is considered, the obtained weight of the resource is more accurate, and a more accurate target function is further obtained.

And step S330, determining an objective function according to the absolute value of the difference, the weight, the first constraint condition and the second constraint condition.

As shown in formula (6), calculating an absolute value of a difference between the final quantity of each resource and the corresponding target quantity, obtaining a weight of each resource, multiplying the absolute value corresponding to each resource by the weight, summing all the products, and calculating a minimum value to obtain a target function:

where r (j, T) represents the final number of resource j, E (j) represents the target number of resource j, and w (j) represents the weight of resource j.

It should be noted that the objective function, the first constraint condition, and the second constraint condition may be input to an MIP solver, and the objective function is solved to obtain an optimal x (i, t), so as to obtain a production line scheduling policy. The optimum x (i, t) represents the number of starting processes corresponding to the minimum objective function value.

Through the steps S310 to S330, the absolute value of the difference between the final quantity of each resource and the corresponding target quantity is calculated, and by obtaining the weight of each resource and multiplying the absolute value corresponding to each resource by the weight, the obtained objective function is more accurate, and the accuracy of the production line scheduling policy is further improved.

In some embodiments, resources belonging to the same resource name are divided into resources of different states according to process names.

Specifically, the resources belonging to the same resource name may be divided into a first resource and a second resource according to the process name, where the first resource is in the first state and the second resource is in the second state. The first resource may be converted to the second resource by executing a process corresponding to the process name.

Further, a preset time is required for completing the execution of the process corresponding to the process name, and if the preset time is less than or equal to the preset time threshold, the preset time can be ignored. Other resources may or may not be required to complete the process corresponding to the executed process name. For example, cleaning agents and cleaning personnel are required to complete the cleaning process.

This example will be further described with reference to the cleaning step of the reaction vessel.

A reaction kettle which produces a certain product can be used for producing other products after the cleaning procedure is finished. When the cleaning process is executed, the reaction kettle is divided into a reaction kettle needing to be cleaned and a reaction kettle which is cleaned completely according to the cleaning state of the reaction kettle. The reaction kettle which is cleaned completely is obtained by cleaning the reaction kettle which needs to be cleaned for a preset time. The resources required to complete the cleaning process include cleaning agents and cleaning personnel.

With the above-described embodiment, the resource belonging to the same resource name is divided into the first resource and the second resource in consideration of the state in which the resource is located. By considering the processing time from the second resource to the first resource, the resource division is combined with the actual scheduling scenario, so that the obtained mixed integer programming model is more accurate.

The embodiments of the present application are described and illustrated below by way of specific examples.

Fig. 4 is a flowchart of a production line scheduling method according to a specific embodiment of the present application, and as shown in fig. 4, the production line scheduling method includes the following steps:

step S401, setting a production scheduling period of the product, wherein the production scheduling period is the total time for completing a plurality of working procedures of the product.

Step S402, acquiring a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table includes a resource name, a current quantity, and a target quantity.

Step S403, acquiring the starting number of the processes corresponding to the same process name according to the process table; setting the starting number of the working procedures equal to zero at the time of finishing the working procedures as a first constraint condition; updating the current quantity of each resource in the resource table according to the type of the resource required by each procedure and the quantity of the corresponding resource in the production process; and taking the current number greater than or equal to zero at any time in the scheduling period as a second constraint condition.

Step S404, calculating the final quantity of each resource when the production scheduling period is reached; and determining an objective function according to the first constraint condition, the second constraint condition, the final quantity of each resource and the corresponding target quantity.

And S405, solving the objective function to obtain a production line scheduling strategy.

It should be noted that the steps illustrated in the above-described flow diagrams or in the flow diagrams of the figures may be performed in a computer system, such as a set of computer-executable instructions, and that, although a logical order is illustrated in the flow diagrams, in some cases, the steps illustrated or described may be performed in an order different than here. For example, with reference to fig. 2, the execution sequence of step S220 and step S240 may be interchanged, that is, step S220 may be executed first, and then step S240 may be executed; step S240 may be performed first, and then step S220 may be performed. For another example, in conjunction with fig. 3, the order of step S310 and step S320 may also be interchanged.

The present embodiment further provides a production line scheduling device, which is used to implement the foregoing embodiments and preferred embodiments, and the description of the production line scheduling device is omitted. As used hereinafter, the terms "module," "unit," "subunit," and the like may implement a combination of software and/or hardware for a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.

Fig. 5 is a block diagram of a structure of a production line scheduling device according to an embodiment of the present application, and as shown in fig. 5, the device includes:

the setting module 510 is configured to set a scheduling period of a product, where the scheduling period is a total duration of a plurality of processes performed on the product.

An obtaining module 520, configured to obtain a process table and a resource table; the work procedure table comprises a procedure name, and the type and the quantity of resources required for completing the procedure; the resource table includes a resource name, a current quantity, and a target quantity.

The modeling module 530 is used for constructing a mixed integer programming model according to the work procedure table, the resource table and the production scheduling period; the mixed integer programming model includes an objective function having constraints.

And the calculating module 540 is used for solving the objective function to obtain a production line scheduling strategy.

In some of these embodiments, the modeling module 530 includes a data acquisition subunit 531, a first constraint subunit 532, a data update subunit 533, a second constraint subunit 534, a data computation subunit 535, and a function determination subunit 536, where:

and a data obtaining subunit 531, configured to obtain, according to the work process table, the starting number of the work processes corresponding to the same work process name.

A first constraint subunit 532, configured to set a first constraint condition according to the number of starting processes and the time when the processes are completed.

The data updating subunit 533 is configured to update the current amount of each resource in the resource table according to the type of the resource required to complete each process and the amount of the corresponding resource in the production process.

And a second constraint subunit 534, configured to set a second constraint condition according to the current number.

A data computation subunit 535 for computing the final number of each resource up to the scheduling period.

A function determining subunit 536, configured to determine an objective function according to the first constraint, the second constraint, the final number of each resource, and the corresponding target number.

In some of these embodiments, the first constraint subunit 532 is further configured to set the number of starts of a process equal to zero at the time of completion of the process as the first constraint.

In some of these embodiments, the second constraint subunit 534 is further configured to use the current number as the second constraint condition when the current number is greater than or equal to zero at any time within the scheduling period.

In some of these embodiments, the function determining subunit 536 is further configured to calculate an absolute value of a difference between the final quantity of each resource and the corresponding target quantity; acquiring the weight of each resource; and determining the objective function according to the absolute value of the difference, the weight, the first constraint condition and the second constraint condition.

In some of these embodiments, the function determining subunit 536 is further configured to determine a weight for each resource according to the importance of the resource relative to the product.

The above modules may be functional modules or program modules, and may be implemented by software or hardware. For a module implemented by hardware, the modules may be located in the same processor; or the modules can be respectively positioned in different processors in any combination.

In addition, the production line scheduling method described in the embodiment of the present application and described with reference to fig. 1 may be implemented by a production line scheduling device. Fig. 6 is a schematic diagram of a hardware structure of the production line scheduling device according to the embodiment of the present application.

The in-line dispatching device may include a processor 61 and a memory 62 storing computer program instructions.

Specifically, the processor 61 may include a Central Processing Unit (CPU), or A Specific Integrated Circuit (ASIC), or may be configured to implement one or more Integrated circuits of the embodiments of the present Application.

Memory 65 may include, among other things, mass storage for data or instructions. By way of example, and not limitation, memory 65 may include a Hard Disk Drive (Hard Disk Drive, abbreviated HDD), a floppy Disk Drive, a Solid State Drive (SSD), flash memory, an optical Disk, a magneto-optical Disk, tape, or a Universal Serial Bus (USB) Drive or a combination of two or more of these. Memory 65 may include removable or non-removable (or fixed) media, where appropriate. The memory 65 may be internal or external to the data processing apparatus, where appropriate. In a particular embodiment, the memory 65 is a Non-Volatile (Non-Volatile) memory. In particular embodiments, Memory 65 includes Read-Only Memory (ROM) and Random Access Memory (RAM). The ROM may be mask-programmed ROM, Programmable ROM (PROM), Erasable PROM (EPROM), Electrically Erasable PROM (EEPROM), Electrically rewritable ROM (earrom) or FLASH Memory (FLASH), or a combination of two or more of these, where appropriate. The RAM may be a Static Random-Access Memory (SRAM) or a Dynamic Random-Access Memory (DRAM), where the DRAM may be a Fast Page Mode Dynamic Random-Access Memory (FPMDRAM), an Extended data output Dynamic Random-Access Memory (EDODRAM), a Synchronous Dynamic Random-Access Memory (SDRAM), and the like.

Memory 65 may be used to store or cache various data files for processing and/or communication use, as well as possibly computer program instructions for execution by processor 62.

The processor 61 reads and executes the computer program instructions stored in the memory 62 to implement any one of the production line scheduling methods in the above embodiments.

In some of these embodiments, the line dispatching device may further include a communication interface 63 and a bus 60. As shown in fig. 6, the processor 61, the memory 62, and the communication interface 63 are connected via a bus 60 to complete mutual communication.

The communication interface 63 is used for implementing communication between modules, devices, units and/or apparatuses in the embodiments of the present application. The communication port 63 may also be implemented with other components such as: the data communication is carried out among external equipment, image/data acquisition equipment, a database, external storage, an image/data processing workstation and the like.

The bus 60 includes hardware, software, or both that couple the components of the line production scheduling device to each other. Bus 60 includes, but is not limited to, at least one of the following: data Bus (Data Bus), Address Bus (Address Bus), Control Bus (Control Bus), Expansion Bus (Expansion Bus), and Local Bus (Local Bus). By way of example, and not limitation, Bus 60 may include an Accelerated Graphics Port (AGP) or other Graphics Bus, an Enhanced Industry Standard Architecture (EISA) Bus, a Front-Side Bus (FSB), a HyperTransport (HT) interconnect, an ISA (ISA) Bus, an InfiniBand (InfiniBand) interconnect, a Low Pin Count (LPC) Bus, a memory Bus, a Micro Channel Architecture (MCA) Bus, a Peripheral Component Interconnect (PCI) Bus, a PCI-Express (PCI-X) Bus, a Serial Advanced Technology Attachment (SATA) Bus, a Video electronics standards Association Local Bus (VLB) Bus, or other suitable Bus or a combination of two or more of these. Bus 60 may include one or more buses, where appropriate. Although specific buses are described and shown in the embodiments of the application, any suitable buses or interconnects are contemplated by the application.

The production line scheduling device may execute the production line scheduling method in the embodiment of the present application based on the obtained work process table, resource table, and production scheduling period, thereby implementing the production line scheduling method described with reference to fig. 1.

In addition, in combination with the production line scheduling method in the foregoing embodiments, embodiments of the present application may provide a computer-readable storage medium to implement the method. The computer readable storage medium having stored thereon computer program instructions; the computer program instructions, when executed by a processor, implement any of the production line scheduling methods in the above embodiments.

The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A production line scheduling method, the method comprising:

2. The production line scheduling method of claim 1, wherein the constructing a mixed integer programming model according to the work process table, the resource table, and the scheduling period comprises:

setting a second constraint condition according to the current quantity;

3. The production line scheduling method according to claim 2, wherein the setting of the first constraint condition according to the number of starts of the process and the timing of completing the process includes:

4. The production line scheduling method according to claim 2, wherein the setting of the second constraint condition according to the current number includes:

5. The production line scheduling method of claim 2, wherein the determining the objective function according to the first constraint, the second constraint, the final quantity of each resource, and the corresponding target quantity comprises:

acquiring the weight of each resource;

6. The production line scheduling method according to claim 5, wherein the obtaining the weight of each resource includes:

7. The line production scheduling method of claim 1, further comprising:

8. A production line scheduling device, the device comprising:

9. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the line scheduling method of any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium on which a computer program is stored, the program, when executed by a processor, implementing the line scheduling method according to any one of claims 1 to 7.