An Improved Firefly Algorithm for the Unrelated Parallel Machines Scheduling Problem With Sequence-Dependent Setup Times

Research in the area of unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times has received little attention from the research community. However, this problem is NP-hard even without considering the setup times, and when sequence-dependent setup times are included, finding optimal solutions becomes very difficult, especially for the problems with large dimension. In this paper, a firefly algorithm (FA) which is refined with a local search solution improvement mechanism is presented to solve this problem, with the objective of reaching a near-optimum solution. Since the classical FA was originally designed for continuous optimization problems, a new solution representation scheme is designed to make the FA suitable for a combinatorial optimization problem such as the UPMSP. Three different popular metaheuristic algorithms are developed in parallel to verify and measure the effectiveness of the proposed algorithm. More so, the success of the novel firefly scheduling method is measured by comparing the quality of its solutions against the best-known methods from the literature. An exhaustive computational and statistical analysis is carried out to show an excellent performance of the new method on a large set of problem instances. The numerical results show that the improved FA is competitive, fast, and efficient and provide good quality solutions for both small and large problem instances.

[1]  Michel Gendreau,et al.  A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 2001, Eur. J. Oper. Res..

[2]  Serestina Viriri,et al.  Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times , 2018, PloS one.

[3]  Rubén Ruiz,et al.  A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times , 2011, Eur. J. Oper. Res..

[4]  Pei-Chann Chang,et al.  Scheduling of drilling operations in printed circuit board factory , 2003 .

[5]  Andrea Matta,et al.  A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility , 2018, Comput. Oper. Res..

[6]  Dervis Karaboga,et al.  On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation , 2015, Inf. Sci..

[7]  Moacir Godinho Filho,et al.  An ant colony optimization approach for the parallel machine scheduling problem with outsourcing allowed , 2015, J. Intell. Manuf..

[8]  Marjan Mernik,et al.  Is a comparison of results meaningful from the inexact replications of computational experiments? , 2016, Soft Comput..

[9]  Stéphane Dauzère-Pérès,et al.  A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing , 2016, J. Sched..

[10]  Ghaith Rabadi,et al.  Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times , 2006, J. Intell. Manuf..

[11]  Ghaith Rabadi,et al.  A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times , 2010, J. Intell. Manuf..

[12]  Byung Soo Kim,et al.  Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability , 2015, Comput. Ind. Eng..

[13]  Shengyao Wang,et al.  A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem , 2014, Knowl. Based Syst..

[14]  Xin-She Yang,et al.  A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduling Problems , 2014, IEEE Transactions on Evolutionary Computation.

[15]  Pei-Chann Chang,et al.  Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times , 2011, Appl. Soft Comput..

[16]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[17]  Ghaith Rabadi,et al.  A Tabu Search Algorithm to Minimize the Makespan for the Unrelated Parallel Machines Scheduling Problem with Setup Times , 2006 .

[18]  Oliver Avalos-Rosales,et al.  Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times , 2015 .

[19]  Amir Saman Kheirkhah,et al.  Two hybrid tabu search–firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost , 2015, Int. J. Comput. Integr. Manuf..

[20]  Shih-Wei Lin,et al.  Makespan minimization for scheduling unrelated parallel machines with setup times , 2010, Journal of Intelligent Manufacturing.

[21]  Rasaratnam Logendran,et al.  An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes , 2017, Comput. Oper. Res..

[22]  Pei-Chann Chang,et al.  A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems , 2014, Appl. Soft Comput..

[23]  Yossi Azar,et al.  2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines , 2018, Inf. Process. Lett..

[24]  Felix T.S. Chan,et al.  A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem , 2017, Sādhanā.

[25]  Shih-Wei Lin,et al.  ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times , 2014, Comput. Oper. Res..

[26]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .

[27]  Ling Wang,et al.  A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints , 2016, Expert Syst. Appl..

[28]  Seyyed M. T. Fatemi Ghomi,et al.  A survey of multi-factory scheduling , 2016, J. Intell. Manuf..

[29]  Amer Draa,et al.  On the performances of the flower pollination algorithm - Qualitative and quantitative analyses , 2015, Appl. Soft Comput..

[30]  Mariappan Kadarkarainadar Marichelvam,et al.  Solving tri-objective multistage hybrid flow shop scheduling problems using a discrete firefly algorithm , 2014, Int. J. Intell. Eng. Informatics.

[31]  Ming Xu,et al.  A Multipopulation Firefly Algorithm for Correlated Data Routing in Underwater Wireless Sensor Networks , 2013, Int. J. Distributed Sens. Networks.

[32]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[33]  Oliver Avalos-Rosales,et al.  Including preventive maintenance activities in an unrelated parallel machine environment with dependent setup times , 2018, Comput. Ind. Eng..

[34]  Georgios C. Anagnostopoulos,et al.  A simulated annealing algorithm for the unrelated parallel machine scheduling problem , 2002, Proceedings of the 5th Biannual World Automation Congress.

[35]  Rubén Ruiz,et al.  Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources , 2017, Eur. J. Oper. Res..

[36]  Ana Carolina Olivera,et al.  A Parallel Discrete Firefly Algorithm on GPU for Permutation Combinatorial Optimization Problems , 2014, CARLA.

[37]  Xin-She Yang,et al.  Firefly algorithm, stochastic test functions and design optimisation , 2010, Int. J. Bio Inspired Comput..

[38]  Lin Lin,et al.  Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey , 2014, J. Intell. Manuf..

[39]  Xin-She Yang,et al.  Firefly Algorithm: Recent Advances and Applications , 2013, ArXiv.

[40]  Kun Chen,et al.  Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines , 2015, Journal of Intelligent Manufacturing.

[41]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[42]  Ghaith Rabadi,et al.  A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: enhancements and experimentations , 2014, J. Intell. Manuf..

[43]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[44]  Chuen-Lung Chen,et al.  Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times , 2009 .

[45]  Mojtaba Afzalirad,et al.  Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions , 2018, J. Intell. Manuf..

[46]  A. Azhagurajan,et al.  Minimisation of total tardiness in hybrid flowshop scheduling problems with sequence dependent setup times using a discrete firefly algorithm , 2018 .

[47]  Jatinder N. D. Gupta,et al.  A comprehensive review of flowshop group scheduling literature , 2016, Comput. Oper. Res..

[48]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[49]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms and Systems Development , 1992 .