CN108073142A - A kind of dispatching method and device of job shop resource - Google Patents
A kind of dispatching method and device of job shop resource Download PDFInfo
- Publication number
- CN108073142A CN108073142A CN201611001077.6A CN201611001077A CN108073142A CN 108073142 A CN108073142 A CN 108073142A CN 201611001077 A CN201611001077 A CN 201611001077A CN 108073142 A CN108073142 A CN 108073142A
- Authority
- CN
- China
- Prior art keywords
- current
- resource
- bottleneck
- man
- scheduling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 248
- 230000008569 process Effects 0.000 claims abstract description 200
- 238000012545 processing Methods 0.000 claims description 27
- 235000012364 Peperomia pellucida Nutrition 0.000 claims description 6
- 240000007711 Peperomia pellucida Species 0.000 claims description 6
- 238000003754 machining Methods 0.000 claims 1
- 238000004519 manufacturing process Methods 0.000 abstract description 11
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 2
- 239000010931 gold Substances 0.000 description 2
- 229910052737 gold Inorganic materials 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- FGUUSXIOTUKUDN-IBGZPJMESA-N C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 Chemical compound C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 FGUUSXIOTUKUDN-IBGZPJMESA-N 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 230000000694 effects 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
- 238000005457 optimization Methods 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
- 230000009466 transformation Effects 0.000 description 1
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 present invention provides a kind of dispatching method and device of job shop resource, wherein, the dispatching method of job shop resource includes：Current unlock process set and current unlocker device set are obtained in real time；According to the current unlock process set and current unlocker device set, the bottleneck factor values of every a kind of resource are obtained；Bottleneck device pyramid model is established according to the bottleneck factor values；Scheduling of resource is carried out according to the bottleneck device pyramid model；The current unlock process collection is combined into the set for the undressed process that preamble process has completed, and the current unlocker device collection is combined into the set of current idle equipment.This programme is by establishing bottleneck device pyramid model, and then the idle condition for combining all kinds of resources carries out scheduling of resource, can improve coordination of the scheduling scheme between resource, reduces the generation of production disturbance event, improves the enforceability of plan；Job-Shop is carried out for dispatcher, and auxiliary is provided.
Description
Technical field
The present invention relates to manufacturing technology fields, the particularly a kind of dispatching method and device of job shop resource.
Background technology
Traditional job-shop scheduling problem is usually n × m scheduling problems, it provides that a procedure can only be in an equipment
Upper processing.And be continuously increased with the demand of personalized customization, most of actual production manufactures show multi items, become batch etc.
Feature, lathe can produce under the conditions of parallel.For there are the job-shop scheduling problem of parallel machine, a procedure can be
It is processed in the equipment of more identical categories.Therefore, the resolving ideas of the scheduling problem selects together from original for individual equipment
Suitable process is transformed into present selects multiple working procedure to be processed for multiple equipment.This one-to-one transformation to multi-to-multi
Not only increase the optional scope of equipment, it is poor that the appearance of parallel machine more so that different types of equipment generates in bottleneck degree
Away from.
Complicated, the associated scheduling problem of multiple resource is, it is necessary to cooperate under above-mentioned multi items, change batch, Flexible production
Solution forms feasible research approach.The heuristic rule and intelligent optimization algorithm for being traditionally used for solving scheduling problem play
The role of decision-making level takes on entire scheduling from top to bottom.This top-down scheduling lack between equipment it is mutually coordinated with
" exchange " can generate the production disturbance event of more burst, it is difficult to timely respond to, cause the situation of " a plan may not be able to keep up with changes "
Again and again occur；In addition, traditional multi-agent Technology or spontaneous, the local coordination of dependence, it is difficult to ensure overall complex optimum；
Or fight separately between multiple agent, lack and plan as a whole, it is difficult to ensure the stability of algorithm.
The content of the invention
It is an object of the invention to provide a kind of dispatching method and device of job shop resource, solution is made in the prior art
The problem of industry workshop resource scheduling scheme lags, stability is low.
In order to solve the above-mentioned technical problem, the embodiment of the present invention provides a kind of dispatching method of job shop resource, including：
Current unlock process set and current unlocker device set are obtained in real time；
According to the current unlock process set and current unlocker device set, the bottleneck factor of every a kind of resource is obtained
Value；
Bottleneck device pyramid model is established according to the bottleneck factor values；
Scheduling of resource is carried out according to the bottleneck device pyramid model；
Wherein, the current unlock process collection is combined into the set for the undressed process that preamble process has completed,
The current unlocker device collection is combined into the set of current idle equipment.
Optionally, it is described according to the current unlock process set and current unlocker device set, obtain every a kind of resource
Bottleneck factor values the step of include：
According to the current unlock process set and current unlocker device set, idling-resource in every a kind of resource is obtained
Quantity and the corresponding current quantity for unlocking process；
According to the quantity of the idling-resource and the quantity of corresponding current unlock process, the bottleneck of every a kind of resource is obtained
Factor values.
Optionally, described the step of establishing bottleneck device pyramid model according to the bottleneck factor values, includes：
The bottleneck factor values according to descending order are arranged in order, establish bottom to the bottleneck device gold of top layer
Word tower model；
Wherein, the identical resource of the bottleneck factor values is located at the same layer of the bottleneck device pyramid model.
Optionally, described the step of carrying out scheduling of resource according to the bottleneck device pyramid model, includes：
Since the bottom of the bottleneck device pyramid model, the bottleneck factor values corresponding to current layer are obtained；
The corresponding scheduling of resource of positive and negative carry out of bottleneck factor values according to corresponding to current layer, until the current unlock
Process collection is combined into zero.
Optionally, the bottleneck factor values according to corresponding to current layer is positive and negative, carries out the step of corresponding scheduling of resource
Suddenly include：
When the bottleneck factor values corresponding to the current layer are positive value, by the current unlock procedure arrangement of current layer to institute
It states in current unlocker device set in the arbitrary equipment of corresponding number；
When the bottleneck factor values corresponding to the current layer are negative value, judge that current layer determines whether top layer, obtain
First judging result；
According to first judging result, obtain in the current unlocker device set and believe per the corresponding process of a kind of resource
Breath；
Scheduling of resource is carried out according to the process information.
Optionally, it is described according to first judging result, it obtains in the current unlocker device set per a kind of resource
The step of corresponding process information, includes：
It is corresponding every per a kind of resource in the current unlocker device set when being, to obtain in first judging result
Man-hour needed for one current unlock process；
Described the step of carrying out scheduling of resource according to the process information, includes：
The man-hour according to descending is arranged, obtains schedule sequences；
It is arranged successively according to schedule sequences in the man-hour corresponding current unlock process a to equipment of corresponding resource, directly
Free device to corresponding resource is arranged to finish.
Optionally, it is described according to first judging result, it obtains in the current unlocker device set per a kind of resource
The step of corresponding process information, includes：
Per one kind, resource is corresponding when first judging result is no, in the acquisition current unlocker device set treats
Unlock process information and current unlock process information；
The process information to be unlocked includes the time interval with current time at the beginning of process to be unlocked, described to work as
Preceding unlock process information includes the man-hour needed for current unlock process and total undressed man-hour of corresponding workpiece；
Described the step of carrying out scheduling of resource according to the process information, includes：
According to the time interval, man-hour and total undressed man-hour, scheduling of resource is carried out.
Optionally, it is described according to the time interval, man-hour and total undressed man-hour, the step of carrying out scheduling of resource bag
It includes：
Foundation is corresponding between being less than the man-hour of predetermined threshold value by the time interval and with the difference of the time interval closes
System；
According to the correspondence or the correspondence and total undressed man-hour, scheduling of resource is carried out.
Optionally, it is described according to the correspondence or the correspondence and total undressed man-hour, it is provided
The step of source is dispatched includes：
The correspondence is arranged first to be man-to-man, process unlock and currently unlocks the corresponding workpiece of process to right
Answer equipment；
Then arrange the correspondence to be one-to-many, the corresponding workpiece of process unlock to correspondence equipment, and according to
The order that total undressed man-hour reduces successively, it is corresponding to arrange current unlock process to corresponding equipment；
According still further to the order that total undressed man-hour reduces successively, the current unlock process there is no correspondence is arranged
To corresponding equipment.
Optionally, the bottleneck factor values according to corresponding to current layer the corresponding scheduling of resource of positive and negative carry out it
Afterwards, further include：
The current unlock process set of update and current unlocker device set.
The present invention also provides a kind of dispatching device of job shop resource, including：
Acquisition module, for obtaining current unlock process set and current unlocker device set in real time；
Processing module, for according to the current unlock process set and current unlocker device set, obtaining every a kind of money
The bottleneck factor values in source；
Module is established, for establishing bottleneck device pyramid model according to the bottleneck factor values；
Scheduler module, for carrying out scheduling of resource according to the bottleneck device pyramid model；
Wherein, the current unlock process collection is combined into the set for the undressed process that preamble process has completed,
The current unlocker device collection is combined into the set of current idle equipment.
Optionally, the processing module includes：
First processing submodule, for according to the current unlock process set and current unlocker device set, obtaining every
The quantity of idling-resource and the corresponding current quantity for unlocking process in a kind of resource；
Second processing submodule, for the quantity according to the idling-resource and it is corresponding it is current unlock process quantity,
Obtain the bottleneck factor values of every a kind of resource.
Optionally, the module of establishing includes：
Setting up submodule for the bottleneck factor values to be arranged in order according to descending order, is established bottom and is arrived
The bottleneck device pyramid model of top layer；
Wherein, the identical resource of the bottleneck factor values is located at the same layer of the bottleneck device pyramid model.
Optionally, the scheduler module includes：
Acquisition submodule, for since the bottom of the bottleneck device pyramid model, obtaining corresponding to current layer
Bottleneck factor values；
Submodule is dispatched, for the corresponding scheduling of resource of positive and negative carry out of the bottleneck factor values according to corresponding to current layer,
Until the current unlock process collection is combined into zero.
Optionally, the scheduling submodule includes：
Processing unit, for the bottleneck factor values corresponding to the current layer be positive value when, by the current solution of current layer
Lock procedure arrangement is into the current unlocker device set in the arbitrary equipment of corresponding number；
Judging unit, for when the bottleneck factor values corresponding to the current layer are negative value, judging that current layer judges to be
No is top layer, obtains the first judging result；
Acquiring unit, for according to first judging result, obtaining in the current unlocker device set per a kind of money
The corresponding process information in source；
Scheduling unit, for carrying out scheduling of resource according to the process information.
Optionally, the acquiring unit includes：
First obtains subelement, for when first judging result is to be, obtaining the current unlocker device set
In man-hour per a kind of resource needed for corresponding each current unlock process；
The scheduling unit includes：
First processing subelement, for the man-hour to be arranged according to descending, obtains schedule sequences；
Second processing subelement, for arranging the man-hour corresponding current unlock process successively according to schedule sequences to right
It answers in an equipment of resource, until the free device of corresponding resource is arranged to finish.
Optionally, the acquiring unit includes：
Second obtains subelement, for when first judging result is no, obtaining the current unlocker device set
In unlock per corresponding process information unlock of a kind of resource and currently process information；
The process information to be unlocked includes the time interval with current time at the beginning of process to be unlocked, described to work as
Preceding unlock process information includes the man-hour needed for current unlock process and total undressed man-hour of corresponding workpiece；
The scheduling unit includes：
Subelement is dispatched, for according to the time interval, man-hour and total undressed man-hour, carrying out scheduling of resource.
Optionally, the scheduling subelement includes：
Component is established, for being less than the man-hour of predetermined threshold value by the time interval and with the difference of the time interval
Between establish correspondence；
Component is dispatched, for according to the correspondence or the correspondence and total undressed man-hour, carrying out
Scheduling of resource.
Optionally, the scheduling component is specifically used for：
The correspondence is arranged first to be man-to-man, process unlock and currently unlocks the corresponding workpiece of process to right
Answer equipment；
Then arrange the correspondence to be one-to-many, the corresponding workpiece of process unlock to correspondence equipment, and according to
The order that total undressed man-hour reduces successively, it is corresponding to arrange current unlock process to corresponding equipment；
According still further to the order that total undressed man-hour reduces successively, the current unlock process there is no correspondence is arranged
To corresponding equipment.
Optionally, further include：
Update module is corresponded to for the positive and negative of bottleneck factor values of the scheduling submodule according to corresponding to current layer
Scheduling of resource after, update current unlock process set and current unlocker device set.
The above-mentioned technical proposal of the present invention has the beneficial effect that：
In said program, the dispatching method of the job shop resource by establishing bottleneck device pyramid model, and then
Scheduling of resource is carried out with reference to the idle condition of all kinds of resources, coordination of the scheduling scheme between resource can be improved, reduce production
The generation of disturbance event improves the enforceability of plan；Job-Shop is carried out for dispatcher, and auxiliary is provided.
Description of the drawings
Fig. 1 is the dispatching method flow diagram of the job shop resource of the embodiment of the present invention one；
Fig. 2 is the dispatching method concrete application flow diagram of the job shop resource of the embodiment of the present invention one；
Fig. 3 is the bottleneck device pyramid model schematic diagram of the embodiment of the present invention one；
Fig. 4 is the dispatching device structure diagram of the job shop resource of the embodiment of the present invention two.
Specific embodiment
To make the technical problem to be solved in the present invention, technical solution and advantage clearer, below in conjunction with attached drawing and tool
Body embodiment is described in detail.
The present invention is provided for the problem of job shop resource scheduling scheme in existing technology lags, stability is low
A variety of solutions, it is specific as follows：
Embodiment one
As shown in Figure 1, the embodiment of the present invention one provides a kind of dispatching method of job shop resource, including：
Step 11：Current unlock process set and current unlocker device set are obtained in real time；
Step 12：According to the current unlock process set and current unlocker device set, the bottle of every a kind of resource is obtained
Neck factor values；
Step 13：Bottleneck device pyramid model is established according to the bottleneck factor values；
Step 14：Scheduling of resource is carried out according to the bottleneck device pyramid model；
Wherein, the current unlock process collection is combined into the set for the undressed process that preamble process has completed, described current
Unlocker device collection is combined into the set of current idle equipment.
The dispatching method for the job shop resource that the embodiment of the present invention one provides is by establishing bottleneck device pyramid
Model, and then the idle condition for combining all kinds of resources carries out scheduling of resource, can improve coordination of the scheduling scheme between resource,
The generation of production disturbance event is reduced, improves the enforceability of plan；Job-Shop is carried out for dispatcher, and auxiliary is provided.
Specifically, it is described according to the current unlock process set and current unlocker device set, obtain every a kind of resource
Bottleneck factor values the step of include：According to the current unlock process set and current unlocker device set, every one kind is obtained
The quantity of idling-resource and the corresponding current quantity for unlocking process in resource；According to the quantity of the idling-resource with it is corresponding
The quantity of current unlock process obtains the bottleneck factor values of every a kind of resource.
For example, being made the difference using the quantity of the idling-resource per a kind of resource with the quantity of corresponding current unlock process, obtain
The numerical value arrived can just be born as the bottleneck factor values per a kind of resource.
In the present embodiment, described the step of establishing bottleneck device pyramid model according to the bottleneck factor values, includes：It will
The bottleneck factor values are arranged in order according to descending order, establish bottom to the bottleneck device pyramid model of top layer；
Wherein, the identical resource of the bottleneck factor values is located at the same layer of the bottleneck device pyramid model.
Namely bottleneck factor values are bigger, and the bottleneck rank of corresponding resource is lower, in bottleneck device pyramid model
Position is more on the lower.
In order to simplify algorithm, reduce processing time, in the present embodiment, it is described according to the bottleneck device pyramid model into
The step of row scheduling of resource, includes：Since the bottom of the bottleneck device pyramid model, the bottle corresponding to current layer is obtained
Neck factor values；The corresponding scheduling of resource of positive and negative carry out of bottleneck factor values according to corresponding to current layer, until the current solution
Lock process collection is combined into zero.
In view of game theory principle, in the present embodiment, the bottleneck factor values according to corresponding to current layer it is positive and negative, into
The step of row corresponding scheduling of resource, includes：When the bottleneck factor values corresponding to the current layer are positive value, by current layer
Current unlock procedure arrangement is into the current unlocker device set in the arbitrary equipment of corresponding number；
When the bottleneck factor values corresponding to the current layer are negative value, judge that current layer determines whether top layer, obtain
First judging result；According to first judging result, obtain corresponding per a kind of resource in the current unlocker device set
Process information；Scheduling of resource is carried out according to the process information.
Specifically, it is described according to first judging result, it obtains in the current unlocker device set per a kind of resource
The step of corresponding process information, includes：When first judging result is to be, obtain in the current unlocker device set
Man-hour per one kind resource needed for corresponding each current unlock process；
Corresponding, described the step of carrying out scheduling of resource according to the process information, includes：By the man-hour according to descending
Arrangement, obtains schedule sequences；The man-hour corresponding current unlock process is arranged successively according to schedule sequences to corresponding resource
In one equipment, until the free device of corresponding resource is arranged to finish.
Further, it is described according to first judging result, it obtains in the current unlocker device set per a kind of money
The step of corresponding process information in source, includes：When first judging result is no, the current unlocker device set is obtained
In unlock per corresponding process information unlock of a kind of resource and currently process information；
The process information to be unlocked includes the time interval with current time at the beginning of process to be unlocked, described to work as
Preceding unlock process information includes the man-hour needed for current unlock process and total undressed man-hour of corresponding workpiece；
Corresponding, described the step of carrying out scheduling of resource according to the process information, includes：According to the time interval, work
When and total undressed man-hour, carry out scheduling of resource.
It is described according to the time interval, man-hour and total undressed man-hour in order to maximize reduction equipment free time, into
The step of row scheduling of resource, includes：It is less than the man-hour of predetermined threshold value by the time interval and with the difference of the time interval
Between establish correspondence；According to the correspondence or the correspondence and total undressed man-hour, resource is carried out
Scheduling.
Specifically, it is described according to the correspondence or the correspondence and total undressed man-hour, it is provided
The step of source is dispatched includes：The correspondence is arranged first to be man-to-man, and process to be unlocked is corresponding with current unlock process
Workpiece to corresponding equipment；
Then arrange the correspondence to be one-to-many, the corresponding workpiece of process unlock to correspondence equipment, and according to
The order that total undressed man-hour reduces successively, it is corresponding to arrange current unlock process to corresponding equipment；According still further to described total
The order that undressed man-hour reduces successively is arranged there is no the current process that unlocks of correspondence to corresponding equipment.
To be effectively combined workshop practical condition, the enforceability of plan is improved, described right according to current layer institute
After the corresponding scheduling of resource of positive and negative carry out for the bottleneck factor values answered, further include：The current unlock process set of update and current
Unlocker device set.
The dispatching method of the job shop resource provided below the embodiment of the present invention one is further described.
In order to solve the above-mentioned technical problem, the coordination between device resource is enhanced, the present invention proposes a kind of job shop money
The dispatching method in source, it may also be said to be based on the pyramidal job shop multiple resource coordinated scheduling method of bottleneck device.This method
Device resource is divided into multiple intelligent bodies, each intelligent body can carry out independent " thinking ", " decision-making ", can between intelligent body
Mutually to be exchanged, to improve coordination of the scheduling scheme between resource, the generation of production disturbance event is reduced.
It, should but in order to avoid all intelligent bodies are respectively provided with higher " thinking " ability and cause " to make a mad rush for " order between resource
Method proposes the pyramidal concept of bottleneck device, and equipment is pressed bottleneck grading, and facility level is lower, and elaborative faculty is stronger,
It is formed and thought independently with obeying the scheduling thinking for arranging to be combined.
Specifically, as shown in Fig. 2, included based on the pyramidal job shop multiple resource coordinated scheduling method of bottleneck device：
Step 21：It represents the process route of each workpiece in order again with intelligent body chain, and is encoded for workpiece.
Since each procedure of workpiece corresponds to a kind of equipment of classification, so being represented again in order with intelligent body chain
Each workpiece process route.
Classify firstly the need of by equipment by processing type, each classification is considered as an intelligent body, and is each intelligent body
The unique number of addition, then the process in workpiece process route is represented, obtain the intelligence of workpiece with corresponding intelligent body
It can body chain；By the intelligent body in intelligent body chain, its number replaces, and obtains the coding of workpiece.
Step 22：Establish the current unlock process set S of workpieceulpWith current unlocker device set Sulm, and thus establish
Bottleneck device pyramid (bottleneck device pyramid model).
Specifically, for either work r, if there are undressed process pss,r, and preamble process ps in its workpiece(s-1),r
It completes, then process pss,rCurrently to unlock process.The current uncompleted workpiece of traversal finds all current unlock processes and is put into
Set SulpIn.Current idle equipment is put into current unlocker device set SulmIn.
For any appliance intelligent body i, the quantity of free device in the intelligent body is calculated, is denoted as n；Calculate the intelligent body pair
The quantity for the current unlock process answered, is denoted as m.For the intelligent body Calculation bottleneck factor Kbi, calculation formula is as follows：
Kbi=n-m
From formula, work as KbiValue for timing, the free device in intelligent body i is richer compared with current unlock process
It is remaining；Work as KbiValue for it is negative when, the free device in intelligent body i is insufficient for the demand of currently unlock process, is bottleneck device.
All intelligent bodies and the Calculation bottleneck factor are traveled through, by KbiBeing worth identical intelligent body, to be positioned over bottleneck device pyramidal
Same layer, and KbiValue it is bigger, the bottleneck rank of intelligent body i is lower, and the position in bottleneck device pyramid is more on the lower.Thus
Bottleneck device pyramid is established, as shown in Figure 3.
Step 23：Bottleneck device pyramid is traveled through, suitable unlock process is arranged for wherein each intelligent body.
Specifically, getting over the intelligent body on upper strata in bottleneck device pyramid, bottleneck rank is higher, and rank is high often
It can select not think deeply and (namely dispatch since bottom, such algorithm is simple, reduces processing time), the low intelligent body of rank
It then not only needs to consider selection of the own resource to workpiece process, it is also contemplated that preamble has arranged equipment to intend arranging equipment with follow-up
The distance between relation, association selection is formed between intelligent body, reaches mutually coordinated between multiple resource, while reduces advanced
The range of choice of other intelligent body and selection difficulty.Detailed process is as follows：
Step a, take the intelligent body of the bottleneck device pyramid bottom, judge this layer of intelligent body the bottleneck factor whether be
Just.If so, by relevant current unlock procedure arrangement to the arbitrary equipment in corresponding intelligent body, bottleneck device gold is entered
Next layer of word tower, continues to execute step a；If it is not, perform step b；
Step b, the intelligent body in this layer of bottleneck device pyramid is traveled through, it is in need in intelligent body i in equipment to find institute
The current unlock process of processingCalculate the man-hour of current unlock processWorkpiece corresponding with current unlock process it is total
Undressed man-hour
Judge current layer whether be the pyramidal top layer of bottleneck device (game theory, top layer be it is most in great demand, need not examine
Consider other, and the situation for needing to consider unscheduled layer of other layers, realize win-win), if so, pressingProcess descending will currently be unlocked
Sequence takes procedure arrangement forward in sequence to corresponding equipment, until the free device arrangement in intelligent body i finishes, terminates
(24) end step 23, enters step algorithm；If it is not, perform step c；
Step c, for intelligent body i, travel through in entire bottleneck device pyramid and processed in the equipment of remaining intelligent body
Workpiece, therefrom filter out process to be unlocked workpiece corresponding with equipment in intelligent body i, be put into set ScaIn；
Step d, for intelligent body i, traveling through may in the free device of remaining intelligent body in entire bottleneck device pyramid
The workpiece of processing therefrom filters out process to be unlocked workpiece corresponding with equipment in intelligent body i, is put into set ScaIn；
Step e, set S is traveled throughcaIn workpiece, calculate current time to the process time started to be unlocked time interval,
If there are the time interval some current unlock processes corresponding with intelligent body i of some workpieceMan-hour is equal or phase
Closely, then give priority in arranging for processBy it is corresponding may processing workpiece be arranged into the equipment of corresponding intelligent body (plus
Work continues processing)；
If there are multiple qualified processes, the total undressed works for the corresponding workpiece of current unlock process of giving priority in arranging for
WhenThe corresponding workpiece that may be processed is arranged into the equipment of corresponding intelligent body by larger process；If there is no meet item
The process of part, the then total undressed man-hour for the corresponding workpiece of current unlock process of giving priority in arranging forLarger process.Update is current
Unlock process and current unlocker device.
The arrangement of step e can reduce equipment free time.
Step f, the pyramidal next layer of bottleneck device is entered, goes to step a.
Step 24：It judges whether the workpiece that do not complete, if so, entering step 25, otherwise, enters step 26.
Step 25：Next timing node (i.e. there are the time points of process completion) is entered, goes to step 22.
Step 26：Scheduling is completed.
From the foregoing, it will be observed that scheme provided in an embodiment of the present invention can carry out Job-Shop for dispatcher provides auxiliary, and
And have great importance to the solving job shop scheduling problem scheduling with parallel machine：
(1) realize towards multi items, the scheduling of the job-shop scheduling problem with parallel machine of small lot；
(2) by the coordination between multiple agent, the production schedule being autonomously formed has higher flexible, robustness and fits
Ying Xing avoids the generation of disturbance event to a certain extent；
(3) this method is carried out based on receding horizon, is run once, can be effectively combined in each timing node
Workshop practical condition improves the enforceability of plan.
Embodiment two
As shown in figure 4, the embodiment of the present invention two provides a kind of dispatching device of job shop resource, including：
Acquisition module 41, for obtaining current unlock process set and current unlocker device set in real time；
Processing module 42, for according to the current unlock process set and current unlocker device set, obtaining every one kind
The bottleneck factor values of resource；
Module 43 is established, for establishing bottleneck device pyramid model according to the bottleneck factor values；
Scheduler module 44, for carrying out scheduling of resource according to the bottleneck device pyramid model；
Wherein, the current unlock process collection is combined into the set for the undressed process that preamble process has completed, described current
Unlocker device collection is combined into the set of current idle equipment.
The dispatching device of the job shop resource provided by Embodiment 2 of the present invention is by establishing bottleneck device pyramid
Model, and then the idle condition for combining all kinds of resources carries out scheduling of resource, can improve coordination of the scheduling scheme between resource,
The generation of production disturbance event is reduced, improves the enforceability of plan；Job-Shop is carried out for dispatcher, and auxiliary is provided.
Specifically, the processing module includes：First processing submodule, for according to it is described it is current unlock process set and
Current unlocker device set obtains the quantity of idling-resource and the corresponding current quantity for unlocking process in every a kind of resource；The
Two processing submodules for the quantity according to the idling-resource and the quantity of corresponding current unlock process, obtain every one kind
The bottleneck factor values of resource.
For example, being made the difference using the quantity of the idling-resource per a kind of resource with the quantity of corresponding current unlock process, obtain
The numerical value arrived can just be born as the bottleneck factor values per a kind of resource.
In the present embodiment, the module of establishing includes：Setting up submodule, for by the bottleneck factor values according to by greatly to
Small order is arranged in order, and establishes bottom to the bottleneck device pyramid model of top layer；Wherein, the bottleneck factor values are identical
Resource is located at the same layer of the bottleneck device pyramid model.
Namely bottleneck factor values are bigger, and the bottleneck rank of corresponding resource is lower, in bottleneck device pyramid model
Position is more on the lower.
In order to simplify algorithm, processing time is reduced, in the present embodiment, the scheduler module includes：Acquisition submodule is used for
Since the bottom of the bottleneck device pyramid model, the bottleneck factor values corresponding to current layer are obtained；Submodule is dispatched, is used
In the corresponding scheduling of resource of positive and negative carry out according to the bottleneck factor values corresponding to current layer, until the current unlock process collection
It is combined into zero.
In view of game theory principle, in the present embodiment, the scheduling submodule includes：Processing unit, for working as described
When bottleneck factor values corresponding to front layer are positive value, by the current unlock procedure arrangement of current layer to the current unlocker device collection
In conjunction in the arbitrary equipment of corresponding number；
Judging unit, for when the bottleneck factor values corresponding to the current layer are negative value, judging that current layer judges to be
No is top layer, obtains the first judging result；Acquiring unit, for according to first judging result, obtaining the current unlock
Per the corresponding process information of one kind resource in cluster tool；Scheduling unit, for carrying out scheduling of resource according to the process information.
Specifically, the acquiring unit includes：First obtain subelement, for first judging result for be when,
Obtain the man-hour per one kind resource needed for corresponding each current unlock process in the current unlocker device set；
Corresponding, the scheduling unit includes：First processing subelement, for the man-hour to be arranged according to descending, obtains
To schedule sequences；Second processing subelement, for arranging the man-hour corresponding current unlock process successively according to schedule sequences
To an equipment of corresponding resource, until the free device of corresponding resource is arranged to finish.
Further, the acquiring unit includes：Second obtains subelement, for being no in first judging result
When, it obtains in the current unlocker device set per the corresponding process information to be unlocked of a kind of resource and current unlock process letter
Breath；
The process information to be unlocked includes the time interval with current time at the beginning of process to be unlocked, described to work as
Preceding unlock process information includes the man-hour needed for current unlock process and total undressed man-hour of corresponding workpiece；
Corresponding, the scheduling unit includes：Subelement is dispatched, for always not adding according to the time interval, man-hour and
Work man-hour carries out scheduling of resource.
In order to maximize reduction equipment free time, the scheduling subelement includes：Component is established, for by the time
It is spaced and establishes correspondence less than between the man-hour of predetermined threshold value with the difference of the time interval；Component is dispatched, for root
According to the correspondence or the correspondence and total undressed man-hour, scheduling of resource is carried out.
Specifically, the scheduling component is specifically used for：It is man-to-man, process to be unlocked to arrange the correspondence first
Workpiece corresponding with current unlock process is to corresponding equipment；
Then arrange the correspondence to be one-to-many, the corresponding workpiece of process unlock to correspondence equipment, and according to
The order that total undressed man-hour reduces successively, it is corresponding to arrange current unlock process to corresponding equipment；According still further to described total
The order that undressed man-hour reduces successively is arranged there is no the current process that unlocks of correspondence to corresponding equipment.
To be effectively combined workshop practical condition, the enforceability of plan is improved, the dispatching device further includes：More
New module, for the corresponding scheduling of resource of positive and negative carry out of bottleneck factor values of the scheduling submodule according to corresponding to current layer
Afterwards, the current unlock process set of update and current unlocker device set.
From the foregoing, it will be observed that scheme provided in an embodiment of the present invention can carry out Job-Shop for dispatcher provides auxiliary, and
And have great importance to the solving job shop scheduling problem scheduling with parallel machine：
(1) realize towards multi items, the scheduling of the job-shop scheduling problem with parallel machine of small lot；
(2) by the coordination between multiple agent, the production schedule being autonomously formed has higher flexible, robustness and fits
Ying Xing avoids the generation of disturbance event to a certain extent；
(3) this method is carried out based on receding horizon, is run once, can be effectively combined in each timing node
Workshop practical condition improves the enforceability of plan.
Wherein, the realization embodiment of the dispatching method of above-mentioned job shop resource is suitable for the job shop resource
Dispatching device embodiment in, can also reach identical technique effect.
It should be noted that this many functional component described in this description be all referred to as module/submodule/unit/
Subelement/component, specifically to emphasize the independence of its realization method.
In the embodiment of the present invention, module/submodule/unit/subelement/component can be realized with software, so as to by various
The processor of type performs.For example, the executable code module of a mark can include one of computer instruction or
Multiple physics or logical block, for example, it can be built as object, process or function.Nevertheless, institute's mark module
Executable code need not be physically located together, but can include being stored in different instructions in different positions, when this
When being combined together in a little command logics, form module and realize the regulation purpose of the module.
In fact, executable code module can be the either many item instructions of individual instructions, and can even be distributed
On multiple and different code segments, it is distributed among distinct program and is distributed across multiple memory devices.Similarly, grasp
Making data can be identified in module, and can be realized according to any appropriate form and be organized in any appropriate class
In the data structure of type.The operation data can be collected or can be distributed on different position as individual data collection
(being included in different storage device), and can only be present at least partly as electronic signal in system or network.
When module can utilize software to realize, it is contemplated that the level of existing hardware technique, it is possible to implemented in software
Module, in the case of without considering cost, those skilled in the art can build corresponding hardware circuit to realize correspondence
Function, the hardware circuit includes conventional ultra-large integrated (VLSI) circuit or gate array and such as logic core
The existing semiconductor of piece, transistor etc either other discrete elements.Module can also use programmable hardware device, such as
The realizations such as field programmable gate array, programmable logic array, programmable logic device.
Above-described is the preferred embodiment of the present invention, it should be pointed out that is come for the ordinary person of the art
It says, under the premise of principle of the present invention is not departed from, several improvements and modifications can also be made, these improvements and modifications should also regard
For protection scope of the present invention.
Claims (17)
1. a kind of dispatching method of job shop resource, which is characterized in that including：
Current unlock process set and current unlocker device set are obtained in real time；
According to the current unlock process set and current unlocker device set, the bottleneck factor values of every a kind of resource are obtained；
Bottleneck device pyramid model is established according to the bottleneck factor values；
Scheduling of resource is carried out according to the bottleneck device pyramid model；
Wherein, the current unlock process collection is combined into the set for the undressed process that preamble process has completed,
The current unlocker device collection is combined into the set of current idle equipment.
2. dispatching method according to claim 1, which is characterized in that it is described according to it is described it is current unlock process set and work as
Preceding unlocker device set, the step of obtaining the bottleneck factor values of every a kind of resource, include：
According to the current unlock process set and current unlocker device set, the quantity of idling-resource in every a kind of resource is obtained
With the quantity of corresponding current unlock process；
According to the quantity of the idling-resource and the quantity of corresponding current unlock process, the bottleneck factor of every a kind of resource is obtained
Value.
3. dispatching method according to claim 1, which is characterized in that described to establish bottleneck according to the bottleneck factor values and set
The step of standby pyramid model, includes：
The bottleneck factor values according to descending order are arranged in order, establish bottom to the bottleneck device pyramid of top layer
Model；
Wherein, the identical resource of the bottleneck factor values is located at the same layer of the bottleneck device pyramid model.
4. dispatching method according to claim 1, which is characterized in that it is described according to the bottleneck device pyramid model into
The step of row scheduling of resource, includes：
Since the bottom of the bottleneck device pyramid model, the bottleneck factor values corresponding to current layer are obtained；
The corresponding scheduling of resource of positive and negative carry out of bottleneck factor values according to corresponding to current layer, until the current unlock process
Collection is combined into zero.
5. dispatching method according to claim 4, which is characterized in that the bottleneck factor values according to corresponding to current layer
It is positive and negative, the step of carrying out corresponding scheduling of resource, includes：
When the bottleneck factor values corresponding to the current layer are positive value, the current unlock procedure arrangement of current layer is worked as to described
In preceding unlocker device set in the arbitrary equipment of corresponding number；
When the bottleneck factor values corresponding to the current layer are negative value, judge that current layer determines whether top layer, obtain first
Judging result；
According to first judging result, obtain in the current unlocker device set per the corresponding process information of a kind of resource；
Scheduling of resource is carried out according to the process information.
6. dispatching method according to claim 5, which is characterized in that it is described according to first judging result, obtain institute
The step of stating process information corresponding per one kind resource in current unlocker device set includes：
In first judging result when being, to obtain in the current unlocker device set each work as corresponding per a kind of resource
Man-hour needed for preceding unlock process；
Described the step of carrying out scheduling of resource according to the process information, includes：
The man-hour according to descending is arranged, obtains schedule sequences；
It is arranged successively according to schedule sequences in the man-hour corresponding current unlock process a to equipment of corresponding resource, until right
The free device of resource is answered to be arranged to finish.
7. dispatching method according to claim 5, which is characterized in that it is described according to first judging result, obtain institute
The step of stating process information corresponding per one kind resource in current unlocker device set includes：
Per one kind, resource is corresponding when first judging result is no, in the acquisition current unlocker device set waits to unlock
Process information and current unlock process information；
The process information to be unlocked includes the time interval with current time at the beginning of process to be unlocked, the current solution
Locking process information includes the man-hour needed for current unlock process and total undressed man-hour of corresponding workpiece；
Described the step of carrying out scheduling of resource according to the process information, includes：
According to the time interval, man-hour and total undressed man-hour, scheduling of resource is carried out.
8. dispatching method according to claim 7, which is characterized in that it is described according to the time interval, man-hour and it is total not
The step of machining period, progress scheduling of resource, includes：
It is less than the time interval man-hour of predetermined threshold value between and with the difference of the time interval and establishes correspondence；
According to the correspondence or the correspondence and total undressed man-hour, scheduling of resource is carried out.
9. dispatching method according to claim 8, which is characterized in that described according to the correspondence or described right
Should be related to included with total undressed man-hour, the step of carrying out scheduling of resource：
The correspondence is arranged first to be man-to-man, and process to be unlocked workpiece corresponding with current unlock process to correspondence is set
It is standby；
Then the correspondence is arranged to be one-to-many, and the corresponding workpiece of process unlock is to correspondence equipment, and according to described
The order that total undressed man-hour reduces successively, it is corresponding to arrange current unlock process to corresponding equipment；
According still further to the order that total undressed man-hour reduces successively, arrange that there is no the current unlock processes of correspondence to right
The equipment answered.
10. dispatching method according to claim 4, which is characterized in that the bottleneck according to corresponding to current layer because
After the corresponding scheduling of resource of positive and negative carry out of subvalue, further include：
The current unlock process set of update and current unlocker device set.
11. a kind of dispatching device of job shop resource, which is characterized in that including：
Acquisition module, for obtaining current unlock process set and current unlocker device set in real time；
Processing module, for according to the current unlock process set and current unlocker device set, obtaining every a kind of resource
Bottleneck factor values；
Module is established, for establishing bottleneck device pyramid model according to the bottleneck factor values；
Scheduler module, for carrying out scheduling of resource according to the bottleneck device pyramid model；
Wherein, the current unlock process collection is combined into the set for the undressed process that preamble process has completed,
The current unlocker device collection is combined into the set of current idle equipment.
12. dispatching device according to claim 11, which is characterized in that the scheduler module includes：
Acquisition submodule, for since the bottom of the bottleneck device pyramid model, obtaining the bottleneck corresponding to current layer
Factor values；
Submodule is dispatched, for the corresponding scheduling of resource of positive and negative carry out of the bottleneck factor values according to corresponding to current layer, until
The current unlock process collection is combined into zero.
13. dispatching device according to claim 12, which is characterized in that the scheduling submodule includes：
Processing unit, for when the bottleneck factor values corresponding to the current layer are positive value, current by current layer to unlock work
Sequence arrangement is into the current unlocker device set in the arbitrary equipment of corresponding number；
Judging unit, for when the bottleneck factor values corresponding to the current layer are negative value, judging that current layer determines whether
Top layer obtains the first judging result；
Acquiring unit, for according to first judging result, obtaining in the current unlocker device set per a kind of resource pair
The process information answered；
Scheduling unit, for carrying out scheduling of resource according to the process information.
14. dispatching device according to claim 13, which is characterized in that the acquiring unit includes：
First obtains subelement, for when first judging result is to be, obtaining every in the current unlocker device set
Man-hour needed for the corresponding each current unlock process of a kind of resource；
The scheduling unit includes：
First processing subelement, for the man-hour to be arranged according to descending, obtains schedule sequences；
Second processing subelement, for the man-hour corresponding current unlock process to be arranged to be provided to corresponding successively according to schedule sequences
In one equipment in source, until the free device of corresponding resource is arranged to finish.
15. dispatching device according to claim 13, which is characterized in that the acquiring unit includes：
Second obtains subelement, every in the current unlocker device set for when first judging result is no, obtaining
A kind of corresponding process information to be unlocked of resource and current unlock process information；
The process information to be unlocked includes the time interval with current time at the beginning of process to be unlocked, the current solution
Locking process information includes the man-hour needed for current unlock process and total undressed man-hour of corresponding workpiece；
The scheduling unit includes：
Subelement is dispatched, for according to the time interval, man-hour and total undressed man-hour, carrying out scheduling of resource.
16. dispatching device according to claim 15, which is characterized in that the scheduling subelement includes：
Component is established, for being less than by the time interval and with the difference of the time interval between the man-hour of predetermined threshold value
Establish correspondence；
Component is dispatched, for according to the correspondence or the correspondence and total undressed man-hour, carrying out resource
Scheduling.
17. dispatching device according to claim 16, which is characterized in that the scheduling component is specifically used for：
The correspondence is arranged first to be man-to-man, and process to be unlocked workpiece corresponding with current unlock process to correspondence is set
It is standby；
Then the correspondence is arranged to be one-to-many, and the corresponding workpiece of process unlock is to correspondence equipment, and according to described
The order that total undressed man-hour reduces successively, it is corresponding to arrange current unlock process to corresponding equipment；
According still further to the order that total undressed man-hour reduces successively, arrange that there is no the current unlock processes of correspondence to right
The equipment answered.
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 true CN108073142A (en) | 2018-05-25 |
| CN108073142B 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) |
Cited By (3)
| 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 |
| CN113408902A (en) * | 2021-06-21 | 2021-09-17 | 北京思路智园科技有限公司 | Full-flow production scheduling system and method based on artificial intelligence |
| CN115145231A (en) * | 2022-07-08 | 2022-10-04 | 西安电子科技大学 | Multi-variety variable-batch production scheduling method based on disturbance event |
Citations (9)
| 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 |
| 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 |
| 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 (9)
| 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 |
| 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 |
| US8640137B1 (en) * | 2010-08-30 | 2014-01-28 | Adobe Systems Incorporated | Methods and apparatus for resource management in cluster computing |
| 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 |
| 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 |
Non-Patent Citations (3)
| Title |
|---|
| 周红安 等: "基于TOC的作业计划方法研究", 《机械制造》 * |
| 翟颖妮 等: "大规模作业车间多瓶颈调度算法", 《计算机集成制造系统》 * |
| 黄志 等: "作业车间调度问题的一种启发式算法", 《计算机工程与应用》 * |
Cited By (4)
| 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 |
| CN113408902A (en) * | 2021-06-21 | 2021-09-17 | 北京思路智园科技有限公司 | Full-flow production scheduling system and method based on artificial intelligence |
| CN113408902B (en) * | 2021-06-21 | 2022-08-26 | 北京思路智园科技有限公司 | Full-flow production scheduling system and method based on artificial intelligence |
| CN115145231A (en) * | 2022-07-08 | 2022-10-04 | 西安电子科技大学 | Multi-variety variable-batch production scheduling method based on disturbance event |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108073142B (en) | 2020-01-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pfrommer et al. | PPRS: Production skills and their relation to product, process, and resource | |
| CN105573253B (en) | A kind of industrial robot group control system and method | |
| CN107506956A (en) | Based on improvement particle cluster algorithm supply chain production and transport coordinated dispatching method and system | |
| Cho et al. | Intelligent workstation controller for computer-integrated manufacturing: problems and models | |
| CN108073142A (en) | A kind of dispatching method and device of job shop resource | |
| CN101916404A (en) | Multi-factory cooperative scheduling optimization method during equipment manufacturing | |
| CN103197614B (en) | The automatic material conveyer controlled based on PLC and control method thereof | |
| CN110456746A (en) | A kind of real-time scheduling method of multi items swinging cross automated production | |
| Ioannidis et al. | Fuzzy supervisory control of manufacturing systems | |
| CN106707991B (en) | Bottleneck device recognition methods in multiple target job scheduling based on Fuzzy Level Analytic Approach | |
| CN110472765B (en) | Low-entropy collaborative optimization method for workshop layout scheduling | |
| CN108053152A (en) | The method that improved adaptive GA-IAGA based on polychromatic sets solves dynamic job shop scheduling | |
| CN114154821A (en) | Intelligent scheduling dynamic scheduling method based on deep reinforcement learning | |
| Naylor et al. | The manufacturing game: A formal approach to manufacturing software | |
| CN116523165A (en) | Collaborative optimization method for AMR path planning and production scheduling of flexible job shop | |
| CN104536831B (en) | A kind of multinuclear SoC software image methods based on multiple-objection optimization | |
| CN114936783B (en) | RGV (vehicle target volume) trolley scheduling method and system based on MMDDPG (multimedia messaging service data distribution group) algorithm | |
| CN107991991A (en) | A kind of numerically-controlled machine tool intelligence control system and its method of work based on processing technology cloud knowledge base | |
| CN110092158A (en) | The dispatching method of crossed loops one-way circulation handling system | |
| CN105446203B (en) | A kind of robot power supply control method and system | |
| CN109754133A (en) | Semiconductor processing equipment and row's pallet piling up method and system in each area FAB | |
| Du et al. | Flexible Job Shop scheduling problem solving based on genetic algorithm with model constraints | |
| Schuppe et al. | Decentralized Multi-Agent Strategy Synthesis under LTLf Specifications via Exchange of Least-Limiting Advisers | |
| Gen et al. | Algorithms for solving large-scale 0–1 goal programming and its application to reliability optimization problem | |
| Solberg et al. | Managing information complexity in material flow systems |
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 |