A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm

Distributed scheduling problems are among the most investigated research topics in the fields of Operational Research, and represents one of the greatest challenges faced by industrialists and researchers today. The Distributed Job shop Scheduling Problem (DJSP) deals with the assignment of jobs to factories and with determining the sequence of operations on each machine in distributed manufacturing environments. The objective is to minimize the global makespan over all the factories. Since the problem is NP-hard to solve, one option to cope with this intractability is to use an approximation algorithm that guarantees near-optimal solutions quickly. Ant based algorithm has proved to be very effective and efficient in numerous scheduling problems, such as permutation flow shop scheduling, flexible job shop scheduling problems and network scheduling, etc. This paper proposes a hybrid ant colony algorithm combined with local search to solve the Distributed Job shop Scheduling Problem. A novel dynamic assignment rule of jobs to factories is also proposed. Furthermore, the Taguchi method for robust design is adopted for finding the optimum combination of parameters of the ant-based algorithm. To validate the performance of the proposed algorithm, intensive experiments are carried out on 480 large instances derived from well-known classical job-shop scheduling benchmarks. Also, we show that our algorithm can process up to 10 factories. The results prove the efficiency of the proposed algorithm in comparison with others.

[1]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[2]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[3]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[4]  Yuhui Shi,et al.  Handbook of Swarm Intelligence: Concepts, Principles and Applications , 2011 .

[5]  A. Azab,et al.  Modeling and heuristics for scheduling of distributed job shops , 2014, Expert Syst. Appl..

[6]  Kathryn A. Dowsland,et al.  An improved ant colony optimisation heuristic for graph colouring , 2008, Discret. Appl. Math..

[7]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[8]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[9]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[10]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

[11]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[12]  Min Liu,et al.  An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling , 2012 .

[13]  Yun-Chia Liang,et al.  Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem , 2006 .

[14]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[15]  Li-Chen Fu,et al.  Using dispatching rules for job shop scheduling with due date-based objectives , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[16]  Kamran Zamanifar,et al.  An agent-based parallel approach for the job shop scheduling problem with genetic algorithms , 2010, Math. Comput. Model..

[17]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

[18]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[19]  Khaled Ghédira,et al.  Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment , 2016, Applied Intelligence.

[20]  V. K. Jayaraman,et al.  Ant colony framework for optimal design and scheduling of batch plants , 2000 .

[21]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[22]  Khaled Ghédira,et al.  A Survey of Optimization Techniques for Distributed Job Shop Scheduling Problems in Multi-factories , 2017, CSOC.

[23]  Andrew Y. C. Nee,et al.  Web-based Multi-functional Scheduling System for a Distributed Manufacturing Environment , 2002, Concurr. Eng. Res. Appl..

[24]  Yuhui Shi,et al.  Handbook of Swarm Intelligence , 2011 .

[25]  Walter J. Gutjahr,et al.  An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria , 2007, Comput. Oper. Res..

[26]  Mitsuo Gen,et al.  A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem , 2005, Comput. Ind. Eng..

[27]  Sheik Meeran,et al.  A multi-level hybrid framework applied to the general flow-shop scheduling problem , 2002, Comput. Oper. Res..

[28]  Francisco Herrera,et al.  A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System , 2000 .

[29]  Amr Arisha,et al.  Practical simulation application: Evaluation of process control parameters in Twisted-Pair Cables manufacturing system , 2010, Simul. Model. Pract. Theory.

[30]  Bor-Wen Cheng,et al.  A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm , 2007, Expert Syst. Appl..

[31]  Pisal Yenradee,et al.  PSO-based algorithm for home care worker scheduling in the UK , 2007, Comput. Ind. Eng..

[32]  Ponnuthurai N. Suganthan,et al.  A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint , 2015, Soft Computing.

[33]  Andrew Y. C. Nee,et al.  Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems , 2007, Comput. Ind. Eng..

[34]  Richard Romanowski,et al.  Multi-contextual ant colony optimization of intermediate dynamic job shop problems , 2012 .

[35]  Shi-Jinn Horng,et al.  An efficient job-shop scheduling algorithm based on particle swarm optimization , 2010, Expert Syst. Appl..

[36]  Rui Zhang,et al.  A hybrid approach to large-scale job shop scheduling , 2010, Applied Intelligence.

[37]  Andrew Y. C. Nee,et al.  Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems , 2009 .

[38]  Ahmed Azab,et al.  An improved model and novel simulated annealing for distributed job shop problems , 2015 .

[39]  Gary R. Weckman,et al.  A neural network job-shop scheduler , 2008, J. Intell. Manuf..

[40]  Zahid A. Khan,et al.  Application of Taguchi Method in the Optimization of Injection Moulding Parameters for Manufacturing Products from Plastic Blend , 2010 .

[41]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[42]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[43]  Martín Tanco,et al.  Comparing Different Approaches for Design of Experiments (DoE) , 2008, World Congress on Engineering.

[44]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[45]  F. Pettersson,et al.  Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem , 2007, Appl. Math. Comput..

[46]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[47]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[48]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[49]  Yongquan Zhou,et al.  Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem , 2014, Neurocomputing.

[50]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[51]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

[52]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[53]  R. Suresh,et al.  Pareto archived simulated annealing for job shop scheduling with multiple objectives , 2006 .

[54]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[55]  Chuen-Lung Chen,et al.  Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines , 2009, Comput. Ind. Eng..

[56]  Dazhi Wang,et al.  A constraint programming-based branch and bound algorithm for job shop problems , 2010, 2010 Chinese Control and Decision Conference.

[57]  Malcolm Yoke-Hean Low,et al.  A Bee Colony Optimization Algorithm to Job Shop Scheduling , 2006, Proceedings of the 2006 Winter Simulation Conference.

[58]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[59]  Bo Yu,et al.  An Improved Artificial Bee Colony Algorithm for Job Shop Problem , 2010 .

[60]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[61]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[62]  A. Tamilarasi,et al.  Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems , 2009 .

[63]  Francisco Herrera,et al.  Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling , 2012, J. Intell. Manuf..

[64]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[65]  Shijin Wang,et al.  A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling , 2015 .

[66]  Hari Singh,et al.  Optimizing cutting force for turned parts by Taguchi's parameter design approach , 2005 .