CN108734407A - The limited voluminous line scheduling method of online assignment kind number simultaneously - Google Patents
The limited voluminous line scheduling method of online assignment kind number simultaneously Download PDFInfo
- Publication number
- CN108734407A CN108734407A CN201810512169.3A CN201810512169A CN108734407A CN 108734407 A CN108734407 A CN 108734407A CN 201810512169 A CN201810512169 A CN 201810512169A CN 108734407 A CN108734407 A CN 108734407A
- Authority
- CN
- China
- Prior art keywords
- task
- scheduling
- period
- scheduled production
- row
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention is used for heuristic to solve the voluminous line scheduling problem that online assignment kind number is limited simultaneously, in view of task delivers time limit, change the outfit time and limited kind of the number of online assignment, give three kinds of different scheduling patterns, three kinds of scheduling patterns are used in combination, to solve the voluminous line scheduling problem that online assignment kind number is limited simultaneously, institute's Prescribed Properties and the simultaneously limited requirement of online assignment kind number are met, operation time is shortened, obtains the scheduling result for meeting production requirement.The beneficial effects of the present invention are：1, using heuristic scheduling, the scheduling time is saved；2, according to being likely to occur in scheduling the case where, three kinds of different scheduling patterns are used in combination, and under conditions of ensuring that the task kind number of same scheduling period all producing lines is no more than limitation kind number, not only ensure that task was completed as early as possible, but also reduce switching time.
Description
Technical field
The present invention relates to a kind of limited voluminous line scheduling methods of while online assignment kind number.
Background technology
More operations, voluminous line scheduling are that several work is arranged in a plurality of producing line, make the various operation delay in delivery times
It is most short.In production practice, some producers need for respective, can also pair method for the treatment of number appeared in producing line simultaneously limit
System, this generates the limited voluminous line scheduling problems of online assignment kind number simultaneously.More operations, voluminous line scheduling are natively
Be multiple target, multiple constraint np hard problem, be further added by while the limitation of online assignment kind number, it is exactly hardly possible to solve this problem
Upper plus hardly possible.
For np hard problem, although oneself has the history of decades to its research, set of system is not yet formed so far
Method and theory, there is also very big gaps between theoretical research and practical application.Especially as JIT, (Just In Time are
Completed so that workpiece presses delivery date as possible) the widely used scheduling problem of thought, become more and more prominent.Row in practical application
The scheduling that Cheng Fangfa is capable of the dynamic change of response system, but cannot be guaranteed：Some theoretic optimal method energy
There is provided optimal scheduling, but due to the complexity of its calculating, and have ignored many practical factors, from practice also have it is larger away from
From.Method based on optimization, such as dynamic programming algorithm and branch-bound algorithm etc., since most of its is built upon pair
The part of possible scheduling is enumerated, therefore can only solve small-scale scheduling problem, and distance is practical relatively large distance.Due to big
More scheduling problems belong to a kind of NP difficulties combinatorial problem, therefore find the optimal algorithm with polynomial complexity and be practically impossible to
's.Various method, simulated annealing, genetic algorithms etc. based on statistic op- timization provide a kind of solution scheduling optimization and ask
The new way of topic, but similar with other optimization algorithm is enumerated there is also a degree of, in general converges to optimal solution very
Slowly.
Heuristic is to simplify solution procedure using some simple logic judgment rules, its purpose is to reduce
The search time spent when solution and search space, using upper very simple and convenient, a most typical example is exactly to utilize
Heuristic can ideally solve sequencing problem.
Invention content
For NP difficulty Combinational Mathematics problems as the limited voluminous line scheduling of online assignment kind number simultaneously, it is contemplated that seek
Optimal algorithm with polynomial complexity is nearly impossible, and is converged to using simulated annealing, genetic algorithm etc.
Optimal solution is that especially slowly, and can ideally solve sequencing problem using heuristic again, and the present invention is by heuristic side
Method is used to solve the voluminous line scheduling problem that online assignment kind number is limited simultaneously, it is contemplated that task delivery time limit, change the outfit the time with
And online assignment is limited kind of number, gives three kinds of different scheduling patterns, and three kinds of scheduling patterns are used in combination, to solve simultaneously
The limited voluminous line scheduling problem of online assignment kind number meets institute's Prescribed Properties and is wanted with what online assignment kind number simultaneously was limited
It asks, shortens operation time, obtain the scheduling result for meeting production requirement.
The beneficial effects of the present invention are：
1. using heuristic scheduling, the scheduling time is saved；
2. the case where according to being likely to occur in scheduling, three kinds of different scheduling patterns are used in combination, when ensuring same scheduling
The task kind number of Duan Suoyou producing lines is no more than under conditions of limitation kind number, not only ensure that task was completed as early as possible, but also reduce switching
Time.In the operation number of a machine, once more hour operation quantities will not still become especially complex.
Description of the drawings
The N-S flow charts of Fig. 1 scheduling methods.
Initialization in figure includes following content：
1. on scheduled production total task number n, producing line quantity m, scheduled production period number p needed to be considered, day part task kind number
Limit C assignment；
2. couple i=1,2, Λ, n, j=1,2, Λ, m, to deliver time limit D (i), task quantity M (i) and per period workload
vijAssignment；
3 day part task kind matrix numbers, scheduling label matrix and each producing line team leader zero：
Wherein zeros (i, j) indicates the full null matrix of i rows j row.
Specific implementation mode
Multiple tasks are arranged in a plurality of producing line, it is desirable that task kind number in synchronization producing line is no more than on a certain
Limit, and this upper limit is also because concrete condition changes, here it is the limited voluminous line scheduling problems of online assignment kind number simultaneously.
In view of the variation of the task kind number upper limit, it is necessary to it is set to variable, in this way, same scheduling method, by different
Upper limit setting can solve the scheduling problem of different task kind number upper limit requirement.
The minimum time unit of scheduled production is known as the period, it is contemplated that change the outfit problem, the length of this period preferably with changing the outfit when
Between it is equal.Indicate scheduled production period number needed to be considered with p, day part be known as successively the first period, the second period ..., pth when
Section.Indicate scheduled production total task number, producing line quantity and the day part task kind number upper limit respectively with n, m and C, task number i (i=1,
2, Λ, n) priority of task is represented, D (i) and M (i) indicated the quantity of the task of serial number i and respectively as unit of the periods
Deliver time limit, V=(vij)m×nIndicate relevant per period workload with producing line and task, row indicates that different producing lines, row indicate not
Same task, E=(E1, E2, Λ, Em) indicate each producing line team leader vector of current scheduled.Indicate that scheduling marks with m row p column matrix S
Matrix, its row is corresponding with m producing line, row it is corresponding with p period, element with after scheduling task number or the symbol " NAN " that changes the outfit it is right
It answers.In order to understand same period scheduled task kind number in time, day part task kind matrix number is indicated with 1 row p column matrix A, is arranged
Number corresponding period serial number, task kind number in element representation period S.
Since the task kind number of each period is no more than C, when the task kind number of a period reaches C-1
When, when next task scheduling, must take the producing line of this period, except non task is drained, otherwise will result in producing line
It is idle.Its scheduled production pattern is：
Scheduled production pattern 1.
In the specified period, since first producing line, skip be not zero in those scheduling Mark-matrix Ss element position into
Row scheduled production is discharged to always the m articles producing line in the case that task is not drained.When the task of j-th of period of drained the h articles producing line
Afterwards, M (i) and S are updated as follows：
If the task kind number of all periods is less than C-1, next task scheduling can not be limited by task kind number upper limit C
System, but in order to complete task in delivery time limit, and the number that changes the outfit is reduced as far as possible, need the delivery limit for considering next task
Whether the phase is already expired.If delivering the non-mistake of time limit, following scheduled production pattern is used：
Scheduled production pattern 2.
If next task number is i, h is asked to make
Then from E in the h articles producing lineh+ 1 period starts scheduled production, is discharged to D always in the case that task is not drained
(i) a period.After the task of j-th of period of drained the h articles producing line, M (i) and S are updated as follows：
If delivering the non-mistake of time limit, in order to reduce the delay time of task, next task is completed by whole producing lines, scheduled production
Pattern is：
Scheduled production pattern 3.
In the specified period, since first producing line, it is discharged to the m articles producing line always in the case that task is not drained.When
After the task of j-th of period of drained the h articles producing line, M (i) and S are updated as follows：
After each task is drained, the row for becoming nonzero element appearance from zero in Mark-matrix S before and after the task scheduled production are
Task kind matrix number A needs newer row, and newer mode is that the element of the respective column of A adds 1.When a kind of task all it is drained it
Need to stay changing the outfit the time for period afterwards, corresponding position needs plus change the outfit symbol " NAN " to embody in scheduling Mark-matrix S.If one
Task team leader E before and after scheduled productionh(h=1,2, Λ, m) is changed, and the operation S (h, the E that add the symbol " NAN " that changes the outfit are neededh+ 1)=
NAN。
The step of online assignment kind number limited voluminous line scheduling method is simultaneously：
1) it initializes：
For n, m, p, C assignment；It is D (i), M (i) and v to i=1,2, Λ, n, j=1,2, Λ, mijAssignment；Task pointer,
Day part task kind matrix number, scheduling label matrix and each producing line team leader zero：
Wherein zeros (i, j) indicates the full null matrix of i rows j row.
2) as A (min (E)+1)=C-1 and M (i) > 0
1 scheduled production of scheduled production pattern, update M (i), S, min (E) are pressed in period min (E)+1；
2 are returned as A (min (E)+1)=C-1 and M (i) > 0)；
3) as+1 < D (i) of min (E) and M (i) > 0
H=min (E) is by 2 scheduled production of scheduled production pattern update M (i), S, min (E)；
3 are returned as+1 < D (i) of min (E) and M (i) > 0)；
4) as M (i) > 0
By 3 scheduled production of scheduled production pattern update M (i), S, min (E)；
It is returned 4) as M (i) > 0；
5) plus the symbol NAN that changes the outfit updates S, A, E
If 6) i < n,It returns 1)
7) S is exported, scheduling terminates.
Claims (1)
1. a kind of limited voluminous line scheduling method of while online assignment kind number, it is characterised in that：Indicate that scheduled production needs to consider with p
Period number, day part successively be known as the first period, the second period ..., the pth period；Indicate that scheduled production is appointed respectively with n, m and C
Business sum, producing line quantity and the day part task kind number upper limit, task number i (i=1,2, Λ, n) represent the priority of task, D
(i) quantity for indicating the task of serial number i respectively with M (i) and the delivery time limit as unit of the period, V=(vij)m×nIndicate with
Producing line and task are relevant per period workload, and row indicates that different producing lines, row indicate different task, E=(E1, E2, Λ, Em) table
Show each producing line team leader vector of current scheduled；Indicating that scheduling marks matrix with m row p column matrix S, its row is corresponding with m producing line,
Row it is corresponding with p period, element with after scheduling task number or change the outfit symbol " NAN " it is corresponding；Day part is indicated with 1 row p column matrix A
Task kind matrix number, row number correspond to period serial number, task kind number in element representation period S；WithIndicate variable assignments
Number, three kinds of basic scheduled production patterns are：
Scheduled production pattern 1：In the specified period, since first producing line, the element that is not zero in those scheduling Mark-matrix Ss is skipped
Position carries out scheduled production, is discharged to the m articles producing line always in the case that task is not drained；
Scheduled production pattern 2：If next task number is i, h is asked to make
Then from E in the h articles producing lineh+ 1 period starts scheduled production, and in task, not drained to be discharged to D (i) always a
Period；
Scheduled production pattern 3：In the specified period, since first producing line, it is discharged to the m articles production always in the case that task is not drained
Line；
The step of online assignment kind number limited voluminous line scheduling method is simultaneously：
1) it initializes：
For n, m, p, C assignment；It is D (i), M (i) and v to i=1,2, Λ, n, j=1,2, Λ, mijAssignment；Task pointer, it is each when
Section task kind matrix number, scheduling label matrix and each producing line team leader zero：
Wherein zeros (i, j) indicates the full null matrix of i rows j row.
2) as A (min (E)+1)=C-1 and M (i) > 0
1 scheduled production of scheduled production pattern, update M (i), S, min (E) are pressed in period min (E)+1；
2 are returned as A (min (E)+1)=C-1 and M (i) > 0)；
3) as+1 < D (i) of min (E) and M (i) > 0
H=min (E) is by 2 scheduled production of scheduled production pattern update M (i), S, min (E)；
3 are returned as+1 < D (i) of min (E) and M (i) > 0)；
4) as M (i) > 0
By 3 scheduled production of scheduled production pattern update M (i), S, min (E)；
It is returned 4) as M (i) > 0；
5) plus the symbol NAN that changes the outfit updates S, A, E
If 6) i < n,It returns 1)
7) S is exported, scheduling terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810512169.3A CN108734407A (en) | 2018-05-25 | 2018-05-25 | The limited voluminous line scheduling method of online assignment kind number simultaneously |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810512169.3A CN108734407A (en) | 2018-05-25 | 2018-05-25 | The limited voluminous line scheduling method of online assignment kind number simultaneously |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108734407A true CN108734407A (en) | 2018-11-02 |
Family
ID=63935354
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810512169.3A Pending CN108734407A (en) | 2018-05-25 | 2018-05-25 | The limited voluminous line scheduling method of online assignment kind number simultaneously |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108734407A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1556486A (en) * | 2003-12-31 | 2004-12-22 | 冶金自动化研究设计院 | Integrated iron and steel enterprise production process on line planning and controlling system and method |
| CN103049801A (en) * | 2012-12-20 | 2013-04-17 | 四川长虹电器股份有限公司 | Optimal design method for production line layout |
| CN105321042A (en) * | 2015-10-19 | 2016-02-10 | 金航数码科技有限责任公司 | Genetic algorithm-based advanced plan scheduling system and method |
| US20160179081A1 (en) * | 2014-12-22 | 2016-06-23 | Siemens Aktiengesellschaft | Optimized Production Scheduling Using Buffer Control and Genetic Algorithm |
| CN107168267A (en) * | 2017-06-29 | 2017-09-15 | 山东万腾电子科技有限公司 | Based on the production scheduling method and system for improving population and heuristic strategies |
-
2018
- 2018-05-25 CN CN201810512169.3A patent/CN108734407A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1556486A (en) * | 2003-12-31 | 2004-12-22 | 冶金自动化研究设计院 | Integrated iron and steel enterprise production process on line planning and controlling system and method |
| CN103049801A (en) * | 2012-12-20 | 2013-04-17 | 四川长虹电器股份有限公司 | Optimal design method for production line layout |
| US20160179081A1 (en) * | 2014-12-22 | 2016-06-23 | Siemens Aktiengesellschaft | Optimized Production Scheduling Using Buffer Control and Genetic Algorithm |
| CN105321042A (en) * | 2015-10-19 | 2016-02-10 | 金航数码科技有限责任公司 | Genetic algorithm-based advanced plan scheduling system and method |
| CN107168267A (en) * | 2017-06-29 | 2017-09-15 | 山东万腾电子科技有限公司 | Based on the production scheduling method and system for improving population and heuristic strategies |
Non-Patent Citations (3)
| Title |
|---|
| 于喆: "高级排产计划中启发式算法研究与实现", 《中国优秀博硕士学位论文全文数据库(硕士) 信息科技辑》 * |
| 刘彦斌 等: "多目标约束下软件运行时验证加速技术框架", 《兵器装备工程学报》 * |
| 刘艳丽 等: "启发式算法在计划排产中的应用", 《计算机技术与发展》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities | |
| Li et al. | An improved artificial bee colony algorithm with Q-learning for solving permutation flow-shop scheduling problems | |
| Grabowska | Smart factories in the age of Industry 4.0 | |
| Solimanpur et al. | A heuristic to minimize makespan of cell scheduling problem | |
| Saad | The reconfiguration issues in manufacturing systems | |
| Liu et al. | Reconfiguration of virtual cellular manufacturing systems via improved imperialist competitive approach | |
| Toledo et al. | Glass container production scheduling through hybrid multi-population based evolutionary algorithm | |
| CN110533301A (en) | A kind of population dispatching method based on dynamic constrained matrix | |
| Bakshi et al. | The sequencing problem | |
| Mundim et al. | A general heuristic for two-dimensional nesting problems with limited-size containers | |
| CN109784656A (en) | A kind of discrete manufacture collaborative production planning scheduling method | |
| Hu et al. | A particle swarm optimization algorithm for multi-row facility layout problem in semiconductor fabrication | |
| CN106022601B (en) | Multi-target resource allocation method | |
| CN105976122A (en) | Multi-target resource allocation system | |
| Hidayat et al. | A batch scheduling model for m heterogeneous batch processor | |
| Ko et al. | Balancing of manufacturing systems with complex configurations for delayed product differentiation | |
| Sels et al. | A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups | |
| Manupati et al. | Intelligent search techniques for network-based manufacturing systems: multi-objective formulation and solutions | |
| CN108734407A (en) | The limited voluminous line scheduling method of online assignment kind number simultaneously | |
| Liu et al. | Intelligent optimization approach to cell formation and product scheduling for multifactory cellular manufacturing systems considering supply chain and operational error | |
| Ahmed et al. | Experience-based decisional DNA (DDNA) to support product development | |
| CN109085804A (en) | It is a kind of for electronic product multiplexing factory manufacture process Optimization Scheduling | |
| CN115081755B (en) | Production and maintenance cooperative scheduling method and system based on variable neighborhood search algorithm | |
| Omar et al. | An optimal batch size for a production system under linearly increasing time-varying demand process | |
| Hwang et al. | Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20181102 |