CN112488503B - Equipment distribution method in food processing production - Google Patents
Equipment distribution method in food processing production Download PDFInfo
- Publication number
- CN112488503B CN112488503B CN202011372028.XA CN202011372028A CN112488503B CN 112488503 B CN112488503 B CN 112488503B CN 202011372028 A CN202011372028 A CN 202011372028A CN 112488503 B CN112488503 B CN 112488503B
- 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.)
- Active
Links
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 52
- 238000000034 method Methods 0.000 title claims abstract description 31
- 235000013305 food Nutrition 0.000 title claims abstract description 15
- 238000009826 distribution Methods 0.000 title abstract description 8
- 239000002994 raw material Substances 0.000 claims abstract description 9
- 239000000470 constituent Substances 0.000 claims abstract description 4
- 230000001419 dependent effect Effects 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 238000012216 screening Methods 0.000 claims description 3
- 235000013372 meat Nutrition 0.000 description 5
- 235000008534 Capsicum annuum var annuum Nutrition 0.000 description 4
- 240000008384 Capsicum annuum var. annuum Species 0.000 description 4
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 235000020991 processed meat Nutrition 0.000 description 1
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 a food purchase order transmitted from a third party platform; s2, generating a production task according to the commodity demand time in the order, the commodity processing flow and the constituent raw materials, and generating a purchasing task according to the difference between the current stock quantity and the processing raw material demand; s3, initializing a production task; s4, initializing production equipment; s5, carrying out production scheduling operation. The invention can effectively meet the requirement that a factory is required to produce at the same time in a plurality of production tasks, and can automatically sequence 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 a device distribution method in food processing production.
Background
At present, most production enterprises process the products according to the established production process flow and raw material composition of the commodities by adopting an original manual distribution and recording in an electronic table after receiving the summary of downstream orders, production task sequencing and equipment distribution data are still carried out in a fixed mode in a production link by adopting a manual distribution mode, the arranged production task scheduling data are delivered to actual production executors, and then manual adjustment and optimization are carried out on the scheduling data according to the historical working experience of the production executors.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, and provides the equipment allocation method in food processing production, which can effectively meet the requirement of simultaneous production of a plurality of production tasks in a factory, and can automatically sequence tasks and allocate equipment under the condition of dependency, thereby improving the production efficiency and equipment utilization rate of enterprises and reducing labor cost.
The aim of the invention is realized by the following technical scheme: a method of dispensing equipment in food processing production comprising the steps of:
s1, receiving and storing a food purchase order transmitted from a third party platform;
s2, generating a production task according to the commodity demand time in the order, the commodity processing flow and the constituent raw materials, and generating a purchasing task according to the difference between the current stock quantity and the processing raw material demand;
s3, initializing a production task;
s4, initializing production equipment;
s5, carrying out production scheduling operation.
Further, the specific implementation method of the step S3 is as follows: dividing a task list into a task main list and a task detail list, and splitting and assembling task data of 2 task lists into a task structure according to the following rules:
A. if the task details under one task main table all use the same device, the details under the task main table are combined into the same task;
B. if the details under a task main table use a plurality of devices, sequencing according to the execution sequence numbers, dividing the details continuously using the same device into a task, and establishing a dependency relationship for the task with a later sequence number to point to the task with a previous sequence number;
after division, establishing a dependency relationship between tasks;
when the task is scheduled, taking the task which is not depended on by any task as a root node task, firstly starting to distribute equipment from the root node task, and setting the deadline for the root node task;
further, the specific implementation method of the step S4 is as follows:
s41, inquiring all available equipment, and setting single productivity corresponding to different commodities for each available equipment:
s42, judging whether the user designates the number of the devices, if so, taking out the designated number of the devices 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 type is taken out of each device type and put into the set to be used.
Further, the specific implementation method of the step S5 is as follows:
s51, finding out all root node tasks in a task set, arranging the root node tasks in an inverted order according to the time of the task interception, and then sequentially distributing equipment for all the root node tasks;
s52, searching the task which is relied on at the upper stage from the root node task, calculating the detailed dependence time and the dependence yield of the relied task, and then distributing equipment for the relied task; then repeating the step until all tasks are distributed;
s53, judging whether the scheduling plan meets the specified deadline, if so, and if the scheduling type is selected to occupy the least equipment, successfully ending the scheduling;
if the operation is not completed within the specified deadline or the operation type is selected to have the shortest execution time, judging according to the last operation result, screening out which equipment is absent, adding one missing equipment into the equipment set to be used, and carrying out one-time operation again.
Further, the task allocation device for the root node in step S51 needs to satisfy the following two conditions:
A. tasks are to be evenly distributed across all available devices;
B. in case of no time conflict, the used equipment is preferentially used;
the method specifically comprises the following substeps:
s511, dividing the total demand of the tasks by the single capacity of the device to obtain the number of times the tasks need to be executed, and sequentially distributing the device for the root node tasks by taking one task executed once in one device as the minimum granularity;
s512, searching whether equipment which is used by other tasks but has no conflict with other tasks exists in the equipment set of the equipment type, if so, executing a step S514, otherwise, executing a step S513;
s513, searching whether new equipment exists, and if so, adding the new equipment into the equipment set;
s514, searching the device with the latest time of occupation from the device set, and judging whether the time difference between the device with the earliest time of occupation and the device with the earliest time of occupation is enough to execute the current task; if yes, executing step S516, otherwise executing step S515;
s515, checking whether a task capable of being replaced exists, if so, replacing the task and reassigning equipment for the replaced task; otherwise, the productivity of the current equipment type is insufficient;
s516, directly adding tasks on the device with the latest starting execution time.
Further, in the step S515, the specific implementation method of task replacement is as follows: finding out the equipment which is the same as the current task id in the used equipment set; if the same task is not executed in the previous equipment, searching the equipment with the most tasks; in the searched device, the task to be replaced is found: firstly calculating a 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 from the working hours of the task to obtain the working hours of the task which need to be replaced; sequentially replacing other types of tasks occupied by the current equipment from the morning to the evening until the replaced task man-hour meets the required task man-hour calculated in the last step; the current task is placed in a position before the replaced task and then the device is reassigned for the replaced task.
Further, the specific implementation method of the step S52 is as follows:
s521, finding out all tasks relied on by the root node task through the root node task;
s522, marking which downstream tasks each task depends on;
s523, calculating the dependency quantity of each time point of the downstream task;
s524, finding out the earliest start execution time and the latest deadline of all downstream tasks; taking the single execution time of the dependent task as a section, and dividing the section into a plurality of small sections from the earliest starting execution time to the latest starting execution time;
s525, calculating the execution minutes of the downstream task in each time period, and calculating the output of the downstream task in each minute, so as to obtain the output of the downstream task in each time period;
s526, multiplying the output quantity by the dependence ratio calculated during task initialization to obtain the demand quantity of the dependent task in each time period;
s527, dividing the dependent task into a plurality of subtasks, and then distributing devices for the subtasks.
The beneficial effects of the invention are as follows: the invention can effectively meet the requirement that a factory is required to produce at the same time in a plurality of production tasks, and can automatically sequence 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 an apparatus distribution method in food processing production of the present invention.
Detailed Description
The technical scheme of the invention is further described below with reference to the accompanying drawings.
As shown in fig. 1, a method for distributing equipment in food processing production according to the present invention comprises the steps of:
s1, receiving and storing food purchase orders transmitted from a third party platform (e-commerce platform, ERP system and the like); according to the data corresponding mode agreed with the three-party platform, converting the order uploaded by the three-party platform into an order data format which can be identified in the processing system;
s2, generating production tasks according to the commodity demand time in the order, the commodity processing flow and the constituent raw materials, generating the production tasks according to the processing flow (the production tasks are generated according to steps and have mutual dependency relations), and generating purchasing tasks according to the difference between the current stock quantity and the processing raw material demand quantity;
a process flow may be broken down into a number of process steps, such as: the processing flow of the pot-back meat can be divided into meat slice processing (processing whole meat into meat slices), green pepper segment processing (processing whole green pepper into green pepper segments), dish frying (combining processed meat slices and processed green pepper segments into the pot-back meat), so that one flow is divided into 3 processing tasks.
The processing flow of one commodity needs to generate several production tasks, which is determined by the setting of a 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 producing and processing A21, A22 and A23, and the like. Then the items A, A, A2, A3 are all work products and then 4 production tasks are generated. While A1, A2, A3 may be processed not only as a commodity, they may also be present in BOM sheets of other commodities as part of another commodity. 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 a task list into a task main list and a task detail list, and splitting and assembling task data of 2 task lists into a task structure according to the following rules:
A. if the task details under one task main table all use the same device, the details under the task main table are combined into the same task;
B. if the details under a task main table use a plurality of devices, sequencing according to the execution sequence numbers, dividing the details continuously using the same device into a task, and establishing a dependency relationship for the task with a later sequence number to point to the task with a previous sequence number;
after division, establishing a dependency relationship between tasks;
when the task is scheduled, taking the task which is not depended on by any task as a root node task, firstly starting to distribute equipment from the root node task, and setting the deadline for the root node task;
the main information of the production task comprises: product, planned production quantity, planned output 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 productivity corresponding to different commodities for each available equipment:
s42, judging whether the user designates the number of the devices, if so, taking out the designated number of the devices 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 type is taken out of each device type and put into the set to be used.
S5, carrying out production scheduling operation; the specific implementation method comprises the following steps:
s51, finding out all root node tasks in a task set, arranging the root node tasks in an inverted order according to the time of the task interception, and then sequentially distributing equipment for all the root node tasks; the following two conditions are required to be satisfied for the root node task allocation device:
A. tasks are to be evenly distributed across all available devices;
B. in case of no time conflict, the used equipment is preferentially used;
the method specifically comprises the following substeps:
s511, dividing the total demand of the tasks by the single capacity of the device to obtain the number of times the tasks need to be executed, and sequentially distributing the device for the root node tasks by taking one task executed once in one device as the minimum granularity;
s512, searching whether equipment which is used by other tasks but has no conflict with other tasks exists in the equipment set of the equipment type, if so, executing a step S514, otherwise, executing a step S513;
s513, searching whether new equipment exists, and if so, adding the new equipment into the equipment set;
s514, searching the device with the latest time of occupation from the device set, and judging whether the time difference between the device with the earliest time of occupation and the device with the earliest time of occupation is enough to execute the current task; if yes, executing step S516, otherwise executing step S515;
s515, checking whether a task capable of being replaced exists, if so, replacing the task and reassigning equipment for the replaced task; otherwise, the productivity of the current equipment type is insufficient;
the specific implementation method of task replacement comprises the following steps: finding out the equipment which is the same as the current task id in the used equipment set; if the same task is not executed in the previous equipment, searching the equipment with the most tasks; in the searched device, the task to be replaced is found: firstly calculating a 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 from the working hours of the task to obtain the working hours of the task which need to be replaced; sequentially replacing other types of tasks occupied by the current equipment from the morning to the evening until the replaced task man-hour meets the required task man-hour calculated in the last step; the current task is placed in a position before the replaced task and then the device is reassigned for the replaced task.
S516, directly adding tasks on the device with the latest starting execution time.
S52, searching the task which is relied on at the upper stage from the root node task, calculating the detailed dependence time and the dependence yield of the relied task, and then distributing equipment for the relied task; then repeating the step until all tasks are distributed;
the specific implementation method comprises the following steps:
s521, finding out all tasks relied on by the root node task through the root node task;
s522, marking which downstream tasks each task depends on;
s523, calculating the dependency quantity of each time point of the downstream task;
s524, finding out the earliest start execution time and the latest deadline of all downstream tasks; taking the single execution time of the dependent task as a section, and dividing the section into a plurality of small sections from the earliest starting execution time to the latest starting execution time;
s525, calculating the execution minutes of the downstream task (which is produced in advance) in each time period, and calculating the output of the downstream task in each minute, thereby obtaining the output of the downstream task in each time period;
s526, multiplying the output quantity by the dependence ratio calculated during task initialization to obtain the demand quantity of the dependent task in each time period;
s527, dividing the dependent task into a plurality of subtasks, and then distributing devices for the subtasks.
S53, judging whether the scheduling plan meets the specified deadline, if so, and if the scheduling type is selected to occupy the least equipment, successfully ending the scheduling;
if the operation is not completed within the specified deadline or the operation type is selected to have the shortest execution time, judging according to the last operation result, screening out which equipment is absent, adding one missing equipment into the equipment set to be used, and carrying out one-time operation again. Finally, the production task scheduling data with non-overlapping time, non-overlapping equipment occupation and production completion time earlier than order demand time is obtained.
The presentation content of the production task bar Cheng Xiangqing page of the embodiment is shown in the following table:
those of ordinary skill in the art will recognize that the embodiments described herein are for the purpose of aiding the reader in understanding the principles of the present invention and should be understood that the scope of the invention is not limited to such specific statements and embodiments. Those of ordinary skill in the art can make various other specific modifications and combinations from the teachings of the present disclosure without departing from the spirit thereof, and such modifications and combinations remain within the scope of the present disclosure.
Claims (4)
1. A method of distributing equipment in food processing production comprising the steps of:
s1, receiving and storing a food purchase order transmitted from a third party platform;
s2, generating a production task according to the commodity demand time in the order, the commodity processing flow and the constituent raw materials, and generating a purchasing task according to the difference between the current stock quantity and the processing raw material demand;
s3, initializing a production task; the specific implementation method comprises the following steps: dividing a task list into a task main list and a task detail list, and splitting and assembling task data of 2 task lists into a task structure according to the following rules:
A. if the task details under one task main table all use the same device, the details under the task main table are combined into the same task;
B. if the details under a task main table use a plurality of devices, sequencing according to the execution sequence numbers, dividing the details continuously using the same device into a task, and establishing a dependency relationship for the task with a later sequence number to point to the task with a previous sequence number;
after division, establishing a dependency relationship between tasks;
when the task is scheduled, taking the task which is not depended on by any task as a root node task, firstly starting to distribute equipment from the root node task, and setting the deadline for the root node task;
s4, initializing production equipment; the specific implementation method comprises the following steps:
s41, inquiring all available equipment, and setting single productivity corresponding to different commodities for each available equipment:
s42, judging whether the user designates the number of the devices, if so, taking out the designated number of the devices from each device type and putting the devices into a set to be used; if the user does not specify the number of the devices, only one device is taken out of each device type and put into a set to be used;
s5, carrying out production scheduling operation; the specific implementation method comprises the following steps:
s51, finding out all root node tasks in a task set, arranging the root node tasks in an inverted order according to the time of the task interception, and then sequentially distributing equipment for all the root node tasks;
s52, searching the task which is relied on at the upper stage from the root node task, calculating the detailed dependence time and the dependence yield of the relied task, and then distributing equipment for the relied task; then repeating the step until all tasks are distributed;
s53, judging whether the scheduling plan meets the specified deadline, if so, and if the scheduling type is selected to occupy the least equipment, successfully ending the scheduling;
if the operation is not completed within the specified deadline or the operation type is selected to have the shortest execution time, judging according to the last operation result, screening out which equipment is absent, adding one missing equipment into the equipment set to be used, and carrying out one-time operation again.
2. The method according to claim 1, wherein the following two conditions are satisfied for the root node task allocation device in step S51:
A. tasks are to be evenly distributed across all available devices;
B. in case of no time conflict, the used equipment is preferentially used;
the method specifically comprises the following substeps:
s511, dividing the total demand of the tasks by the single capacity of the device to obtain the number of times the tasks need to be executed, and sequentially distributing the device for the root node tasks by taking one task executed once in one device as the minimum granularity;
s512, searching whether equipment which is used by other tasks but has no conflict with other tasks exists in the equipment set of the equipment type, if so, executing a step S514, otherwise, executing a step S513;
s513, searching whether new equipment exists, and if so, adding the new equipment into the equipment set;
s514, searching the device with the latest time of occupation from the device set, and judging whether the time difference between the device with the earliest time of occupation and the device with the earliest time of occupation is enough to execute the current task; if yes, executing step S516, otherwise executing step S515;
s515, checking whether a task capable of being replaced exists, if so, replacing the task and reassigning equipment for the replaced task; otherwise, the productivity of the current equipment type is insufficient;
s516, directly adding tasks on the device with the latest starting execution time.
3. The method for distributing equipment in food processing and production according to claim 2, wherein in step S515, the task replacement is specifically implemented by: finding out the equipment which is the same as the current task id in the used equipment set; if the same task is not executed in the previous equipment, searching the equipment with the most tasks; in the searched device, the task to be replaced is found: firstly calculating a 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 from the working hours of the task to obtain the working hours of the task which need to be replaced; sequentially replacing other types of tasks occupied by the current equipment from the morning to the evening until the replaced task man-hour meets the required task man-hour calculated in the last step; the current task is placed in a position before the replaced task and then the device is reassigned for the replaced task.
4. The method for distributing equipment in food processing and production according to claim 2, wherein the step S52 is specifically implemented by:
s521, finding out all tasks relied on by the root node task through the root node task;
s522, marking which downstream tasks each task depends on;
s523, calculating the dependency quantity of each time point of the downstream task;
s524, finding out the earliest start execution time and the latest deadline of all downstream tasks; taking the single execution time of the dependent task as a section, and dividing the section into a plurality of small sections from the earliest starting execution time to the latest starting execution time;
s525, calculating the execution minutes of the downstream task in each time period, and calculating the output of the downstream task in each minute, so as to obtain the output of the downstream task in each time period;
s526, multiplying the output quantity by the dependence ratio calculated during task initialization to obtain the demand quantity of the dependent task in each time period;
s527, dividing the dependent task into a plurality of subtasks, and then distributing devices for 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 CN112488503A (en) | 2021-03-12 |
| CN112488503B true 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) |
Families Citing this family (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 |
| CN115660388B (en) * | 2022-12-27 | 2023-08-18 | 大方智造(天津)科技有限公司 | Earliest finished operation plan scheduling method based on process constraint |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8869155B2 (en) * | 2010-11-12 | 2014-10-21 | International Business Machines Corporation | Increasing parallel program performance for irregular memory access problems with virtual data partitioning and hierarchical collectives |
| EP3086229A1 (en) * | 2015-04-20 | 2016-10-26 | Repsol, S.A. | Managing hydrocarbon energy production while proactively maintaining a balanced workload |
-
2020
- 2020-11-30 CN CN202011372028.XA patent/CN112488503B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 (1)
| Title |
|---|
| "订单分配与批量计划集成优化方法研究";白程宇;《中国优秀硕士学位论文全文数据库基础科学辑》(第08期);A002-324 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112488503A (en) | 2021-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112488503B (en) | Equipment distribution method in food processing production | |
| CN113344338B (en) | Production scheduling method, system, equipment, medium and production scheduling management platform | |
| CN101329746A (en) | System and method for automatically arranging production plan | |
| CN105279595A (en) | Restaurant meal preparation scheduling management system and method thereof | |
| CN112132546A (en) | Method and device for scheduling production | |
| US7356376B1 (en) | Work when ready load balancing using critical dates | |
| CN101533490B (en) | Processing optimization method for processing equipment of workshop | |
| CN110516936A (en) | A kind of intelligence production line mixing system | |
| JP5309882B2 (en) | Schedule creation system, schedule creation method, and schedule creation program | |
| JP2008004053A (en) | Device, method and program for supporting working staff assignment | |
| CN108445853B (en) | Productivity sharing workshop based on cloud data | |
| CN108510151A (en) | Generate method, information processing equipment and the computer-readable medium of task scheduling | |
| Albrecht et al. | Continuous-time scheduling of production, distribution and sales in photovoltaic supply chains with declining prices | |
| CN113793203A (en) | Order processing method and device | |
| CN113837611A (en) | Automatic worker dispatching recommendation method and system | |
| CN113469499A (en) | Production scheduling method, device and storage medium | |
| JP2014092874A (en) | Shipping management system and method | |
| Neidigh et al. | Optimising lot sizing with nonlinear production rates in a multi-product single-machine environment | |
| Sawik | Multi-objective due-date setting in a make-to-order environment | |
| JP4269539B2 (en) | Production planning method in planing | |
| US20040122724A1 (en) | System and method for generating priorities of manufacturing orders | |
| CN113095704A (en) | Production plan scheduling method, device, equipment and medium | |
| CN111260322A (en) | Discrete manufacturing industry work order scheduling improvement method | |
| JPH11224297A (en) | Price predicting and article dealing method for market-price article transaction | |
| CN111489043A (en) | MPS-based enterprise medium and long term production planning system and method |
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 |