CN108073142B - Scheduling method and device for job shop resources - Google Patents
Scheduling method and device for job shop resources Download PDFInfo
- Publication number
- CN108073142B CN108073142B CN201611001077.6A CN201611001077A CN108073142B CN 108073142 B CN108073142 B CN 108073142B CN 201611001077 A CN201611001077 A CN 201611001077A CN 108073142 B CN108073142 B CN 108073142B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- current
- equipment
- current unlocking
- bottleneck
- 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
- 238000000034 method Methods 0.000 title claims abstract description 256
- 238000012545 processing Methods 0.000 claims description 23
- 238000004519 manufacturing process Methods 0.000 abstract description 16
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000003754 machining Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000005096 rolling process Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000000712 assembly Effects 0.000 description 1
- 238000000429 assembly Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- DJGAAPFSPWAYTJ-UHFFFAOYSA-M metamizole sodium Chemical compound [Na+].O=C1C(N(CS([O-])(=O)=O)C)=C(C)N(C)N1C1=CC=CC=C1 DJGAAPFSPWAYTJ-UHFFFAOYSA-M 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003825 pressing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000002269 spontaneous effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000007514 turning Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/32—Operator till task planning
- G05B2219/32252—Scheduling production, machining, job shop
-
- 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/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a device for scheduling job shop resources, wherein the method for scheduling the job shop resources comprises the following steps: acquiring a current unlocking process set and a current unlocking equipment set in real time; obtaining a bottleneck factor value of each type of resources according to the current unlocking procedure set and the current unlocking equipment set; establishing a bottleneck equipment pyramid model according to the bottleneck factor value; performing resource scheduling according to the bottleneck equipment pyramid model; the current unlocking process set is a set of unprocessed processes of which the preorder processes are finished, and the current unlocking equipment set is a set of current idle equipment. According to the scheme, the resource scheduling is carried out by establishing the pyramid model of the bottleneck equipment and further combining the idle conditions of various resources, so that the coordination of the scheduling scheme among the resources can be improved, the occurrence of production disturbance events is reduced, and the plan performability is improved; and the method provides assistance for dispatching personnel to carry out workshop dispatching.
Description
Technical Field
The invention relates to the technical field of manufacturing, in particular to a method and a device for scheduling job shop resources.
Background
The conventional job shop scheduling problem is usually the nxm scheduling problem, which specifies that one process can be processed on only one device. With the increasing demand of personalized customization, most of actual production and manufacture show the characteristics of multiple varieties, variable batches and the like, and machine tools can be produced under the parallel condition. For the problem of scheduling of job shops with parallel machines, one process can be processed on multiple devices of the same type. Therefore, the solution of the scheduling problem changes from the original method of selecting a proper process for a single device to the current method of selecting multiple processes for multiple devices for processing. The one-to-one to many-to-many conversion not only increases the optional range of devices, but also makes the difference of different types of devices in bottleneck degree due to the appearance of parallel machines.
In the face of the complex and multi-resource associated scheduling problem under the multi-variety, variable-batch and mixed-line production, a feasible research scheme needs to be formed by collaborative solution. Traditional heuristic rules and intelligent optimization algorithms for solving scheduling problems play a role of a decision layer, and the whole scheduling is covered from top to bottom. The top-down scheduling lack of mutual coordination and communication among devices can generate more sudden production disturbance events which are difficult to respond in time, so that the situation that the plan cannot catch up with the change frequently occurs; in addition, the traditional multi-agent technology depends on spontaneous and local coordination, and the overall comprehensive optimization is difficult to ensure; or the multiple intelligent agents fight each other, so that no overall planning is available, and the stability of the algorithm is difficult to ensure.
Disclosure of Invention
The invention aims to provide a method and a device for scheduling job shop resources, which solve the problems of lagged scheduling scheme and low stability of job shop resources in the prior art.
In order to solve the above technical problem, an embodiment of the present invention provides a method for scheduling job shop resources, including:
acquiring a current unlocking process set and a current unlocking equipment set in real time;
obtaining a bottleneck factor value of each type of resources according to the current unlocking procedure set and the current unlocking equipment set;
establishing a bottleneck equipment pyramid model according to the bottleneck factor value;
performing resource scheduling according to the bottleneck equipment pyramid model;
wherein the current unlocking process set is a set of unprocessed processes of which the previous processes are finished,
the current set of unlocked devices is a set of current idle devices.
Optionally, the step of obtaining the bottleneck factor value of each type of resource according to the current unlocking procedure set and the current unlocking device set includes:
obtaining the number of idle resources in each type of resources and the number of corresponding current unlocking processes according to the current unlocking process set and the current unlocking equipment set;
and obtaining the bottleneck factor value of each type of resource according to the number of the idle resources and the number of the corresponding current unlocking processes.
Optionally, the step of establishing a bottleneck device pyramid model according to the bottleneck factor value includes:
sequentially arranging the bottleneck factor values in a descending order, and establishing a bottom-layer to top-layer bottleneck equipment pyramid model;
and the resources with the same bottleneck factor value are positioned at the same layer of the bottleneck equipment pyramid model.
Optionally, the step of performing resource scheduling according to the pyramid model of the bottleneck device includes:
obtaining a bottleneck factor value corresponding to the current layer from the bottom layer of the pyramid model of the bottleneck device;
and carrying out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer until the current unlocking procedure set is zero.
Optionally, the step of performing corresponding resource scheduling according to the positive or negative of the bottleneck factor value corresponding to the current layer includes:
when the bottleneck factor value corresponding to the current layer is a positive value, arranging the current unlocking procedure of the current layer to any equipment with a corresponding number in the current unlocking equipment set;
when the bottleneck factor value corresponding to the current layer is a negative value, judging whether the current layer is judged to be the top layer or not to obtain a first judgment result;
acquiring process information corresponding to each type of resource in the current unlocking equipment set according to the first judgment result;
and scheduling resources according to the process information.
Optionally, the step of obtaining process information corresponding to each type of resource in the current unlocked device set according to the first determination result includes:
when the first judgment result is yes, acquiring the working hours required by each current unlocking procedure corresponding to each type of resources in the current unlocking equipment set;
the step of scheduling resources according to the process information includes:
arranging the working hours according to a descending order to obtain a scheduling sequence;
and sequentially arranging the current unlocking procedure corresponding to the working hours to one device corresponding to the resources according to the scheduling sequence until the idle device corresponding to the resources is arranged.
Optionally, the step of obtaining process information corresponding to each type of resource in the current unlocked device set according to the first determination result includes:
when the first judgment result is negative, acquiring the process information to be unlocked and the current unlocking process information corresponding to each type of resource in the current unlocking equipment set;
the information of the procedure to be unlocked comprises the time interval between the starting time of the procedure to be unlocked and the current time, and the information of the current unlocking procedure comprises the working hours required by the current unlocking procedure and the total unprocessed working hours of the corresponding workpiece;
the step of scheduling resources according to the process information includes:
and scheduling resources according to the time interval, the working hours and the total unprocessed working hours.
Optionally, the step of scheduling resources according to the time interval, the working hours, and the total unprocessed working hours includes:
establishing a corresponding relation between the time interval and the working hours of which the difference value with the time interval is smaller than a preset threshold value;
and scheduling resources according to the corresponding relation or the corresponding relation and the total unprocessed working hours.
Optionally, the step of scheduling resources according to the corresponding relationship, or the corresponding relationship and the total unprocessed hour, includes:
firstly, arranging the workpieces corresponding to the procedure to be unlocked and the current unlocking procedure to corresponding equipment, wherein the corresponding relation is one-to-one;
then arranging the corresponding relation to be one-to-many, arranging the workpieces corresponding to the to-be-unlocked process to corresponding equipment, and correspondingly arranging the current unlocking process to the corresponding equipment according to the sequence of the total unprocessed work hours which are sequentially reduced;
and arranging the current unlocking procedure without the corresponding relation to the corresponding equipment according to the sequence that the total unprocessed working hours are reduced in sequence.
Optionally, after performing corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer, the method further includes:
and updating the current unlocking procedure set and the current unlocking equipment set.
The invention also provides a device for scheduling the resources of the job shop, which comprises:
the acquisition module is used for acquiring a current unlocking procedure set and a current unlocking equipment set in real time;
the processing module is used for obtaining the bottleneck factor value of each type of resource according to the current unlocking process set and the current unlocking equipment set;
the establishing module is used for establishing a bottleneck equipment pyramid model according to the bottleneck factor value;
the scheduling module is used for scheduling resources according to the bottleneck equipment pyramid model;
wherein the current unlocking process set is a set of unprocessed processes of which the previous processes are finished,
the current set of unlocked devices is a set of current idle devices.
Optionally, the processing module includes:
the first processing submodule is used for obtaining the number of idle resources in each type of resource and the number of corresponding current unlocking procedures according to the current unlocking procedure set and the current unlocking equipment set;
and the second processing submodule is used for obtaining the bottleneck factor value of each type of resource according to the number of the idle resources and the number of the corresponding current unlocking procedures.
Optionally, the establishing module includes:
the establishing submodule is used for sequentially arranging the bottleneck factor values from large to small and establishing a bottom-layer to top-layer bottleneck equipment pyramid model;
and the resources with the same bottleneck factor value are positioned at the same layer of the bottleneck equipment pyramid model.
Optionally, the scheduling module includes:
the acquisition submodule is used for acquiring a bottleneck factor value corresponding to a current layer from the bottom layer of the pyramid model of the bottleneck equipment;
and the scheduling submodule is used for carrying out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer until the current unlocking process set is zero.
Optionally, the scheduling sub-module includes:
the processing unit is used for arranging the current unlocking procedure of the current layer to any equipment with the corresponding number in the current unlocking equipment set when the bottleneck factor value corresponding to the current layer is a positive value;
the judging unit is used for judging whether the current layer is judged to be the top layer or not when the bottleneck factor value corresponding to the current layer is a negative value, and obtaining a first judgment result;
the obtaining unit is used for obtaining process information corresponding to each type of resource in the current unlocking equipment set according to the first judgment result;
and the scheduling unit is used for scheduling resources according to the process information.
Optionally, the obtaining unit includes:
the first obtaining subunit is configured to, if the first determination result is yes, obtain a man-hour required by each current unlocking procedure corresponding to each type of resource in the current unlocking device set;
the scheduling unit includes:
the first processing subunit is used for arranging the working hours according to a descending order to obtain a scheduling sequence;
and the second processing subunit is used for sequentially arranging the current unlocking procedure corresponding to the working hours to one device corresponding to the resource according to the scheduling sequence until the idle device corresponding to the resource is arranged.
Optionally, the obtaining unit includes:
the second obtaining subunit is configured to, if the first determination result is negative, obtain to-be-unlocked procedure information and current unlocking procedure information corresponding to each type of resource in the current unlocking device set;
the information of the procedure to be unlocked comprises the time interval between the starting time of the procedure to be unlocked and the current time, and the information of the current unlocking procedure comprises the working hours required by the current unlocking procedure and the total unprocessed working hours of the corresponding workpiece;
the scheduling unit includes:
and the scheduling subunit is used for scheduling resources according to the time interval, the working hours and the total unprocessed working hours.
Optionally, the scheduling subunit includes:
the establishing component is used for establishing a corresponding relation between the time interval and the working hours of which the difference value with the time interval is smaller than a preset threshold value;
and the scheduling component is used for scheduling resources according to the corresponding relation or the corresponding relation and the total unprocessed working hours.
Optionally, the scheduling component is specifically configured to:
firstly, arranging the workpieces corresponding to the procedure to be unlocked and the current unlocking procedure to corresponding equipment, wherein the corresponding relation is one-to-one;
then arranging the corresponding relation to be one-to-many, arranging the workpieces corresponding to the to-be-unlocked process to corresponding equipment, and correspondingly arranging the current unlocking process to the corresponding equipment according to the sequence of the total unprocessed work hours which are sequentially reduced;
and arranging the current unlocking procedure without the corresponding relation to the corresponding equipment according to the sequence that the total unprocessed working hours are reduced in sequence.
Optionally, the method further includes:
and the updating module is used for updating the current unlocking process set and the current unlocking equipment set after the scheduling submodule carries out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer.
The technical scheme of the invention has the following beneficial effects:
in the scheme, the scheduling method of the job shop resources performs resource scheduling by establishing the bottleneck equipment pyramid model and further combining the idle conditions of various resources, so that the coordination of the scheduling scheme among the resources can be improved, the occurrence of production disturbance events is reduced, and the plan performability is improved; and the method provides assistance for dispatching personnel to carry out workshop dispatching.
Drawings
Fig. 1 is a flowchart illustrating a method for scheduling job shop resources according to a first embodiment of the present invention;
fig. 2 is a schematic view of a specific application flow of a job shop resource scheduling method according to a first embodiment of the present invention;
fig. 3 is a schematic diagram of a pyramid model of bottleneck equipment according to a first embodiment of the invention;
fig. 4 is a schematic structural diagram of a job shop resource scheduling apparatus according to a second embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments.
Aiming at the problems of lagged scheduling scheme and low stability of the job shop resources in the prior art, the invention provides various solutions, which are as follows:
example one
As shown in fig. 1, an embodiment of the present invention provides a method for scheduling job shop resources, including:
step 11: acquiring a current unlocking process set and a current unlocking equipment set in real time;
step 12: obtaining a bottleneck factor value of each type of resources according to the current unlocking procedure set and the current unlocking equipment set;
step 13: establishing a bottleneck equipment pyramid model according to the bottleneck factor value;
step 14: performing resource scheduling according to the bottleneck equipment pyramid model;
the current unlocking process set is a set of unprocessed processes of which the preorder processes are finished, and the current unlocking equipment set is a set of current idle equipment.
According to the scheduling method of the job shop resources, provided by the embodiment of the invention, the bottleneck equipment pyramid model is established, and then the resource scheduling is performed by combining the idle conditions of various resources, so that the coordination of a scheduling scheme among the resources can be improved, the occurrence of production disturbance events is reduced, and the plan performability is improved; and the method provides assistance for dispatching personnel to carry out workshop dispatching.
Specifically, the step of obtaining the bottleneck factor value of each type of resource according to the current unlocking process set and the current unlocking equipment set includes: obtaining the number of idle resources in each type of resources and the number of corresponding current unlocking processes according to the current unlocking process set and the current unlocking equipment set; and obtaining the bottleneck factor value of each type of resource according to the number of the idle resources and the number of the corresponding current unlocking processes.
For example, the difference between the number of idle resources of each type of resource and the number of corresponding current unlocking processes is adopted, and the obtained numerical value is used as the bottleneck factor value of each type of resource, and can be positive or negative.
In this embodiment, the step of establishing a bottleneck device pyramid model according to the bottleneck factor value includes: sequentially arranging the bottleneck factor values in a descending order, and establishing a bottom-layer to top-layer bottleneck equipment pyramid model; and the resources with the same bottleneck factor value are positioned at the same layer of the bottleneck equipment pyramid model.
That is, the larger the bottleneck factor value, the lower the bottleneck level of the corresponding resource, and the lower the position in the bottleneck device pyramid model.
In order to simplify the algorithm and reduce the processing time, in this embodiment, the step of performing resource scheduling according to the bottleneck device pyramid model includes: obtaining a bottleneck factor value corresponding to the current layer from the bottom layer of the pyramid model of the bottleneck device; and carrying out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer until the current unlocking procedure set is zero.
In consideration of the game theory principle, in this embodiment, the step of performing corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer includes: when the bottleneck factor value corresponding to the current layer is a positive value, arranging the current unlocking procedure of the current layer to any equipment with a corresponding number in the current unlocking equipment set;
when the bottleneck factor value corresponding to the current layer is a negative value, judging whether the current layer is judged to be the top layer or not to obtain a first judgment result; acquiring process information corresponding to each type of resource in the current unlocking equipment set according to the first judgment result; and scheduling resources according to the process information.
Specifically, the step of obtaining process information corresponding to each type of resource in the current unlocked device set according to the first determination result includes: when the first judgment result is yes, acquiring the working hours required by each current unlocking procedure corresponding to each type of resources in the current unlocking equipment set;
correspondingly, the step of scheduling resources according to the process information includes: arranging the working hours according to a descending order to obtain a scheduling sequence; and sequentially arranging the current unlocking procedure corresponding to the working hours to one device corresponding to the resources according to the scheduling sequence until the idle device corresponding to the resources is arranged.
Further, the step of obtaining process information corresponding to each type of resource in the current unlocked device set according to the first determination result includes: when the first judgment result is negative, acquiring the process information to be unlocked and the current unlocking process information corresponding to each type of resource in the current unlocking equipment set;
the information of the procedure to be unlocked comprises the time interval between the starting time of the procedure to be unlocked and the current time, and the information of the current unlocking procedure comprises the working hours required by the current unlocking procedure and the total unprocessed working hours of the corresponding workpiece;
correspondingly, the step of scheduling resources according to the process information includes: and scheduling resources according to the time interval, the working hours and the total unprocessed working hours.
In order to maximally reduce the idle time of the device, the step of scheduling resources according to the time interval, the working hours and the total unprocessed working hours comprises: establishing a corresponding relation between the time interval and the working hours of which the difference value with the time interval is smaller than a preset threshold value; and scheduling resources according to the corresponding relation or the corresponding relation and the total unprocessed working hours.
Specifically, the step of scheduling resources according to the correspondence, or the correspondence and the total unprocessed hour includes: firstly, arranging the workpieces corresponding to the procedure to be unlocked and the current unlocking procedure to corresponding equipment, wherein the corresponding relation is one-to-one;
then arranging the corresponding relation to be one-to-many, arranging the workpieces corresponding to the to-be-unlocked process to corresponding equipment, and correspondingly arranging the current unlocking process to the corresponding equipment according to the sequence of the total unprocessed work hours which are sequentially reduced; and arranging the current unlocking procedure without the corresponding relation to the corresponding equipment according to the sequence that the total unprocessed working hours are reduced in sequence.
In order to effectively combine the actual production situation of the workshop and improve the performability of the plan, after the corresponding resource scheduling is performed according to the positive and negative of the bottleneck factor value corresponding to the current layer, the method further comprises the following steps: and updating the current unlocking procedure set and the current unlocking equipment set.
The following further describes the method for scheduling job shop resources according to the first embodiment of the present invention.
In order to solve the technical problems and enhance the coordination among equipment resources, the invention provides a job shop resource scheduling method, and can also be called a bottleneck equipment pyramid-based job shop multi-resource coordination scheduling method. According to the method, equipment resources are divided into a plurality of intelligent agents, each intelligent agent can independently conduct 'thinking' and 'decision', and the intelligent agents can communicate with each other, so that the coordination of a scheduling scheme among the resources is improved, and the occurrence of production disturbance events is reduced.
However, in order to avoid that all the agents have higher thinking capability to cause 'robbing' orders among resources, the method provides the concept of a bottleneck equipment pyramid, and grades the equipment according to the bottleneck degree, wherein the lower the equipment grade is, the stronger the thinking capability is, and a scheduling idea combining independent thinking and obeying arrangement is formed.
Specifically, as shown in fig. 2, the method for multi-resource coordinated scheduling of a job shop based on a bottleneck device pyramid includes:
step 21: the process route for each workpiece in the order is re-represented by the agent chain and the workpieces are encoded.
Since each process of the workpiece corresponds to a type of equipment, the process route of each workpiece in the order is represented by an agent chain.
Firstly, classifying equipment according to processing types, regarding each class as an intelligent body, adding a unique number to each intelligent body, and then representing procedures in a workpiece process route by the corresponding intelligent bodies to obtain an intelligent body chain of the workpiece; and replacing the intelligent bodies in the intelligent body chain with the numbers to obtain the codes of the workpieces.
Step 22: establishing a current unlocking process set S of workpiecesulpAnd current set of unlocked devices SulmAnd thus a bottleneck device pyramid (bottleneck device pyramid model) is established.
Specifically, for any workpiece r, if the non-machining process ps exists, the machining process pss,rAnd its work-piece internal preamble process ps(s-1),rAfter completion, the working process pss,rThe current unlocking procedure is carried out. Traversing the current unfinished workpieces, finding all current unlocking processes and putting the unlocking processes into a set SulpIn (1). Putting the current idle device into the current unlocking device set SulmIn (1).
For any equipment agent i, calculating the number of idle equipment in the agent, and recording as n; and calculating the number of the current unlocking processes corresponding to the intelligent agent and recording as m. Calculating a bottleneck factor K for the agentbiThe calculation formula is as follows:
Kbi＝n-m
according to the formula, when K isbiWhen the value of (b) is positive, the idle equipment in the agent i is more surplus than the current unlocking procedure; when K isbiWhen the value of (b) is negative, the idle device in agent i is not enough to meet the requirement of the current unlocking procedure, and is a bottleneck device.
Traverse all agents and calculate bottleneck factor, let KbiThe agents with the same value are placed on the same layer of the pyramid of the bottleneck device, and KbiThe larger the value of (d), the lower the bottleneck level of agent i, the lower the position in the bottleneck device pyramid. Thereby creating a bottleneck device pyramid as shown in fig. 3.
Step 23: traversing the bottleneck equipment pyramid and arranging a proper unlocking procedure for each agent.
Specifically, the higher the upper-level agent in the bottleneck equipment pyramid, the higher the bottleneck level, the higher the level may be selected without thinking (i.e. scheduling from the bottom layer, so the algorithm is simple, the processing time is reduced), the lower-level agent not only needs to consider the selection of the resource to the workpiece process, but also needs to consider the distance relationship between the pre-arranged equipment and the subsequent equipment to be arranged, and forms the associated selection between the agents, so as to achieve the mutual coordination among multiple resources, and simultaneously reduce the selection range and the selection difficulty of the high-level agent. The detailed process is as follows:
step a, taking the agent at the bottommost layer of the bottle neck equipment pyramid, and judging whether the bottleneck factor of the agent at the layer is positive. If yes, arranging the related current unlocking procedure on any equipment in the corresponding intelligent agent, entering the next layer of the bottleneck equipment pyramid, and continuing to execute the step a; if not, executing the step b;
step b, traversing the bottleneck equipment pyramid of the layerThe agent in the tower finds all the current unlocking procedures needing to be processed on the equipment in the agent i
Calculating the working hours of the current unlocking procedure
Total unprocessed time of workpiece corresponding to current unlocking process
Judging whether the current layer is the top layer of the pyramid of the bottleneck device (game theory, the top layer is the most robbing and does not need to consider other layers, and the other layers need to consider the condition of the unscheduled layer to realize win-win), if so, pressing
Sorting the current unlocking procedures in a descending order, arranging the previous procedures in the sequence on the corresponding equipment until the idle equipment in the agent i is arranged, and finishing the algorithm (finishing the step 23 and entering the step 24); if not, executing the step c;
step c, for the intelligent agent i, traversing the workpieces being processed on the devices of the other intelligent agents in the whole bottleneck device pyramid, screening out the workpieces corresponding to the devices in the intelligent agent i in the process of waiting for unlocking, and putting the workpieces into the set ScaPerforming the following steps;
d, for the intelligent agent i, traversing the workpieces possibly processed on the idle equipment of the rest intelligent agents in the whole bottleneck equipment pyramid, screening out the workpieces corresponding to the equipment in the procedure to be unlocked and the intelligent agent i, and putting the workpieces into the set ScaPerforming the following steps;
step e, traversing the set ScaThe time interval from the current time to the starting time of the procedure to be unlocked is calculated for the workpieces in the system, and if the time interval of a certain workpiece exists, the certain current unlocking procedure corresponding to the intelligent agent iIs equal in man-hour orClose, then prioritize the process
Arranging the corresponding workpieces which can be machined on the equipment corresponding to the intelligent agent (namely, the workpieces which are machined are continuously machined);
if a plurality of procedures meeting the conditions exist, the total unprocessed working hours of the workpieces corresponding to the current unlocking procedure are preferentially arranged
A larger process step of arranging the corresponding workpieces that are likely to be processed on the devices corresponding to the agents; if the working procedure meeting the conditions does not exist, the total unprocessed working hours of the workpiece corresponding to the current unlocking working procedure are preferentially arranged
And (4) a large process step. And updating the current unlocking process and the current unlocking equipment.
The arrangement of step e may reduce device idle time.
And f, entering the next layer of the bottleneck equipment pyramid, and turning to the step a.
Step 24: and (5) judging whether an unfinished workpiece exists, if so, entering a step 25, and otherwise, entering a step 26.
Step 25: the next time node is entered (i.e. there is a point in time when the process is complete) and the process goes to step 22.
Step 26: and finishing scheduling.
Therefore, the scheme provided by the embodiment of the invention can provide assistance for dispatching personnel to dispatch workshops, and has important significance for dispatching and scheduling the workshops with parallel machines:
(1) the scheduling problem of the job shop scheduling problem with parallel machines facing to multiple varieties and small batches is realized;
(2) through coordination among the multiple intelligent agents, the autonomously formed production plan has higher flexibility, robustness and adaptability, and disturbance events are avoided to a certain extent;
(3) the method is carried out on the basis of a rolling time window, and is operated once at each time node, so that the actual production condition of a workshop can be effectively combined, and the plan performability is improved.
Example two
As shown in fig. 4, a second embodiment of the present invention provides a job shop resource scheduling apparatus, including:
an obtaining module 41, configured to obtain a current unlocking procedure set and a current unlocking device set in real time;
the processing module 42 is configured to obtain a bottleneck factor value of each type of resource according to the current unlocking procedure set and the current unlocking device set;
an establishing module 43, configured to establish a bottleneck device pyramid model according to the bottleneck factor value;
a scheduling module 44, configured to perform resource scheduling according to the bottleneck device pyramid model;
the current unlocking process set is a set of unprocessed processes of which the preorder processes are finished, and the current unlocking equipment set is a set of current idle equipment.
The scheduling device for the resources of the job shop, provided by the embodiment of the invention, is used for scheduling the resources by establishing the pyramid model of the bottleneck equipment and further combining the idle conditions of various resources, so that the coordination of a scheduling scheme among the resources can be improved, the occurrence of production disturbance events is reduced, and the plan performability is improved; and the method provides assistance for dispatching personnel to carry out workshop dispatching.
Specifically, the processing module includes: the first processing submodule is used for obtaining the number of idle resources in each type of resource and the number of corresponding current unlocking procedures according to the current unlocking procedure set and the current unlocking equipment set; and the second processing submodule is used for obtaining the bottleneck factor value of each type of resource according to the number of the idle resources and the number of the corresponding current unlocking procedures.
For example, the difference between the number of idle resources of each type of resource and the number of corresponding current unlocking processes is adopted, and the obtained numerical value is used as the bottleneck factor value of each type of resource, and can be positive or negative.
In this embodiment, the establishing module includes: the establishing submodule is used for sequentially arranging the bottleneck factor values from large to small and establishing a bottom-layer to top-layer bottleneck equipment pyramid model; and the resources with the same bottleneck factor value are positioned at the same layer of the bottleneck equipment pyramid model.
That is, the larger the bottleneck factor value, the lower the bottleneck level of the corresponding resource, and the lower the position in the bottleneck device pyramid model.
In order to simplify the algorithm and reduce the processing time, in this embodiment, the scheduling module includes: the acquisition submodule is used for acquiring a bottleneck factor value corresponding to a current layer from the bottom layer of the pyramid model of the bottleneck equipment; and the scheduling submodule is used for carrying out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer until the current unlocking process set is zero.
In consideration of the game theory principle, in this embodiment, the scheduling sub-module includes: the processing unit is used for arranging the current unlocking procedure of the current layer to any equipment with the corresponding number in the current unlocking equipment set when the bottleneck factor value corresponding to the current layer is a positive value;
the judging unit is used for judging whether the current layer is judged to be the top layer or not when the bottleneck factor value corresponding to the current layer is a negative value, and obtaining a first judgment result; the obtaining unit is used for obtaining process information corresponding to each type of resource in the current unlocking equipment set according to the first judgment result; and the scheduling unit is used for scheduling resources according to the process information.
Specifically, the acquiring unit includes: the first obtaining subunit is configured to, if the first determination result is yes, obtain a man-hour required by each current unlocking procedure corresponding to each type of resource in the current unlocking device set;
correspondingly, the scheduling unit includes: the first processing subunit is used for arranging the working hours according to a descending order to obtain a scheduling sequence; and the second processing subunit is used for sequentially arranging the current unlocking procedure corresponding to the working hours to one device corresponding to the resource according to the scheduling sequence until the idle device corresponding to the resource is arranged.
Further, the acquiring unit includes: the second obtaining subunit is configured to, if the first determination result is negative, obtain to-be-unlocked procedure information and current unlocking procedure information corresponding to each type of resource in the current unlocking device set;
the information of the procedure to be unlocked comprises the time interval between the starting time of the procedure to be unlocked and the current time, and the information of the current unlocking procedure comprises the working hours required by the current unlocking procedure and the total unprocessed working hours of the corresponding workpiece;
correspondingly, the scheduling unit includes: and the scheduling subunit is used for scheduling resources according to the time interval, the working hours and the total unprocessed working hours.
In order to maximally reduce device idle time, the scheduling subunit includes: the establishing component is used for establishing a corresponding relation between the time interval and the working hours of which the difference value with the time interval is smaller than a preset threshold value; and the scheduling component is used for scheduling resources according to the corresponding relation or the corresponding relation and the total unprocessed working hours.
Specifically, the scheduling component is specifically configured to: firstly, arranging the workpieces corresponding to the procedure to be unlocked and the current unlocking procedure to corresponding equipment, wherein the corresponding relation is one-to-one;
then arranging the corresponding relation to be one-to-many, arranging the workpieces corresponding to the to-be-unlocked process to corresponding equipment, and correspondingly arranging the current unlocking process to the corresponding equipment according to the sequence of the total unprocessed work hours which are sequentially reduced; and arranging the current unlocking procedure without the corresponding relation to the corresponding equipment according to the sequence that the total unprocessed working hours are reduced in sequence.
In order to effectively combine the actual production situation of the workshop and improve the performability of the plan, the scheduling device further comprises: and the updating module is used for updating the current unlocking process set and the current unlocking equipment set after the scheduling submodule carries out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer.
Therefore, the scheme provided by the embodiment of the invention can provide assistance for dispatching personnel to dispatch workshops, and has important significance for dispatching and scheduling the workshops with parallel machines:
(1) the scheduling problem of the job shop scheduling problem with parallel machines facing to multiple varieties and small batches is realized;
(2) through coordination among the multiple intelligent agents, the autonomously formed production plan has higher flexibility, robustness and adaptability, and disturbance events are avoided to a certain extent;
(3) the method is carried out on the basis of a rolling time window, and is operated once at each time node, so that the actual production condition of a workshop can be effectively combined, and the plan performability is improved.
The implementation embodiments of the job shop resource scheduling method are all applicable to the embodiment of the job shop resource scheduling device, and the same technical effect can be achieved.
It should be noted that many of the functional components described in this specification are referred to as modules/sub-modules/units/sub-units/assemblies in order to more particularly emphasize their implementation independence.
In embodiments of the present invention, the modules/sub-modules/units/sub-units/components may be implemented in software for execution by various types of processors. An identified module of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions which may, for instance, be constructed as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different bits which, when joined logically together, comprise the module and achieve the stated purpose for the module.
Indeed, a module of executable code may be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Likewise, operational data may be identified within the modules and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.
When a module can be implemented by software, considering the level of existing hardware technology, a module implemented by software may build a corresponding hardware circuit to implement a corresponding function, without considering cost, and the hardware circuit may include a conventional Very Large Scale Integration (VLSI) circuit or a gate array and an existing semiconductor such as a logic chip, a transistor, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.
While the preferred embodiments of the present invention have been described, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention.
Claims (15)
1. A method for scheduling job shop resources, comprising:
acquiring a current unlocking process set and a current unlocking equipment set in real time;
obtaining a bottleneck factor value of each type of resources according to the current unlocking procedure set and the current unlocking equipment set;
establishing a bottleneck equipment pyramid model according to the bottleneck factor value;
performing resource scheduling according to the bottleneck equipment pyramid model;
wherein the current unlocking process set is a set of unprocessed processes of which the previous processes are finished,
the current unlocking equipment set is a set of current idle equipment;
the step of scheduling resources according to the pyramid model of the bottleneck device comprises:
obtaining a bottleneck factor value corresponding to the current layer from the bottom layer of the pyramid model of the bottleneck device;
and carrying out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer until the current unlocking procedure set is zero.
2. The scheduling method according to claim 1, wherein the step of obtaining the bottleneck factor value of each resource type according to the current unlocking procedure set and the current unlocking equipment set comprises:
obtaining the number of idle resources in each type of resources and the number of corresponding current unlocking processes according to the current unlocking process set and the current unlocking equipment set;
and obtaining the bottleneck factor value of each type of resource according to the number of the idle resources and the number of the corresponding current unlocking processes.
3. The scheduling method of claim 1, wherein the step of building a pyramid model of bottleneck devices according to the bottleneck factor values comprises:
sequentially arranging the bottleneck factor values in a descending order, and establishing a bottom-layer to top-layer bottleneck equipment pyramid model;
and the resources with the same bottleneck factor value are positioned at the same layer of the bottleneck equipment pyramid model.
4. The scheduling method according to claim 1, wherein the step of scheduling the corresponding resources according to the positive or negative of the bottleneck factor value corresponding to the current layer comprises:
when the bottleneck factor value corresponding to the current layer is a positive value, arranging the current unlocking procedure of the current layer to any equipment with a corresponding number in the current unlocking equipment set;
when the bottleneck factor value corresponding to the current layer is a negative value, judging whether the current layer is judged to be the top layer or not to obtain a first judgment result;
acquiring process information corresponding to each type of resource in the current unlocking equipment set according to the first judgment result;
and scheduling resources according to the process information.
5. The scheduling method according to claim 4, wherein the step of obtaining the process information corresponding to each type of resource in the current unlocked device set according to the first determination result comprises:
when the first judgment result is yes, acquiring the working hours required by each current unlocking procedure corresponding to each type of resources in the current unlocking equipment set;
the step of scheduling resources according to the process information includes:
arranging the working hours according to a descending order to obtain a scheduling sequence;
and sequentially arranging the current unlocking procedure corresponding to the working hours to one device corresponding to the resources according to the scheduling sequence until the idle device corresponding to the resources is arranged.
6. The scheduling method according to claim 4, wherein the step of obtaining the process information corresponding to each type of resource in the current unlocked device set according to the first determination result comprises:
when the first judgment result is negative, acquiring the process information to be unlocked and the current unlocking process information corresponding to each type of resource in the current unlocking equipment set;
the information of the procedure to be unlocked comprises the time interval between the starting time of the procedure to be unlocked and the current time, and the information of the current unlocking procedure comprises the working hours required by the current unlocking procedure and the total unprocessed working hours of the corresponding workpiece;
the step of scheduling resources according to the process information includes:
and scheduling resources according to the time interval, the working hours and the total unprocessed working hours.
7. The scheduling method of claim 6, wherein the step of scheduling resources according to the time interval, the man-hour and the total unprocessed man-hour comprises:
establishing a corresponding relation between the time interval and the working hours of which the difference value with the time interval is smaller than a preset threshold value;
and scheduling resources according to the corresponding relation or the corresponding relation and the total unprocessed working hours.
8. The scheduling method according to claim 7, wherein the step of scheduling resources according to the correspondence, or the correspondence and the total unprocessed time, comprises:
firstly, arranging the workpieces corresponding to the procedure to be unlocked and the current unlocking procedure to corresponding equipment, wherein the corresponding relation is one-to-one;
then arranging the corresponding relation to be one-to-many, arranging the workpieces corresponding to the to-be-unlocked process to corresponding equipment, and correspondingly arranging the current unlocking process to the corresponding equipment according to the sequence of the total unprocessed work hours which are sequentially reduced;
and arranging the current unlocking procedure without the corresponding relation to the corresponding equipment according to the sequence that the total unprocessed working hours are reduced in sequence.
9. The scheduling method according to claim 1, wherein after the corresponding resource scheduling is performed according to the sign of the bottleneck factor value corresponding to the current layer, the method further comprises:
and updating the current unlocking procedure set and the current unlocking equipment set.
10. A scheduling apparatus for job shop resources, comprising:
the acquisition module is used for acquiring a current unlocking procedure set and a current unlocking equipment set in real time;
the processing module is used for obtaining the bottleneck factor value of each type of resource according to the current unlocking process set and the current unlocking equipment set;
the establishing module is used for establishing a bottleneck equipment pyramid model according to the bottleneck factor value;
the scheduling module is used for scheduling resources according to the bottleneck equipment pyramid model;
wherein the current unlocking process set is a set of unprocessed processes of which the previous processes are finished,
the current unlocking equipment set is a set of current idle equipment;
the scheduling module includes:
the acquisition submodule is used for acquiring a bottleneck factor value corresponding to a current layer from the bottom layer of the pyramid model of the bottleneck equipment;
and the scheduling submodule is used for carrying out corresponding resource scheduling according to the positive and negative of the bottleneck factor value corresponding to the current layer until the current unlocking process set is zero.
11. The scheduling apparatus of claim 10 wherein the scheduling sub-module comprises:
the processing unit is used for arranging the current unlocking procedure of the current layer to any equipment with the corresponding number in the current unlocking equipment set when the bottleneck factor value corresponding to the current layer is a positive value;
the judging unit is used for judging whether the current layer is judged to be the top layer or not when the bottleneck factor value corresponding to the current layer is a negative value, and obtaining a first judgment result;
the obtaining unit is used for obtaining process information corresponding to each type of resource in the current unlocking equipment set according to the first judgment result;
and the scheduling unit is used for scheduling resources according to the process information.
12. The scheduling apparatus of claim 11, wherein the obtaining unit comprises:
the first obtaining subunit is configured to, if the first determination result is yes, obtain a man-hour required by each current unlocking procedure corresponding to each type of resource in the current unlocking device set;
the scheduling unit includes:
the first processing subunit is used for arranging the working hours according to a descending order to obtain a scheduling sequence;
and the second processing subunit is used for sequentially arranging the current unlocking procedure corresponding to the working hours to one device corresponding to the resource according to the scheduling sequence until the idle device corresponding to the resource is arranged.
13. The scheduling apparatus of claim 11, wherein the obtaining unit comprises:
the second obtaining subunit is configured to, if the first determination result is negative, obtain to-be-unlocked procedure information and current unlocking procedure information corresponding to each type of resource in the current unlocking device set;
the information of the procedure to be unlocked comprises the time interval between the starting time of the procedure to be unlocked and the current time, and the information of the current unlocking procedure comprises the working hours required by the current unlocking procedure and the total unprocessed working hours of the corresponding workpiece;
the scheduling unit includes:
and the scheduling subunit is used for scheduling resources according to the time interval, the working hours and the total unprocessed working hours.
14. The scheduling apparatus of claim 13, wherein the scheduling subunit comprises:
the establishing component is used for establishing a corresponding relation between the time interval and the working hours of which the difference value with the time interval is smaller than a preset threshold value;
and the scheduling component is used for scheduling resources according to the corresponding relation or the corresponding relation and the total unprocessed working hours.
15. The scheduling apparatus of claim 14, wherein the scheduling component is specifically configured to:
firstly, arranging the workpieces corresponding to the procedure to be unlocked and the current unlocking procedure to corresponding equipment, wherein the corresponding relation is one-to-one;
then arranging the corresponding relation to be one-to-many, arranging the workpieces corresponding to the to-be-unlocked process to corresponding equipment, and correspondingly arranging the current unlocking process to the corresponding equipment according to the sequence of the total unprocessed work hours which are sequentially reduced;
and arranging the current unlocking procedure without the corresponding relation to the corresponding equipment according to the sequence that the total unprocessed working hours are reduced in sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611001077.6A CN108073142B (en) | 2016-11-14 | 2016-11-14 | Scheduling method and device for job shop resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611001077.6A CN108073142B (en) | 2016-11-14 | 2016-11-14 | Scheduling method and device for job shop resources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108073142A CN108073142A (en) | 2018-05-25 |
| CN108073142B true CN108073142B (en) | 2020-01-17 |
Family
ID=62162414
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611001077.6A Active CN108073142B (en) | 2016-11-14 | 2016-11-14 | Scheduling method and device for job shop resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108073142B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111680877A (en) * | 2020-05-06 | 2020-09-18 | 杭州传化智能制造科技有限公司 | Production line scheduling method and device, computer equipment and computer readable storage medium |
| CN113408902B (en) * | 2021-06-21 | 2022-08-26 | 北京思路智园科技有限公司 | Full-flow production scheduling system and method based on artificial intelligence |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007213458A (en) * | 2006-02-13 | 2007-08-23 | Hitachi Displays Ltd | Production planning system |
| JP2011028542A (en) * | 2009-07-27 | 2011-02-10 | Elpida Memory Inc | Production management method and production management system |
| CN102541032A (en) * | 2012-02-11 | 2012-07-04 | 北京化工大学 | Bottleneck device forecasting method for re-entrant manufacturing system |
| CN102789599A (en) * | 2012-07-06 | 2012-11-21 | 西北工业大学 | Operation shop bottleneck recognition method based on cluster analysis and multiple attribute decision making |
| CN103440533A (en) * | 2013-08-29 | 2013-12-11 | 西北工业大学 | Method for defining non-bottleneck resource capacity of job shop under cloud manufacturing mode |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060037018A1 (en) * | 2004-08-16 | 2006-02-16 | Dell Products L.P. | System, method and software providing an adaptive job dispatch algorithm for large distributed jobs |
| US8640137B1 (en) * | 2010-08-30 | 2014-01-28 | Adobe Systems Incorporated | Methods and apparatus for resource management in cluster computing |
| CN103700022A (en) * | 2013-12-27 | 2014-04-02 | 浙江大学 | Methods and device for scheduling production of semiconductor products |
| CN104484751A (en) * | 2014-12-12 | 2015-04-01 | 中国科学院自动化研究所 | Dynamic optimization method and device for production planning and resource allocation |
-
2016
- 2016-11-14 CN CN201611001077.6A patent/CN108073142B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007213458A (en) * | 2006-02-13 | 2007-08-23 | Hitachi Displays Ltd | Production planning system |
| JP2011028542A (en) * | 2009-07-27 | 2011-02-10 | Elpida Memory Inc | Production management method and production management system |
| CN102541032A (en) * | 2012-02-11 | 2012-07-04 | 北京化工大学 | Bottleneck device forecasting method for re-entrant manufacturing system |
| CN102789599A (en) * | 2012-07-06 | 2012-11-21 | 西北工业大学 | Operation shop bottleneck recognition method based on cluster analysis and multiple attribute decision making |
| CN103440533A (en) * | 2013-08-29 | 2013-12-11 | 西北工业大学 | Method for defining non-bottleneck resource capacity of job shop under cloud manufacturing mode |
Non-Patent Citations (1)
| Title |
|---|
| 大规模作业车间多瓶颈调度算法;翟颖妮 等;《计算机集成制造系统》;20110731;第17卷(第7期);第1486-1494页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108073142A (en) | 2018-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020007016A1 (en) | Dynamic linkage control method for automatic production process of intelligent workshop based on digital twin | |
| WO2015096511A1 (en) | Intelligent numerical control machining programming system and method for aircraft structural parts | |
| CN109902954B (en) | Flexible job shop dynamic scheduling method based on industrial big data | |
| CN108073142B (en) | Scheduling method and device for job shop resources | |
| CN106707991B (en) | Bottleneck device recognition methods in multiple target job scheduling based on Fuzzy Level Analytic Approach | |
| CN103942610A (en) | Reconfigurable manufacturing system polymorphic configuration optimization method based on tasks | |
| CN110472765B (en) | Low-entropy collaborative optimization method for workshop layout scheduling | |
| Gania et al. | Flexible manufacturing systems: Industry 4.0 solution | |
| CN108053152A (en) | The method that improved adaptive GA-IAGA based on polychromatic sets solves dynamic job shop scheduling | |
| Delorme et al. | A multi-objective approach for design of reconfigurable transfer lines | |
| CN102621887B (en) | Garment sewing process analysis and combination method | |
| Suer et al. | Evaluation of manufacturing cell loading rules for independent cells | |
| CN116976653B (en) | Multi-factory capacity coordination method based on MES system | |
| Zhang et al. | A dynamic scheduling method for self-organized AGVs in production logistics systems | |
| Abd et al. | A scheduling framework for robotic flexible assembly cells | |
| Nagar et al. | An AHP-based approach for the selection of HFMS: an Indian perspective | |
| CN110580019A (en) | edge calculation-oriented equipment calling method and device | |
| Carrie et al. | Operation sequencing in a FMS | |
| CN113743747A (en) | Multi-AGV cooperative scheduling method and device in workshop environment | |
| CN107703897A (en) | A kind of collaborative navigation optimization method towards fixed assembling process | |
| Warnecke et al. | Technical investment planning of flexible manufacturing systems—the application of practice-oriented methods | |
| Tang et al. | Virtual production lines design for back-end semiconductor manufacturing systems | |
| CN113033005B (en) | Solving method for job shop performance index with multi-resource cooperative constraint | |
| Shakeri et al. | An overview on smart scheduling in MES: in the context of industry 4.0 | |
| CN106292608A (en) | Digit Control Machine Tool intelligence manufacture digitized workshop integrated system |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220601 Address after: 112, F1, building 405, Tiantongyuan, Dongxiaokou Town, Changping District, Beijing 102208 Patentee after: Beijing Yingjie Technology Co.,Ltd. Address before: 100081 No. 5 South Main Street, Haidian District, Beijing, Zhongguancun Patentee before: BEIJING INSTITUTE OF TECHNOLOGY |
|
| TR01 | Transfer of patent right |