CN112488503A - Equipment distribution method in food processing production - Google Patents
Equipment distribution method in food processing production Download PDFInfo
- Publication number
- CN112488503A CN112488503A CN202011372028.XA CN202011372028A CN112488503A CN 112488503 A CN112488503 A CN 112488503A CN 202011372028 A CN202011372028 A CN 202011372028A CN 112488503 A CN112488503 A CN 112488503A
- Authority
- CN
- China
- Prior art keywords
- task
- equipment
- tasks
- time
- production
- 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.)
- Granted
Links
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 32
- 235000013305 food Nutrition 0.000 title claims abstract description 17
- 238000009826 distribution Methods 0.000 title abstract description 8
- 239000002994 raw material Substances 0.000 claims abstract description 10
- 238000005520 cutting process Methods 0.000 claims description 3
- 230000001419 dependent effect Effects 0.000 claims description 3
- 235000008534 Capsicum annuum var annuum Nutrition 0.000 description 4
- 240000008384 Capsicum annuum var. annuum Species 0.000 description 4
- 235000013372 meat Nutrition 0.000 description 4
- 235000015277 pork Nutrition 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005457 optimization 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/06316—Sequencing of tasks or work
-
- 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
- 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/06315—Needs-based resource requirements planning or analysis
-
- 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)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a device distribution method in food processing production, which comprises the following steps: s1, receiving and storing the food purchase order transmitted from the third-party platform; s2, generating a production task according to the commodity demand time in the order and the processing flow and the composition raw materials of the commodity according to the processing flow, and generating a purchasing task according to the difference between the current inventory and the demand quantity of the processing raw materials; s3, initializing a production task; s4, initializing production equipment; and S5, performing scheduling operation. The invention can effectively meet the requirement of a factory on simultaneous production of a plurality of production tasks, and can automatically sequence the tasks and distribute equipment under the condition of dependency relationship, thereby improving the production efficiency and the equipment utilization rate of enterprises and reducing the labor cost.
Description
Technical Field
The invention belongs to the technical field of product production, and particularly relates to an equipment distribution method in food processing production.
Background
At present, most production enterprises adopt an original manual distribution mode to process according to established production process flows and raw material composition of commodities and record the raw materials in an electronic form after receiving downstream orders for summarization, production task sequencing and equipment distribution data are carried out in a manual distribution mode in a production link still in a fixed mode, then the arranged data of production task scheduling is handed to an actual production executor, and manual adjustment and optimization are carried out on the scheduling data according to historical working experience of the production executor.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, and provides the equipment allocation method in the food processing production, which can effectively meet the requirement of a factory on simultaneous production of a plurality of production tasks and can automatically perform task sequencing and equipment allocation under the condition of dependency relationship, thereby improving the production efficiency and equipment utilization rate of enterprises and reducing the labor cost.
The purpose of the invention is realized by the following technical scheme: a method of equipment allocation in food processing production comprising the steps of:
s1, receiving and storing the food purchase order transmitted from the third-party platform;
s2, generating a production task according to the commodity demand time in the order and the processing flow and the composition raw materials of the commodity according to the processing flow, and generating a purchasing task according to the difference between the current inventory and the demand quantity of the processing raw materials;
s3, initializing a production task;
s4, initializing production equipment;
and S5, performing scheduling operation.
Further, the specific implementation method of step S3 is as follows: dividing the task table into a task main table and a task detail table, and splitting and assembling task data of the 2 task tables into task structures according to the following rules:
A. if the task details under one task main table all use the same equipment, the task details under the task main table are all merged into the same task;
B. if the detail in the task main table uses a plurality of devices, sorting according to the execution sequence number, continuously dividing the detail using the same device into one task, and establishing a task with a dependency relationship pointing to the previous sequence number for the task behind the sequence number;
after the division is finished, establishing a dependency relationship among the tasks;
during the production, taking a task which is not depended on by any task as a root node task, firstly, distributing equipment from the root node task, and setting a cut-off time for the root node task;
further, the specific implementation method of step S4 is as follows:
s41, inquiring all available equipment, and setting single capacity corresponding to different commodities for each available equipment:
s42, judging whether the user appoints the number of the devices, if so, taking out the devices with the appointed number from each device type and putting the devices into a set to be used; if the user does not specify the number of devices, only one device is taken out of each device type and put into the set to be used.
Further, the specific implementation method of step S5 is as follows:
s51, finding out all root node tasks in the task set, arranging the root node tasks in a reverse order according to task cutting time, and then sequentially distributing equipment for all the root node tasks;
s52, searching the upper level depended task from the root node task, calculating the detailed dependence time and dependence yield of the depended task, and then distributing equipment for the depended task; then repeating the step until all tasks are distributed;
s53, judging whether the scheduling plan meets the appointed deadline, if so, if the scheduling plan meets the appointed deadline, and if the scheduling plan chooses the least occupied equipment, finishing the scheduling successfully;
if the scheduling is not completed within the specified deadline time or the scheduling type is selected to be the shortest execution time, judging which equipment is lacked according to the last scheduling result, adding one additional equipment to the lacked equipment, adding the equipment to the equipment set to be used, and performing scheduling again.
Further, in the step S51, the following two conditions need to be satisfied for the root node task allocation device:
A. the tasks are evenly distributed on all available devices;
B. under the condition that the time is not conflicted, the used equipment is preferentially used;
the method specifically comprises the following substeps:
s511, dividing the total demand of the tasks by the single productivity of the equipment to obtain the times of the tasks needing to be executed, and sequentially allocating equipment for the root node tasks by taking the one-time execution of one task in one equipment as the minimum granularity;
s512, in the device set of the device type, searching whether devices which are used by other tasks but occupy time of the other tasks and have no conflict with the current task exist, if so, executing a step S514, otherwise, executing a step S513;
s513, searching whether new equipment exists or not, and if so, adding the new equipment into an equipment set;
s514, searching the device with the latest starting occupation time in the device set, and judging whether the time difference between the device with the earliest starting occupation time is enough to execute the current task; if yes, go to step S516, otherwise go to step S515;
s515, checking whether a task capable of being replaced exists, if so, replacing the task and reallocating equipment for the replaced task; otherwise, the capacity of the current equipment type is insufficient;
s516, directly adding the task to the device which starts to execute the time at the latest.
Further, in step S515, a specific implementation method of task replacement is as follows: finding out the device with the same id as the current task from the used device set; if the same task is not executed in the previous equipment, searching the equipment with the largest number of executed tasks; in the found device, the task to be replaced is found: firstly, calculating the difference value from the earliest starting time of the same type of equipment to the earliest starting time of the current equipment, and subtracting the difference value by the task working hours to obtain the task working hours needing to be replaced; replacing other types of tasks occupied by the current equipment from morning to evening in sequence until the replaced task man-hour meets the required task man-hour calculated in the last step; the current task is put in a position before the replaced task, and then the replaced task is redistributed to the equipment.
Further, the specific implementation method of step S52 is as follows:
s521, finding out all tasks depended on by the root node task through the root node task;
s522, marking each task to be depended on by which downstream tasks;
s523, calculating the dependent quantity of each time point of the downstream task;
s524, finding out the earliest starting execution time and the latest deadline of all the downstream tasks; taking the single execution man-hour of the depended task as a segment, and dividing the segment into a plurality of segments from the earliest start of execution time to the later;
s525, calculating the execution minutes of the downstream task in each time period, and then calculating the output of the downstream task per minute, thereby obtaining the output of the downstream task in each time period;
s526, multiplying the output by the dependence proportion calculated during task initialization to obtain the demand of the depended task in each time period;
s527, the depended task is divided into a plurality of subtasks, and then equipment is allocated to the subtasks.
The invention has the beneficial effects that: the invention can effectively meet the requirement of a factory on simultaneous production of a plurality of production tasks, and can automatically sequence the tasks and distribute equipment under the condition of dependency relationship, thereby improving the production efficiency and the equipment utilization rate of enterprises and reducing the labor cost.
Drawings
FIG. 1 is a flow chart of the equipment allocation method in food processing production of the present invention.
Detailed Description
The technical scheme of the invention is further explained by combining the attached drawings.
As shown in fig. 1, the equipment distribution method in food processing production of the present invention comprises the following steps:
s1, receiving and storing the food purchase order transmitted from a third-party platform (e-commerce platform, ERP system and the like); converting the order uploaded by the three-party platform into an order data format which can be identified in the processing system according to a data corresponding mode agreed with the three-party platform;
s2, generating production tasks according to the commodity demand time in the order and the processing flow and the constituent raw materials of the commodity, wherein the production tasks have interdependence relation because the production tasks are generated according to the steps, and generating purchasing tasks according to the difference between the current inventory and the demand quantity of the processing raw materials;
a process flow can be split into a number of process steps, for example: the processing flow of the double-cooked pork can be divided into meat slice processing (meat slices are processed from whole meat), green pepper section processing (green pepper section processing is processed from whole green pepper), and dish frying (meat slices after processing and green pepper section after processing are combined to be made into the double-cooked pork, so that one flow is divided into 3 processing tasks.
The processing flow of a commodity needs to generate several production tasks, which are determined by the single arrangement of the commodity BOM, for example, commodity A is processed by three commodities A1, A2 and A3, commodity A1 is processed by three commodities A11, A12 and A13, commodity A2 is processed by three commodities A21, A22 and A23, and the like. Then the products A, A1, a2, A3 are all process products, and then 4 production tasks are generated. While A1, A2 and A3 are not only processed as the product A, they can also be present in BOM sheets of other products as an integral part of another product. The processing tasks of the same product on the same day can be combined for production.
S3, initializing a production task; the specific implementation method comprises the following steps: dividing the task table into a task main table and a task detail table, and splitting and assembling task data of the 2 task tables into task structures according to the following rules:
A. if the task details under one task main table all use the same equipment, the task details under the task main table are all merged into the same task;
B. if the detail in the task main table uses a plurality of devices, sorting according to the execution sequence number, continuously dividing the detail using the same device into one task, and establishing a task with a dependency relationship pointing to the previous sequence number for the task behind the sequence number;
after the division is finished, establishing a dependency relationship among the tasks;
during the production, taking a task which is not depended on by any task as a root node task, firstly, distributing equipment from the root node task, and setting a cut-off time for the root node task;
the main information of the production task includes: production, planned production quantity, planned production time, input product and input product quantity.
S4, initializing production equipment; the specific implementation method comprises the following steps:
s41, inquiring all available equipment, and setting single capacity corresponding to different commodities for each available equipment:
s42, judging whether the user appoints the number of the devices, if so, taking out the devices with the appointed number from each device type and putting the devices into a set to be used; if the user does not specify the number of devices, only one device is taken out of each device type and put into the set to be used.
S5, performing scheduling operation; the specific implementation method comprises the following steps:
s51, finding out all root node tasks in the task set, arranging the root node tasks in a reverse order according to task cutting time, and then sequentially distributing equipment for all the root node tasks; the following two conditions need to be satisfied for the root node task allocation device:
A. the tasks are evenly distributed on all available devices;
B. under the condition that the time is not conflicted, the used equipment is preferentially used;
the method specifically comprises the following substeps:
s511, dividing the total demand of the tasks by the single productivity of the equipment to obtain the times of the tasks needing to be executed, and sequentially allocating equipment for the root node tasks by taking the one-time execution of one task in one equipment as the minimum granularity;
s512, in the device set of the device type, searching whether devices which are used by other tasks but occupy time of the other tasks and have no conflict with the current task exist, if so, executing a step S514, otherwise, executing a step S513;
s513, searching whether new equipment exists or not, and if so, adding the new equipment into an equipment set;
s514, searching the device with the latest starting occupation time in the device set, and judging whether the time difference between the device with the earliest starting occupation time is enough to execute the current task; if yes, go to step S516, otherwise go to step S515;
s515, checking whether a task capable of being replaced exists, if so, replacing the task and reallocating equipment for the replaced task; otherwise, the capacity of the current equipment type is insufficient;
the specific implementation method of task replacement comprises the following steps: finding out the device with the same id as the current task from the used device set; if the same task is not executed in the previous equipment, searching the equipment with the largest number of executed tasks; in the found device, the task to be replaced is found: firstly, calculating the difference value from the earliest starting time of the same type of equipment to the earliest starting time of the current equipment, and subtracting the difference value by the task working hours to obtain the task working hours needing to be replaced; replacing other types of tasks occupied by the current equipment from morning to evening in sequence until the replaced task man-hour meets the required task man-hour calculated in the last step; the current task is put in a position before the replaced task, and then the replaced task is redistributed to the equipment.
S516, directly adding the task to the device which starts to execute the time at the latest.
S52, searching the upper level depended task from the root node task, calculating the detailed dependence time and dependence yield of the depended task, and then distributing equipment for the depended task; then repeating the step until all tasks are distributed;
the specific implementation method comprises the following steps:
s521, finding out all tasks depended on by the root node task through the root node task;
s522, marking each task to be depended on by which downstream tasks;
s523, calculating the dependent quantity of each time point of the downstream task;
s524, finding out the earliest starting execution time and the latest deadline of all the downstream tasks; taking the single execution man-hour of the depended task as a segment, and dividing the segment into a plurality of segments from the earliest start of execution time to the later;
s525, calculating the execution minutes of the downstream task (which has been scheduled before) in each time period, and then calculating the output of the downstream task per minute, so as to obtain the output of the downstream task in each time period;
s526, multiplying the output by the dependence proportion calculated during task initialization to obtain the demand of the depended task in each time period;
s527, the depended task is divided into a plurality of subtasks, and then equipment is allocated to the subtasks.
S53, judging whether the scheduling plan meets the appointed deadline, if so, if the scheduling plan meets the appointed deadline, and if the scheduling plan chooses the least occupied equipment, finishing the scheduling successfully;
if the scheduling is not completed within the specified deadline time or the scheduling type is selected to be the shortest execution time, judging which equipment is lacked according to the last scheduling result, adding one additional equipment to the lacked equipment, adding the equipment to the equipment set to be used, and performing scheduling again. Finally, the production task scheduling data with non-overlapping time, non-overlapping equipment occupation and production completion time earlier than the order demand time is obtained.
The content of the production task scheduling detail page of this embodiment is shown in the following table:
it will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.
Claims (7)
1. A method of equipment allocation in food processing production, comprising the steps of:
s1, receiving and storing the food purchase order transmitted from the third-party platform;
s2, generating a production task according to the commodity demand time in the order and the processing flow and the composition raw materials of the commodity according to the processing flow, and generating a purchasing task according to the difference between the current inventory and the demand quantity of the processing raw materials;
s3, initializing a production task;
s4, initializing production equipment;
and S5, performing scheduling operation.
2. The method for allocating equipment in food processing production according to claim 1, wherein the step S3 is implemented by: dividing the task table into a task main table and a task detail table, and splitting and assembling task data of the 2 task tables into task structures according to the following rules:
A. if the task details under one task main table all use the same equipment, the task details under the task main table are all merged into the same task;
B. if the detail in the task main table uses a plurality of devices, sorting according to the execution sequence number, continuously dividing the detail using the same device into one task, and establishing a task with a dependency relationship pointing to the previous sequence number for the task behind the sequence number;
after the division is finished, establishing a dependency relationship among the tasks;
during the production, the task which is not depended by any task is taken as a root node task, the equipment is firstly distributed from the root node task, and the deadline time is set for the root node task.
3. The method for allocating equipment in food processing production according to claim 2, wherein the step S4 is implemented by:
s41, inquiring all available equipment, and setting single capacity corresponding to different commodities for each available equipment:
s42, judging whether the user appoints the number of the devices, if so, taking out the devices with the appointed number from each device type and putting the devices into a set to be used; if the user does not specify the number of devices, only one device is taken out of each device type and put into the set to be used.
4. The method for allocating equipment in food processing production according to claim 3, wherein the step S5 is implemented by:
s51, finding out all root node tasks in the task set, arranging the root node tasks in a reverse order according to task cutting time, and then sequentially distributing equipment for all the root node tasks;
s52, searching the upper level depended task from the root node task, calculating the detailed dependence time and dependence yield of the depended task, and then distributing equipment for the depended task; then repeating the step until all tasks are distributed;
s53, judging whether the scheduling plan meets the appointed deadline, if so, if the scheduling plan meets the appointed deadline, and if the scheduling plan chooses the least occupied equipment, finishing the scheduling successfully;
if the scheduling is not completed within the specified deadline time or the scheduling type is selected to be the shortest execution time, judging which equipment is lacked according to the last scheduling result, adding one additional equipment to the lacked equipment, adding the equipment to the equipment set to be used, and performing scheduling again.
5. The method according to claim 4, wherein the assigning of the device to the root node task in step S51 satisfies the following two conditions:
A. the tasks are evenly distributed on all available devices;
B. under the condition that the time is not conflicted, the used equipment is preferentially used;
the method specifically comprises the following substeps:
s511, dividing the total demand of the tasks by the single productivity of the equipment to obtain the times of the tasks needing to be executed, and sequentially allocating equipment for the root node tasks by taking the one-time execution of one task in one equipment as the minimum granularity;
s512, in the device set of the device type, searching whether devices which are used by other tasks but occupy time of the other tasks and have no conflict with the current task exist, if so, executing a step S514, otherwise, executing a step S513;
s513, searching whether new equipment exists or not, and if so, adding the new equipment into an equipment set;
s514, searching the device with the latest starting occupation time in the device set, and judging whether the time difference between the device with the earliest starting occupation time is enough to execute the current task; if yes, go to step S516, otherwise go to step S515;
s515, checking whether a task capable of being replaced exists, if so, replacing the task and reallocating equipment for the replaced task; otherwise, the capacity of the current equipment type is insufficient;
s516, directly adding the task to the device which starts to execute the time at the latest.
6. The method as claimed in claim 5, wherein in step S515, the task replacement is implemented by: finding out the device with the same id as the current task from the used device set; if the same task is not executed in the previous equipment, searching the equipment with the largest number of executed tasks; in the found device, the task to be replaced is found: firstly, calculating the difference value from the earliest starting time of the same type of equipment to the earliest starting time of the current equipment, and subtracting the difference value by the task working hours to obtain the task working hours needing to be replaced; replacing other types of tasks occupied by the current equipment from morning to evening in sequence until the replaced task man-hour meets the required task man-hour calculated in the last step; the current task is put in a position before the replaced task, and then the replaced task is redistributed to the equipment.
7. The method for allocating equipment in food processing production according to claim 5, wherein the step S52 is implemented by:
s521, finding out all tasks depended on by the root node task through the root node task;
s522, marking each task to be depended on by which downstream tasks;
s523, calculating the dependent quantity of each time point of the downstream task;
s524, finding out the earliest starting execution time and the latest deadline of all the downstream tasks; taking the single execution man-hour of the depended task as a segment, and dividing the segment into a plurality of segments from the earliest start of execution time to the later;
s525, calculating the execution minutes of the downstream task in each time period, and then calculating the output of the downstream task per minute, thereby obtaining the output of the downstream task in each time period;
s526, multiplying the output by the dependence proportion calculated during task initialization to obtain the demand of the depended task in each time period;
s527, the depended task is divided into a plurality of subtasks, and then equipment is allocated to the subtasks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011372028.XA CN112488503B (en) | 2020-11-30 | 2020-11-30 | Equipment distribution method in food processing production |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011372028.XA CN112488503B (en) | 2020-11-30 | 2020-11-30 | Equipment distribution method in food processing production |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112488503A true CN112488503A (en) | 2021-03-12 |
| CN112488503B CN112488503B (en) | 2023-08-15 |
Family
ID=74937225
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011372028.XA Active CN112488503B (en) | 2020-11-30 | 2020-11-30 | Equipment distribution method in food processing production |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112488503B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112966976A (en) * | 2021-03-31 | 2021-06-15 | 英特尔产品（成都）有限公司 | Method and device for scheduling production of production facility |
| CN115660388A (en) * | 2022-12-27 | 2023-01-31 | 大方智造(天津)科技有限公司 | Earliest finished operation plan scheduling method based on process constraint |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120124585A1 (en) * | 2010-11-12 | 2012-05-17 | International Business Machines Corporation | Increasing Parallel Program Performance for Irregular Memory Access Problems with Virtual Data Partitioning and Hierarchical Collectives |
| CN103632220A (en) * | 2013-10-22 | 2014-03-12 | 沈阳建筑大学 | Semiconductor packaging line bonding equipment organization method based on processing task capability matching |
| CN105427021A (en) * | 2015-10-30 | 2016-03-23 | 江苏云道信息技术有限公司 | Intelligent clothes production scheduling method |
| US20160306679A1 (en) * | 2015-04-20 | 2016-10-20 | International Business Machines Corporation | Managing hydrocarbon energy production while proactively maintaining a balanced workload |
| CN110555665A (en) * | 2019-08-02 | 2019-12-10 | 杉数科技(北京)有限公司 | production plan generation method and device |
| CN111813066A (en) * | 2020-07-17 | 2020-10-23 | 北京理工大学 | Multi-processing robot cooperation method for hardware flexible production workshop |
| CN111967706A (en) * | 2020-06-28 | 2020-11-20 | 浙江中控技术股份有限公司 | Interaction method and device of PVC factory integrated management system |
-
2020
- 2020-11-30 CN CN202011372028.XA patent/CN112488503B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120124585A1 (en) * | 2010-11-12 | 2012-05-17 | International Business Machines Corporation | Increasing Parallel Program Performance for Irregular Memory Access Problems with Virtual Data Partitioning and Hierarchical Collectives |
| CN103632220A (en) * | 2013-10-22 | 2014-03-12 | 沈阳建筑大学 | Semiconductor packaging line bonding equipment organization method based on processing task capability matching |
| US20160306679A1 (en) * | 2015-04-20 | 2016-10-20 | International Business Machines Corporation | Managing hydrocarbon energy production while proactively maintaining a balanced workload |
| CN105427021A (en) * | 2015-10-30 | 2016-03-23 | 江苏云道信息技术有限公司 | Intelligent clothes production scheduling method |
| CN110555665A (en) * | 2019-08-02 | 2019-12-10 | 杉数科技(北京)有限公司 | production plan generation method and device |
| CN111967706A (en) * | 2020-06-28 | 2020-11-20 | 浙江中控技术股份有限公司 | Interaction method and device of PVC factory integrated management system |
| CN111813066A (en) * | 2020-07-17 | 2020-10-23 | 北京理工大学 | Multi-processing robot cooperation method for hardware flexible production workshop |
Non-Patent Citations (3)
| Title |
|---|
| QINGQING ZHAI: ""Reliability analysis of cold standby system with scheduled backups"", 《2015 ANNUAL RELIABILITY AND MAINTAINABILITY SYMPOSIUM (RAMS)》, pages 287 * |
| 张鲁: ""基于任务包的造船生产资源配置"", 《造船技术》, no. 5, pages 6 - 11 * |
| 白程宇: ""订单分配与批量计划集成优化方法研究"", 《中国优秀硕士学位论文全文数据库基础科学辑》, no. 08, pages 002 - 324 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112966976A (en) * | 2021-03-31 | 2021-06-15 | 英特尔产品（成都）有限公司 | Method and device for scheduling production of production facility |
| CN115660388A (en) * | 2022-12-27 | 2023-01-31 | 大方智造(天津)科技有限公司 | Earliest finished operation plan scheduling method based on process constraint |
| CN115660388B (en) * | 2022-12-27 | 2023-08-18 | 大方智造(天津)科技有限公司 | Earliest finished operation plan scheduling method based on process constraint |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112488503B (en) | 2023-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4648023A (en) | Method for resource allocation for the manufacture of a product | |
| CN112488503B (en) | Equipment distribution method in food processing production | |
| CN105279595A (en) | Restaurant meal preparation scheduling management system and method thereof | |
| CN112132546A (en) | Method and device for scheduling production | |
| CN110516936B (en) | Intelligent production line allocation system | |
| US7356376B1 (en) | Work when ready load balancing using critical dates | |
| JPH10261122A (en) | Work distribution optimization method | |
| JPH09153090A (en) | Method and device for forming working process production plan | |
| JP5309882B2 (en) | Schedule creation system, schedule creation method, and schedule creation program | |
| JP2008004053A (en) | Device, method and program for supporting working staff assignment | |
| CN115239173A (en) | Scheduling plan generation method and device, electronic equipment and storage medium | |
| CN111105133B (en) | Production scheduling method, computer device, and storage medium | |
| CN113793203A (en) | Order processing method and device | |
| CN113469499A (en) | Production scheduling method, device and storage medium | |
| JP2013171481A (en) | Process plan creation system | |
| Berkhout et al. | Short-term production scheduling with non-triangular sequence-dependent setup times and shifting production bottlenecks | |
| JPWO2019064789A1 (en) | Recommended order quantity determination device, recommended order quantity determination method and recommended order quantity determination program | |
| JP6005535B2 (en) | Production plan creation device, production plan creation method, and production plan creation program | |
| CN102542364A (en) | Method and system for balancing substitute materials in material requirement planning | |
| JP2002351527A (en) | Production schedule planning method for blanking | |
| CN113095704A (en) | Production plan scheduling method, device, equipment and medium | |
| JP2007164580A (en) | Production control system | |
| JP2003263213A (en) | Production management system and production management method | |
| US20230237397A1 (en) | Method and system for production optimization | |
| JP2004145591A (en) | System and method for distributing production capacity |
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 |