CN111105133B - Production scheduling method, computer device, and storage medium - Google Patents
Production scheduling method, computer device, and storage medium Download PDFInfo
- Publication number
- CN111105133B CN111105133B CN201911090379.9A CN201911090379A CN111105133B CN 111105133 B CN111105133 B CN 111105133B CN 201911090379 A CN201911090379 A CN 201911090379A CN 111105133 B CN111105133 B CN 111105133B
- Authority
- CN
- China
- Prior art keywords
- production
- task
- unit
- sequence
- completion time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 432
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000003860 storage Methods 0.000 title claims abstract description 13
- 230000008901 benefit Effects 0.000 claims abstract description 22
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 238000004364 calculation method Methods 0.000 description 8
- 229910000831 Steel Inorganic materials 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 6
- 239000010959 steel Substances 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 238000000354 decomposition reaction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000001174 ascending effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Manufacturing & Machinery (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The disclosure discloses a production scheduling method, computer equipment and a storage medium, and relates to the technical field of scheduling. The method comprises the steps of determining a plurality of production tasks and obtaining a profit value of each production task; the income value is used for representing the economic benefit value brought to the enterprise by the production task; determining a plurality of production units, and distributing the production tasks to corresponding production units according to the income values so as to determine a task sequence of each production unit; and scheduling the corresponding production unit to perform production and processing according to the task sequence of each production unit. The beneficial effects of this disclosure are: by introducing the concept of the profit value of the production task, a suitable production unit can be allocated to the production task according to the profit value. The production task of the production unit can be balanced in load, and the maximization of the production benefit can be guaranteed.
Description
Technical Field
The present disclosure relates to scheduling technologies, and in particular, to a production scheduling method, a computer device, and a storage medium.
Background
In the prior art, researches specially aiming at the scheduling problem of steel processing and production are rare, most of the researches are oriented to the scheduling problem of a more universal flexible job shop, and the proposed scheduling method mainly comprises an accurate method based on operational engineering, such as a mathematical programming method, a Lagrange relaxation method, a branch and bound method and the like, and an intelligent scheduling method based on a genetic algorithm, a particle swarm algorithm, an ant colony algorithm, an immune algorithm, a differential evolution algorithm, a tabu search algorithm, a cellular automata algorithm and the like. Although these scheduling methods can theoretically obtain an optimal solution to schedule a production task, they are limited in practical application due to complex calculation, large computation amount, time consumption, and the like. In addition, the intelligent scheduling method is easy to fall into a local optimal solution in the process of scheduling the massive tasks, and the effects in the aspects of convergence speed and load balancing need to be improved.
With the ever-increasing production tasks of steel processing enterprises, it becomes complicated and difficult to make a reasonable production operation plan. Many steel processing enterprises even make production plans manually, and scheduling personnel are difficult to comprehensively balance the difference of task delivery periods and the constraints of various production resources, and particularly when production tasks are centrally issued in a short period to cause serious conflict of workshop productivity, the production sequence often needs to be frequently adjusted, so that the production benefit of the enterprises is influenced.
In conclusion, the current steel processing production scheduling method has the defects of complex calculation, low production benefit and the like.
Disclosure of Invention
Based on the technical problems, the present disclosure provides a production scheduling method, a computer device and a storage medium, which can implement scheduling of production tasks according to income values of the tasks, so as to ensure maximization of income effects, and fundamentally solve the technical problems of complex calculation and low production benefits.
In a first aspect, an embodiment of the present disclosure provides a production scheduling method, including: determining a plurality of production tasks and obtaining a profit value of each production task; the income value is used for representing the economic benefit value brought to the enterprise by the production task;
determining a plurality of production units, and distributing the production tasks to corresponding production units according to the income values so as to determine a task sequence of each production unit;
and scheduling the corresponding production unit to perform production and processing according to the task sequence of each production unit.
Further, according to the profit value, distributing the plurality of production tasks to corresponding production units to determine a task sequence of each production unit, including:
step 221, selecting a target task from the plurality of production tasks, wherein the currently selected target task is always the production task with the largest profit value from the plurality of production tasks;
step 222, determining at least one unit corresponding to the type of the target task from the plurality of production units as a matching unit;
step 223, adding the target task into the task sequence of the matching unit, and randomly sequencing all production tasks in the task sequence to obtain a plurality of sequenced task sequences;
step 226, returning to execute step 221 until each production task is completely allocated, so as to determine the task sequence of each production unit.
Further, determining a task sequence satisfying a first preset condition among the plurality of sequenced task sequences as a target task sequence, including:
acquiring the completion time and delivery date of each production task in the sequenced task sequence;
according to the completion time and delivery date of each production task, selecting a task sequence with the completion time of each production task meeting the delivery date corresponding to the production task from the sequenced task sequences as an alternative task sequence;
and acquiring first total completion time of the alternative task sequences, and selecting the task sequence with the shortest first total completion time from the alternative task sequences as the target task sequence.
Further, the method further comprises:
and when the task sequence with the completion time of each production task meeting the delivery date corresponding to the production task cannot be selected from the sequenced task sequences as the alternative task sequence, prompting to modify the task attribute of the target task.
According to another embodiment of the present disclosure, allocating the plurality of production tasks to corresponding production units according to the profit value to determine a task sequence of each production unit includes:
step 321, selecting a target task from the plurality of production tasks, wherein the currently selected target task is always the production task with the largest profit value from the plurality of production tasks;
step 322, determining at least one unit corresponding to the type of the target task from the plurality of production units as a matching unit;
Further, judging whether the completion time meets a second preset condition or not comprises the following steps:
obtaining a delivery date of the target task;
determining whether the elapsed time exceeds the delivery date;
determining that the time-out satisfies a second preset condition when the time-out does not exceed the delivery date.
Further, after determining the unit corresponding to the type of the target task from the plurality of production units as a matching unit, the method further includes:
acquiring second total completion time of the distributed production tasks in each matching unit;
respectively calculating the difference between the second total completion time of each matched unit and the shortest second total completion time;
and taking the production unit with the difference value smaller than or equal to a preset threshold value as the matching unit.
Further, obtaining a profit value for each of the production tasks includes:
calculating a profit value for the production task by the following formula:
taskValue i ＝workingOurs i ×taskCoef i ×taskPrior i ；
wherein taskValue i Indicates the profit value, workgos, of the ith production task i Indicating the required man-hours, tasskcoef, for the ith production task i Denotes the coefficient of return, taskpior, of the ith production task i Indicating the priority coefficient of the ith production job.
In a second aspect, the present disclosure provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the processor implements the production scheduling method when executing the computer program.
In a third aspect, the present disclosure provides a computer storage medium, on which a computer program is stored, and when the program is executed by a processor, the method for scheduling production is implemented.
Therefore, according to the production scheduling method, the computer device and the storage medium provided by the embodiment of the disclosure, by determining a plurality of production tasks and obtaining the profit value of each production task, the task sequence corresponding to each production unit is determined according to the profit value, and then the corresponding production unit is scheduled according to the task sequence to perform production and processing. Therefore, the production scheduling method provided by the implementation of the disclosure can allocate the appropriate production units to the production tasks according to the profit value by introducing the concept of the profit value of the production tasks. The production task of the production unit can be balanced in load, and the maximization of the production benefit can be guaranteed.
Drawings
The scope of the present disclosure may be better understood by reading the following detailed description of exemplary embodiments in conjunction with the accompanying drawings. Wherein the included drawings are:
fig. 1 is a schematic flow chart illustrating a production scheduling method according to an embodiment of the present disclosure;
fig. 2 is a schematic flow chart illustrating a production scheduling method according to a second embodiment of the present disclosure;
FIG. 3 is a flow chart illustrating specific steps of step 220 shown in FIG. 2;
FIG. 4 is a flowchart illustrating specific steps of step 224 shown in FIG. 3;
fig. 5 is a flowchart illustrating a production scheduling method according to a third embodiment of the present disclosure;
fig. 6 shows a flowchart illustrating specific steps of step 320 shown in fig. 5.
Detailed Description
In order to make the objects, technical solutions and advantages of the present disclosure more clear, the following detailed description of the implementation method of the present disclosure will be made with reference to the accompanying drawings and embodiments, so that how to apply technical means to solve the technical problems and achieve the technical effects can be fully understood and implemented.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure, however, the present disclosure may be practiced in other ways than those described herein, and therefore the scope of the present disclosure is not limited by the specific embodiments disclosed below.
Example one
According to an embodiment of the present disclosure, a production scheduling method is provided, and in some embodiments, the method may be applied to the field of steel processing production, and fig. 1 illustrates a flow diagram of a production scheduling method provided in an embodiment of the present disclosure, and as shown in fig. 1, the method may include the following steps:
step 110, determining a plurality of production tasks and obtaining the income value of each production task; the income value is used for representing the economic benefit value brought to the enterprise by the production task;
in one embodiment, the production job may be obtained from a product purchase and sale contract and broken down into a plurality of production tasks that are independent of each other. Each production task contains necessary information such as product type, specification, delivery date, required labor hour and the like. It will be appreciated that the revenue value of a production task may be used to measure the benefit that the task brings to the enterprise. In actual production, the processing man-hour required by a production task is a main factor of the income of the task, and the larger the order quantity is, the more the man-hour is required, and the income of an enterprise is increased. In addition, the profitability generated by different types of production tasks is different, and the profit rate of some tasks is high and the profit is low. Therefore, the profit value of each production task can be calculated to reflect the economic benefit value brought to the enterprise by the production task.
as an implementation manner, the information of each unit in the workshop may be obtained first, and a unit information table may be set. The information of each unit includes necessary information such as unit type, unit state, unit configuration, and the like. And selecting a plurality of units which normally operate according to the unit information and determining the units as a plurality of production units. Secondly, whether the production task is matched with the production unit can be determined according to the type of the production task and the type of the production unit. And then selecting a production task combination with the optimal profit value from a plurality of production tasks matched with the production unit by adopting a greedy strategy, and taking the production task combination as a task sequence of the production unit. It is worth noting that the return value is optimal, i.e. maximum return value, load balancing of the production units, minimum loss of man-hours and delivery date are met. By traversing each production unit through the method, the task sequence corresponding to each production unit can be obtained.
And step 130, scheduling the corresponding production unit to perform production and processing according to the task sequence of each production unit.
And scheduling the corresponding production unit to perform production processing, namely, the production unit performs processing production according to the received task sequence.
According to the production scheduling method, production scheduling is performed by introducing the concept of the profit value of the production task, so that the maximization of the production profit can be guaranteed when the production task is scheduled.
Example two
Fig. 2 shows a schematic flow chart of a production scheduling method according to a second embodiment of the present disclosure, and as shown in fig. 2, a production scheduling method according to another embodiment of the present disclosure may include the following steps:
step 210, determining a plurality of production tasks and obtaining the income value of each production task; the income value is used for representing the economic benefit value brought to the enterprise by the production task;
as one embodiment, the production job may be obtained from a product purchase and sale contract and decomposed into a plurality of production tasks independent of each other. Each production task contains necessary information such as product type, specification, delivery date, required labor hour and the like. It will be appreciated that the revenue value of a production task may be used to gauge the benefit that the task brings to the enterprise. In actual production, the processing man-hour required by a production task is a main factor of the income of the task, and the larger the order quantity is, the more the man-hour is required, and the income of an enterprise is often larger. In addition, the profitability generated by different types of production tasks is different, and the profit rate of some tasks is high and the profit is low. Therefore, the profit value of each production task can be calculated to reflect the economic benefit value brought to the enterprise by the production task.
It is worth noting that the profit value of the production task can be calculated by the following calculation:
taskValue i ＝workingOurs i ×taskCoef i ×taskPrior i ；
wherein, taskvvalue i Representing the value of the yield of the ith production task, workingOurs i Indicating the required man-hours, tasskcoef, for the ith production task i Representing the coefficient of return for the ith production job,taskPrior i indicating the priority coefficient of the ith production task.
Step 220, determining a plurality of production units, and distributing the plurality of production tasks to corresponding production units according to the income values to determine a task sequence of each production unit;
as an implementation mode, the information of each unit of the workshop can be obtained first, and a unit information table is set. The information of each unit includes necessary information such as unit type, unit state, unit configuration, and the like. And selecting a plurality of units which normally operate according to the unit information and determining the units as a plurality of production units. Secondly, whether the production tasks are matched with the production units or not can be determined according to the types of the production tasks and the types of the production units. And then selecting a production task combination with the optimal profit value from a plurality of production tasks matched with the production unit by adopting a greedy strategy, and taking the production task combination as a task sequence of the production unit. It is worth noting that the return value is optimal, i.e. maximum return value, load balancing of the production units, minimum loss of man-hours and delivery date are met. By traversing each production unit through the method, the task sequence corresponding to each production unit can be obtained.
And step 230, scheduling the corresponding production unit to perform production and processing according to the task sequence of each production unit.
And scheduling the corresponding production unit to perform production processing, namely, the production unit performs processing production according to the received task sequence.
According to the production scheduling method, production scheduling is performed by introducing the concept of the profit value of the production task, so that the maximization of the production profit can be guaranteed when the production task is scheduled.
In an alternative embodiment, fig. 3 shows a flowchart of specific steps of step 220 shown in fig. 2, and as shown in fig. 3, in step 220, the plurality of production tasks are allocated to corresponding production units according to the profit value to determine the task sequence of each production unit, including steps 221 to 226.
In step 221, a target task is selected from the plurality of production tasks, wherein the currently selected target task is always the production task with the largest profit value among the plurality of production tasks.
Here, the selecting of the target task from the plurality of production tasks may be sorting the plurality of production tasks according to the profit values from large to small to obtain a task list. And then selecting a task sequence with the maximum profit value from the task list as the target task.
In step 222, at least one unit corresponding to the type of the target task is determined as a matching unit from the plurality of production units.
Here, the types of workpieces that can be processed by each of the plurality of production units may be the same or different. Therefore, at least one unit corresponding to the type of the target task needs to be selected from the plurality of production units as a matching unit. It should be noted that the number of matching units may include one or more units, because some production units may process both a and B workpieces, and some units may process only B workpieces in a factory.
In step 223, the target task is added to the task sequence of the matching unit, and all production tasks in the task sequence are randomly ordered to obtain a plurality of ordered task sequences.
Here, the distributed production tasks in the matching unit and the currently added target tasks are randomly ordered. For example, the task sequence of the matching unit F includes the assigned task a and task B, and after the target task C is added to the task sequence of the matching unit F, the task a, the task B, and the target task C are randomly ordered, so that a plurality of task sequences with different ordering combinations can be obtained. When the number of matching groups includes a plurality of groups, the above-described sorting is also performed.
It should be noted that the assigned production task is randomly ordered with the currently added target task because prioritizing a task does not mean that the task starts to execute earlier. The final task execution is a task sequence obtained by optimally sequencing all the tasks distributed to a certain production unit.
In step 224, a task sequence satisfying a first preset condition in the plurality of ordered task sequences is determined as a target task sequence.
Here, the first preset condition means that the completion time of all the production tasks in the sorted task sequence satisfies the delivery deadline corresponding to each production task in the sequence, and the total completion time of the sorted task sequence is the shortest. The total completion time of the task sequence refers to the time required for completing all production tasks of the task sequence, and is determined by the required working hours of each production task and the working hours of task switching among the tasks. The task switching man-hour refers to the preparation time required for switching the production unit from the task A to the task B. It should be noted that the first preset condition may also be determined according to actual conditions,
in step 225, according to the target task sequence, it is determined to allocate the target task to the production unit corresponding to the target task sequence, and the target task sequence is used as the task sequence of the production unit.
In step 226, the step 221 is executed again until each production task is allocated, so as to determine the task sequence of each production unit.
Here, the repeated execution of the above steps means returning to step 221, re-selecting a new target task, and executing steps 222 to 226 until all production tasks in the task list are completely allocated. All production tasks are distributed, namely the tasks are scheduled, namely whether the production tasks can not be distributed to a production unit or not.
In the embodiment, production scheduling is performed by introducing the concept of the income value of the production task, and the production task with a large income value is preferentially selected to be scheduled by adopting a greedy strategy, so that the maximization of the production income is ensured while the load of the production unit can be balanced.
In an alternative embodiment, fig. 4 shows a flowchart of a specific step of step 224 shown in fig. 3, and as shown in fig. 4, in step 224, a task sequence that satisfies a first preset condition from among the plurality of sequenced task sequences is determined as a target task sequence, including steps 2241 to 2243.
In step 2241, the completion time and delivery date of each production job in the sorted job sequence are acquired.
In step 2242, according to the completion time and delivery date of each production task, a task sequence with the completion time of each production task satisfying the delivery date corresponding to the production task is selected from the sorted task sequences as an alternative task sequence.
Here, since the required man-hours for each production task, the delivery date, and the task switching man-hours between every two different types or the same type of production tasks are determined. Therefore, in the sorted task sequence, the completion time and delivery date of each production task can be obtained.
And selecting the task sequence with the completion time of each production task meeting the delivery date corresponding to the production task from the sequenced task sequences as an alternative task sequence, namely the completion time of each production task in the alternative task sequence does not exceed the delivery date corresponding to the production task. It should be noted that the number of the alternative task sequences may include one or more, or may not be selected. The alternative task sequence is not selected, which means that the completion time of each production task without the task sequence in the sequenced task sequences does not exceed the delivery date corresponding to the production task.
It should be noted that, when the task sequence whose completion time of each production task satisfies the delivery date corresponding to the production task cannot be selected from the sorted task sequences as the alternative task sequence, the modification of the task attribute of the target task is prompted.
And modifying the task attribute of the target task, wherein the modifying comprises splitting the target task into a plurality of subtasks, modifying delivery date of the target task and the like.
In step 2243, a first total completion time of the candidate task sequences is obtained, and a task sequence with the shortest first total completion time is selected from the candidate task sequences as the target task sequence.
Here, the first total completion time refers to a sum of time required for the alternative task sequence to complete all production tasks in the task sequence. And selecting the alternative task sequence with the shortest total completion time as a target task sequence, so that the load of the production unit can be dispatched in a balanced manner.
In an optional embodiment, in step 222, after determining at least one unit corresponding to the type of the target task from the plurality of production units as a matching unit, the method may further include:
acquiring second total completion time of the distributed production tasks in each matching unit;
respectively calculating the difference between the second total completion time of each matched unit and the shortest second total completion time;
and taking the production unit with the difference value smaller than or equal to a preset threshold value as the matching unit.
Here, by calculating the difference between the second total completion time of each of the matching units and the shortest second total completion time, some production units with significant differences in second completion time can be directly screened out. For example, there are production unit a and production unit B, the total completion time of production unit a is 1 hour, the second completion time of production unit B is 1 day, when one production is allocated to production units a and B, it is impossible to arrange on production unit B because the second completion time is too different. Therefore, whether the difference value between the second total completion time of each matching unit and the shortest second total completion time is smaller than a preset threshold value or not is judged and calculated, and reasonable scheduling of the production units can be achieved.
EXAMPLE III
Fig. 5 shows a schematic flow chart of a production scheduling method according to a third embodiment of the present disclosure, and as shown in fig. 5, a production scheduling method according to another embodiment of the present disclosure may include the following steps:
step 310, determining a plurality of production tasks and acquiring a profit value of each production task; the income value is used for representing the economic benefit value brought to the enterprise by the production task;
as one embodiment, the production job may be obtained from a product purchase and sale contract and decomposed into a plurality of production tasks independent of each other. Each production task contains necessary information such as product type, specification, delivery date, required working hours and the like. It will be appreciated that the revenue value of a production task may be used to measure the benefit that the task brings to the enterprise. In actual production, the processing man-hour required by a production task is a main factor of the income of the task, and the larger the order quantity is, the more the man-hour is required, and the income of an enterprise is often larger. In addition, the yield rate generated by different types of production tasks is different, and the profit rate of some tasks is high and the profit is thin. Therefore, the profit value of each production task can be calculated to reflect the economic benefit value brought to the enterprise by the production task.
It is worth noting that the profit value of the production task can be calculated by the following calculation:
taskValue i ＝workingOurs i ×taskCoef i ×taskPrior i ；
wherein taskValue i Representing the value of the yield of the ith production task, workingOurs i Indicating the required man-hours, tasskcoef, for the ith production task i Denotes the coefficient of return, taskpior, of the ith production task i Indicating the priority coefficient of the ith production task.
Step 320, determining a plurality of production units, and distributing the plurality of production tasks to corresponding production units according to the income value to determine a task sequence of each production unit;
as an implementation mode, the information of each unit of the workshop can be obtained first, and a unit information table is set. The information of each unit includes necessary information such as unit type, unit state, unit configuration, and the like. And selecting a plurality of units which normally operate according to the unit information and determining the units as a plurality of production units. Secondly, whether the production tasks are matched with the production units or not can be determined according to the types of the production tasks and the types of the production units. And then selecting a production task combination with the optimal profit value from a plurality of production tasks matched with the production unit by adopting a greedy strategy, and taking the production task combination as a task sequence of the production unit. It is worth noting that the return value is optimal, i.e. maximum return value, load balancing of the production units, minimum loss of man-hours and delivery date are met. By traversing each production unit through the method, the task sequence corresponding to each production unit can be obtained.
And 330, scheduling the corresponding production unit to perform production and processing according to the task sequence of each production unit.
And scheduling the corresponding production unit to perform production processing, namely, the production unit performs processing production according to the received task sequence.
In an alternative embodiment, fig. 6 is a flowchart illustrating specific steps of step 320 shown in fig. 5, and as shown in fig. 6, in step 320, the plurality of production tasks are allocated to corresponding production units according to the profit value to determine the task sequence of each production unit, including steps 321 to 325.
In step 321, a target task is selected from the plurality of production tasks, wherein the currently selected target task is always the production task with the largest profit value among the plurality of production tasks.
Here, the selecting of the target task from the plurality of production tasks may be sorting the plurality of production tasks according to the profit value from large to small to obtain a task list. And then selecting a task sequence with the maximum profit value from the task list as the target task.
In step 322, at least one unit corresponding to the type of the target task is determined as a matching unit from the plurality of production units.
Here, the types of workpieces that can be processed by each of the plurality of production lines may be the same or different. Therefore, at least one unit corresponding to the type of the target task needs to be selected from the plurality of production units as a matching unit. It should be noted that the number of matching units may include one or more units, because some production units may process both a and B workpieces, and some units may process only B workpieces in a factory.
In step 323, the completion time of each matching unit for completing the target task is obtained.
Here, the completion time of each of the matching machine groups to complete the target task is obtained, which is determined by the required man-hours of the respective production tasks and the man-hours of task switching between the respective tasks. For example, a production task a and a production task B exist in a task sequence of a matching unit, where the required working hours of the production task a are 6 hours, the required working hours of the production task B are 7 hours, and the working hours for switching the tasks of the production task a and the production task B are 2 hours, after a target task C is added into the task sequence of the matching unit, the working hours for switching the tasks of the production task B and the target task B are 3 hours, and the required working hours of the target task C are 8 hours, so that the completion time of the matching unit to complete the target task C is 6+2+7+3+8=26 hours.
In step 324, it is determined whether the completion time meets a second preset condition, when the completion time meets the second preset condition, the matching unit corresponding to the completion time is determined as a target unit, and the target task is allocated to a task sequence of the target unit
And determining a matched unit with the completion time meeting a second preset condition from the matched units as a target unit according to each completion time, and determining to distribute the target task to a task sequence of the target unit.
In step 325, the step 321 is executed again until each production task is allocated, so as to determine the task sequence of each production unit.
Here, the repeated execution of the above steps means returning to step 321 to re-select a new target task, and executing steps 322 to 325 until all production tasks in the task list are completely allocated. All production tasks are distributed completely, namely the tasks are scheduled, namely whether the production tasks can not be distributed to a production unit or not.
In an alternative embodiment, the step 324 of determining whether the completion time satisfies a second preset condition may include:
obtaining a delivery date of the target task;
determining whether the elapsed time exceeds the delivery date;
determining that the time-out satisfies a second preset condition when the time-out does not exceed the delivery date.
Here, it is determined whether each of the completion times exceeds the delivery date of the target task, and the completion time not exceeding the delivery date is selected as the first completion time, and a unit capable of completing the target task on time can be determined from the plurality of matching units. For example, the matching units comprise A, B, C, and the completion time of the matching unit A and the matching unit C can meet the delivery date of the target task according to the completion time. And then, in the completion time of the matching unit A and the matching unit C, if the completion time of the matching unit A is shortest, distributing the target task to the matching unit A.
In an alternative embodiment, when each of the elapsed times exceeds the delivery date of the target task, a modification of task attributes of the target task is prompted.
And modifying the task attribute of the target task, wherein the modifying comprises splitting the target task into a plurality of subtasks, modifying delivery date of the target task and the like.
In an optional embodiment, in step 222, after determining at least one unit corresponding to the type of the target task from the plurality of production units as a matching unit, the method may further include:
acquiring second total completion time of the distributed production tasks in each matching unit;
respectively calculating the difference between the second total completion time of each matched unit and the shortest second total completion time;
and taking the production unit with the difference value smaller than or equal to a preset threshold value as the matching unit.
Here, by calculating the difference between the second total completion time of each of the matching units and the shortest second total completion time, some production units with significant differences in second completion time can be directly screened out. For example, there are a production unit a and a production unit B, the total completion time of the production unit a is 1 hour, the second completion time of the production unit B is 1 day, and when one production is allocated to the production units a and B, it is impossible to arrange on the production unit B because the second completion time is too different. Therefore, whether the difference value between the second total completion time of each matching unit and the shortest second total completion time is smaller than a preset threshold value or not is judged and calculated, and reasonable scheduling of the production units can be achieved.
Example four
In practical applications, the specific implementation steps of the production scheduling method of this embodiment may be as follows:
step 1, acquiring production operation from a product purchase and sale contract, and decomposing the production operation into mutually independent production tasks. Each task contains necessary information such as product type, specification, lead time, required man-hours, etc.
The method comprises the steps of decomposing a job submitted by a user into a set of n mutually independent tasks, and defining a task set T = { T = (the number of the tasks is one) 1 ,t 2 ,…,t i ,…,t n H, where t i The task is the i-th task (i =1,2, …, n) after the decomposition, and n is the number of the tasks after the decomposition, the task t i Can be represented by the following equation:
t i ＝(taskType i ,taskSpec i ,deliverTime i ,workingOurs i ,taskCoef i ,taskPrior i )
wherein taskType i Product type, taskSpec, representing the ith task i DeliverTime indicating the Specification of the ith task i Shows the delivery date, workgos of the ith task i Indicating the required man-hour, taskCoef, of the ith task i Coefficient of return (taskCoef) representing the ith task i Not less than 0, default value of 1), taskpior i Indicates the priority coefficient (taskpior) of the ith task i > 1, default value of 1). It is worth noting that the priority factor may adjust the priority of the task scheduling for manual intervention in special situations.
And 2, acquiring information of each unit of the workshop and setting a unit information table. The information of each unit includes necessary information such as unit type, unit state, unit configuration, and the like.
And 3, selecting the units which normally operate, setting a task sequence corresponding to each unit, and initializing to be empty.
And 4, adopting a greedy strategy to preferentially select tasks with large income values for scheduling, and distributing the tasks to the optimal unit.
And 4, outputting the task sequence distributed by each unit, and finishing the scheduling task.
In the step 4, the detailed step of preferentially selecting the task with the large profit value to schedule by using the greedy strategy is as follows:
and 4.1, calculating the profit values of all the production tasks, and sequencing the production tasks in a descending manner according to the profit values to form a task list.
Wherein each production task t is defined i Corresponding to a profit value taskvvalue i The profit value is used to measure the benefit the task brings to the enterprise. In actual production, the processing man-hour required by a production task is a main factor of the income of the task, and the larger the order quantity is, the more the man-hour is required, and the income of an enterprise is increased. In addition, the yield rate generated by different types of production tasks is different, and the profit rate of some tasks is high and the profit is thin.
Wherein the profit value of the production task may be calculated by the following calculation formula:
taskValue i ＝workingOurs i ×taskCoef i ×taskPrior i ；
wherein taskValue i Representing the value of the yield of the ith production task, workingOurs i Indicating the required man-hours, tasskcoef, for the ith production task i Denotes the coefficient of return, taskpior, of the ith production task i Indicating the priority coefficient of the ith production task.
And 4.2, circularly taking out a production task i from the task list in sequence, and searching for a production unit matched with the type of the production task i.
And 4.3, judging whether the production task i can meet the delivery requirement after being sequentially added to the matched production units, and finding out the optimal unit of the production task i if the delivery requirement is met.
And 4.4, adding the production task i into the optimal set, and updating the task sequence of the optimal set.
And 4.5, returning to the step 4.2 to continue executing until all the production tasks are distributed or the production tasks are finished.
In the step 4.3, the detailed steps of judging whether the production task i sequentially added to the matching unit can meet the delivery requirement or not so as to find out the optimal unit of the production task i are as follows:
and 4.3.1, setting a feasible task sequence set F for the current task i and initializing to be empty. Each feasible task sequence comprises information such as a task number, task starting processing time, task finishing processing time, task switching time and the like.
And 4.3.2, performing incremental sorting on the units matched with the type of the current task i according to the total completion time of the distributed tasks of the units to form a unit list, calculating the difference between the total completion time of each unit and the first unit in the unit list, and deleting the units with the difference value larger than a preset threshold value to obtain the deleted unit list.
And 4.3.3, sequentially and circularly taking out one unit j from the matched units, and acquiring the completion time of the unit j. Until all matching units are taken out.
Step 4.3.4, judging the difference between the task completion time of the current unit j and the completion time of the unit finished earliest, and if the difference does not exceed a threshold value theta, continuing to execute the following steps; otherwise, further judging whether the set F is empty, if so, continuing to execute the following steps, otherwise, jumping out of the loop and entering the step 4.3.8.
4.3.5, judging whether the delivery periods of all tasks distributed by the current unit j meet the requirements of the client after the task i is added to the current unit j, if not, stopping the current step, continuing to enter the step 4.3.3, and entering the next cycle; if yes, the following steps are continued.
And 4.3.6, adding the tasks i to the unit j to form a plurality of feasible task sequences, taking two feasible task sequence sets F with the earliest completion time, adding the task sequences to the feasible task sequence set F, returning to the step 4.3.3, and continuing the next cycle until all matched units are completely taken.
And 4.3.7, judging whether the feasible task set F is empty, if not, continuing the following steps, and if so, reporting an error, prompting a user that the current task has no matchable unit, and suggesting to adjust task settings, such as batching the task, modifying delivery time, modifying task priority coefficient and the like.
And 4.3.8, sequencing the sequences in the set F in an increasing mode according to the completion time, calculating the difference between each sequence and the completion time of the first sequence in the sequence, deleting the task sequences with the difference value larger than a second preset threshold value, obtaining task switching working hours of each production task from the task list, and taking out the sequences with smaller switching working hours from the task list, wherein the machine set to which the sequences belong is the optimal machine set corresponding to the production task i.
In the above step 4.3.5, the detailed steps of determining whether the delivery dates of all the tasks allocated by the current unit j after adding the task i to the current unit j meet the customer requirements are as follows,
and 4.3.5.1, setting the feasible task sequence set F 'and initializing to be null, wherein the new task set obtained after the task i is added to the unit j is S'.
In step 4.3.5.2, the tasks in the set S' are arranged in ascending order according to the delivery date, and since the delivery dates of different tasks may be the same, there may be multiple ordering results, so that the ordering result is the task sequence set L.
And 4.3.5.3, sequentially and circularly taking out a sequence L from the task sequence set L, and calculating the task estimated completion time and task switching time of the sequence L until the set L is completely taken out.
4.3.5.4 comparing the estimated completion time and delivery date of each task in sequence l one by one, judging whether there is a task which can not be delivered according to the schedule, if yes, stopping the current step, and continuing to enter 4.3.5.3 for next cycle; otherwise, the following steps are continuously executed.
Step 4.3.5.5, add task sequence L to feasible task sequence set F', and return to step 4.3.5.3 to continue the next loop until set L is completed.
Step 4.3.5.6, judging whether the feasible task sequence set F' is empty, if so, indicating that the delivery date can not meet the customer requirements after adding the task i to the current unit j; if the delivery date is not empty, the client requirement is met, and the task sequence in the F' is a feasible task sequence.
EXAMPLE five
According to an embodiment of the present invention, there may also be provided a computer device including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the production scheduling method according to any one of the above embodiments when executing the computer program.
EXAMPLE six
A storage medium having stored thereon a computer program which, when executed by a processor, implements the production scheduling method according to any one of the above embodiments.
The technical scheme of the present disclosure is explained in detail above with reference to the accompanying drawings, and in consideration of the defects of complex calculation, low production benefit and the like of the steel processing production scheduling method in the related art. The present disclosure provides a production scheduling method, a computer device, and a storage medium, in which a plurality of production tasks are determined, a profit value of each production task is obtained, a task sequence corresponding to each production unit is determined according to the profit value, and then the corresponding production unit is scheduled according to the task sequence to perform production processing. Therefore, the production scheduling method provided by the implementation of the disclosure can allocate a suitable production unit to a production task according to the profit value by introducing the concept of the profit value of the production task. The method not only can realize load balance of the production tasks of the production units, but also can ensure maximization of production benefits, and fundamentally solves the problems of complex calculation and low production benefits.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the elements may be selected according to actual needs to achieve the objectives of the embodiments of the present disclosure.
In addition, functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present disclosure may be substantially or partially contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Although the embodiments disclosed in the present disclosure are described above, the descriptions are only for the convenience of understanding the present disclosure, and are not intended to limit the present disclosure. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure, and that the scope of the disclosure is to be limited only by the appended claims.
Claims (8)
1. A production scheduling method, comprising:
determining a plurality of production tasks and obtaining a profit value of each production task; the income value is used for representing the economic benefit value brought to the enterprise by the production task;
determining a plurality of production units, and distributing the production tasks to corresponding production units according to the income values so as to determine a task sequence of each production unit;
scheduling the corresponding production unit to perform production and processing according to the task sequence of each production unit;
distributing the plurality of production tasks to corresponding production units according to the profit values to determine a task sequence of each production unit, including:
step 221, selecting a target task from the plurality of production tasks, wherein the currently selected target task is always the production task with the largest profit value from the plurality of production tasks;
step 222, determining at least one unit corresponding to the type of the target task from the plurality of production units as a matching unit;
step 223, adding the target task into the task sequence of the matching unit, and randomly sequencing all production tasks in the task sequence to obtain a plurality of sequenced task sequences;
step 224, determining a task sequence meeting a first preset condition in the plurality of sequenced task sequences as a target task sequence;
step 225, according to the target task sequence, determining to allocate the target task to a production unit corresponding to the target task sequence, and taking the target task sequence as a task sequence of the production unit;
step 226, returning to execute step 221 until each production task is completely allocated, so as to determine a task sequence of each production unit;
the first preset condition means that the completion time of all production tasks in the sequenced task sequence meets the delivery deadline corresponding to each production task in the sequence, and the total completion time of the sequenced task sequence is shortest.
2. The method according to claim 1, wherein determining a task sequence satisfying a first preset condition among the plurality of ordered task sequences as a target task sequence comprises:
acquiring the completion time and delivery date of each production task in the sequenced task sequence;
according to the completion time and delivery date of each production task, selecting a task sequence with the completion time of each production task meeting the delivery date corresponding to the production task from the sequenced task sequences as an alternative task sequence;
and acquiring first total completion time of the alternative task sequences, and selecting the task sequence with the shortest first total completion time from the alternative task sequences as the target task sequence.
3. The method of claim 2, further comprising:
and when the task sequence with the completion time of each production task meeting the delivery date corresponding to the production task cannot be selected from the sequenced task sequences as the alternative task sequence, prompting to modify the task attribute of the target task.
4. The method of claim 1, wherein assigning the plurality of production tasks to corresponding production units according to the profit value to determine a task sequence for each of the production units comprises:
step 321, selecting a target task from the plurality of production tasks, wherein the currently selected target task is always the production task with the largest profit value from the plurality of production tasks;
step 322, determining at least one unit corresponding to the type of the target task from the plurality of production units as a matching unit;
step 323, acquiring the completion time of each matching unit for completing the target task;
step 324, judging whether the completion time meets a second preset condition, when the completion time meets the second preset condition, determining a matching unit corresponding to the completion time as a target unit, and distributing the target task to a task sequence of the target unit;
step 325, returning to execute step 321 until each production task is completely allocated, so as to determine a task sequence of each production unit;
judging whether the completion time meets a second preset condition or not, wherein the judging step comprises the following steps:
obtaining a delivery date of the target task;
determining whether the elapsed time exceeds the delivery date;
determining that the time-out satisfies a second preset condition when the time-out does not exceed the delivery date.
5. The method according to any one of claims 1 to 4, wherein after determining the unit corresponding to the type of the target task as a matching unit from the plurality of production units, further comprising:
acquiring second total completion time of the distributed production tasks in each matching unit;
respectively calculating the difference between the second total completion time of each matched unit and the shortest second total completion time;
and taking the production unit with the difference value smaller than or equal to a preset threshold value as the matching unit.
6. The method of claim 1, wherein obtaining a revenue value for each of the production tasks comprises:
calculating a profit value for the production task by the following formula:
taskValue i ＝workingOurs i ×taskCoef i ×taskPrior t ；
wherein taskValue i Indicates the profit value, workgos, of the ith production task i Indicating the required man-hours, tasskcoef, for the ith production task i Denotes the coefficient of return, taskpior, of the ith production task t Indicating the priority coefficient of the ith production job.
7. A computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the production scheduling method according to any of claims 1 to 6 when executing the computer program.
8. A storage medium having stored thereon a computer program, characterized in that the program, when being executed by a processor, implements the production scheduling method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911090379.9A CN111105133B (en) | 2019-11-08 | 2019-11-08 | Production scheduling method, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911090379.9A CN111105133B (en) | 2019-11-08 | 2019-11-08 | Production scheduling method, computer device, and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111105133A CN111105133A (en) | 2020-05-05 |
| CN111105133B true CN111105133B (en) | 2023-04-07 |
Family
ID=70420397
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911090379.9A Active CN111105133B (en) | 2019-11-08 | 2019-11-08 | Production scheduling method, computer device, and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111105133B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113626159B (en) * | 2020-05-09 | 2024-09-17 | 海峡小鹿有限公司 | Task switching method, device and system |
| CN112686471B (en) * | 2021-01-21 | 2024-08-13 | 成都博智云创科技有限公司 | Steel production optimization scheduling method based on greedy strategy |
| CN114444980B (en) * | 2022-04-07 | 2022-07-29 | 南昌菱形信息技术有限公司 | Control method and device for intelligent factory production equipment based on 5G technology |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101533490A (en) * | 2009-04-29 | 2009-09-16 | 江南大学 | Workshop scheduling method for Job-shop discrete production |
| CN105373845A (en) * | 2015-10-14 | 2016-03-02 | 南京理工大学 | Hybrid intelligent scheduling optimization method of manufacturing enterprise workshop |
| CN107329815A (en) * | 2017-06-26 | 2017-11-07 | 浙江工业大学 | A kind of cloud task load equalization scheduling method searched for based on BP Tabu |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105427021A (en) * | 2015-10-30 | 2016-03-23 | 江苏云道信息技术有限公司 | Intelligent clothes production scheduling method |
| US20170178070A1 (en) * | 2015-12-21 | 2017-06-22 | Sap Se | Data analysis for dispatch scheduling optimization in the presence of time constraints |
| CN108876263A (en) * | 2018-08-27 | 2018-11-23 | 刘明隆 | Automobile manufacture intelligence scheduled production processing method |
| CN109377063A (en) * | 2018-10-31 | 2019-02-22 | 广船国际有限公司 | A kind of method for scheduling task, device, equipment and storage medium |
-
2019
- 2019-11-08 CN CN201911090379.9A patent/CN111105133B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101533490A (en) * | 2009-04-29 | 2009-09-16 | 江南大学 | Workshop scheduling method for Job-shop discrete production |
| CN105373845A (en) * | 2015-10-14 | 2016-03-02 | 南京理工大学 | Hybrid intelligent scheduling optimization method of manufacturing enterprise workshop |
| CN107329815A (en) * | 2017-06-26 | 2017-11-07 | 浙江工业大学 | A kind of cloud task load equalization scheduling method searched for based on BP Tabu |
Non-Patent Citations (1)
| Title |
|---|
| 于晓义 ; 孙树栋 ; 司书宾 ; .航空制造业分布式协同生产计划模式研究.计算机应用研究.2009,(第07期),第2598-2602页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111105133A (en) | 2020-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111105133B (en) | Production scheduling method, computer device, and storage medium | |
| US7945466B2 (en) | Scheduling system | |
| US6233493B1 (en) | Computer-implemented product development planning method | |
| US7954106B2 (en) | Estimating resource usage system for allocating resources to tasks based upon the rating value of tasks and resources mapping | |
| Ebben et al. | Workload based order acceptance in job shop environments | |
| CN108776862B (en) | Intelligent scheduling method supporting splitting of process task quantity | |
| CN110516936B (en) | Intelligent production line allocation system | |
| JP2002521756A (en) | Computer-implemented value management tools for asset-intensive manufacturers | |
| US10504045B2 (en) | Audit schedule determination | |
| CN112990515A (en) | Workshop resource scheduling method based on heuristic optimization algorithm | |
| CN118428699B (en) | Scheduling method, device and storage medium based on multi-machine type multi-production line | |
| CN110619573B (en) | Client full-time investigation case distribution method and device | |
| CN113793203A (en) | Order processing method and device | |
| Yang et al. | Mathematical modeling of multi-plant order allocation problem and solving by genetic algorithm with matrix representation | |
| CN116048030B (en) | Multi-production-line production task ordering method and device, storage medium and electronic equipment | |
| Herbots et al. | Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning | |
| Jia et al. | Improving performance of dispatch rules for daily scheduling of assembly and test operations | |
| CN116562477A (en) | Method, device, equipment and storage medium for selecting workgroup scheduling scheme | |
| US20210365872A1 (en) | A system and method for management of project portfolios | |
| CN116451936A (en) | Scheduling method, system and storage medium based on genetic algorithm | |
| CN115759565A (en) | Work order distribution method, device, equipment and computer storage medium | |
| Nonås et al. | Optimal and heuristic solutions for a scheduling problem arising in a foundry | |
| US20060009989A1 (en) | Method, apparatus, data structure and system for scheduling work consistent with an entity's strategic objectives | |
| Lohmer et al. | Multi-factory job shop scheduling with due date objective | |
| JP2006244470A (en) | Delivery date reply system, delivery date reply method, and delivery date reply program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |