Solving parallel machines job-shop scheduling problems by an adaptive algorithm

A parallel machines job-shop problem is a generalisation of a job-shop problem to the case when there are identical machines of the same type. Job-shop problems encountered in a flexible manufacturing system, train timetabling, production planning and in other real-life scheduling systems. This paper presents an adaptive algorithm with a learning stage for solving the parallel machines job-shop problem. A learning stage tends to produce knowledge about a benchmark of priority dispatching rules allowing a scheduler to improve the quality of a schedule which may be useful for a similar scheduling problem. Once trained on solving sample problems (usually with small sizes), the adaptive algorithm is able to solve similar job-shop problems with larger size better than heuristics used as a benchmark at the learning stage. For using an adaptive algorithm with a learning stage, a job-shop problem is modelled via a weighted mixed graph with a conflict resolution strategy used for finding an appropriate schedule. We show how to generalise the mixed graph model for solving parallel machines job-shop problem. The proposed adaptive algorithm is tested on benchmark instances.

[1]  Karin Krüger,et al.  Heuristics for generalized shop scheduling problems based on decomposition , 1998 .

[2]  KarimiN.,et al.  Bi-objective group scheduling in hybrid flexible flowshop , 2010 .

[3]  Hassan Rashidi,et al.  An Approach Of Cellular Learning Automata To Job Shop Scheduling Problem , 2011 .

[4]  Reha Uzsoy,et al.  Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach , 2006, J. Sched..

[5]  Takao Nishizeki,et al.  Graph Theory and Algorithms , 1981, Lecture Notes in Computer Science.

[6]  Natalia V. Shakhlevich,et al.  NP-hardness of Shop-scheduling Problems with Three Jobs , 1995, Discret. Appl. Math..

[7]  Yunus Demir,et al.  Evaluation of mathematical models for flexible job-shop scheduling problems , 2013 .

[8]  Li-Ning Xing,et al.  Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling , 2009, Appl. Soft Comput..

[9]  Wojciech Bozejko,et al.  Parallel hybrid metaheuristics for the flexible job shop problem , 2010, Comput. Ind. Eng..

[10]  Quan-Ke Pan,et al.  An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems , 2012, Appl. Math. Comput..

[11]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[12]  Mohamed Haouari,et al.  Discrepancy search for the flexible job shop scheduling problem , 2010, Comput. Oper. Res..

[13]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[14]  Mostafa Zandieh,et al.  Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach , 2010, Expert Syst. Appl..

[15]  Frank Werner,et al.  Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway , 2012, SIMULTECH.

[16]  N. V. Shakhlevich,et al.  Adaptive scheduling algorithm based on mixed graph model , 1996 .

[17]  M.C. Gomes *,et al.  Optimal scheduling for flexible job shop operation , 2005 .

[18]  Mitsuo Gen,et al.  Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey , 2009, Comput. Ind. Eng..

[19]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[20]  Mostafa Zandieh,et al.  An artificial immune algorithm for the flexible job-shop scheduling problem , 2010, Future Gener. Comput. Syst..

[21]  Matthias Ehrgott,et al.  Railway track allocation: models and methods , 2011, OR Spectr..

[22]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[23]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[24]  Andrea Rossi,et al.  A hybrid heuristic to solve the parallel machines job-shop scheduling problem , 2009, Adv. Eng. Softw..

[25]  D.-C. Li,et al.  USING UNSUPERVISED LEARNING TECHNOLOGIES TO INDUCE SCHEDULING KNOWLEDGE FOR FMSE , 1994 .

[26]  James C. Chen,et al.  Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm , 2012, Expert Syst. Appl..

[27]  Henri Pierreval,et al.  Training a neural network to select dispatching rules in real time , 2010, Comput. Ind. Eng..

[28]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .