A hybrid metaheuristic algorithm for a parallel machine scheduling problem with dependent setup times

Abstract This work proposes a hybrid algorithm that combines GRASP and Variable Neighborhood Search for solving a parallel machine scheduling problem with dependent setup times for minimizing the total completion time. The aim of the problem is to assign jobs to machines and determine the order in which jobs have to be processed on the machines, in such a way that the sum of the completion times of all jobs is minimized. The designed algorithm consists of two phases: construction and improvement, that is performed by means of a general variable neighborhood search. The instances considered to test our algorithm are taken from the literature and the results are compared with the exact solutions obtained by a mathematical model and with the solutions provided by the best heuristic from the literature, which is outperformed by the proposed hybrid algorithm.

[1]  Lars Mönch,et al.  Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times , 2011, Comput. Ind. Eng..

[2]  Chengbin Chu,et al.  An exact method for Pm/sds, ri/sum(i=1, n, Ci) problem , 2007, Comput. Oper. Res..

[3]  Thomas Stützle,et al.  The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.

[4]  Jeffrey E. Schaller,et al.  Minimizing total tardiness for scheduling identical parallel machines with family setups , 2014, Comput. Ind. Eng..

[5]  Fan Baoqiang.  A Column Generation for a Parallel Machine Scheduling with Sequence-Dependent Setup Times , 2006 .

[6]  Ching-Jong Liao,et al.  Unrelated parallel machine scheduling with dedicated machines and common deadline , 2014, Comput. Ind. Eng..

[7]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[8]  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..

[9]  Pierre Lopez,et al.  Parallel machine scheduling with precedence constraints and setup times , 2010, Comput. Oper. Res..

[10]  A. Guinet,et al.  Textile Production Systems: a Succession of Non-identical Parallel Processor Shops , 1991 .

[11]  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 .

[12]  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..

[13]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[14]  Ada M. Alvarez,et al.  Time-dependent formulations for minimizing total completion time in a parallel machine scheduling problem with dependent setup times , 2016 .

[15]  Jésica de Armas,et al.  A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows , 2015, Eng. Appl. Artif. Intell..

[16]  Ali Allahverdi,et al.  The significance of reducing setup times/setup costs , 2008, Eur. J. Oper. Res..

[17]  Francisco Ángel-Bello,et al.  Two improved formulations for the minimum latency problem , 2013 .

[18]  John Lu,et al.  Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective , 2001 .

[19]  Hang Lei,et al.  Minimizing the total completion time in a distributed two stage assembly system with setup times , 2014, Comput. Oper. Res..

[20]  Fuh-Der Chou,et al.  Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups , 2008 .

[21]  Zhi-Yu Xu,et al.  A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics , 2014 .

[22]  John W. Fowler,et al.  A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups , 2003 .

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

[24]  Ling-Huey Su,et al.  Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints , 2009 .

[25]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[26]  Jiping Tao,et al.  A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time , 2014, Comput. Oper. Res..

[27]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.