Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

In this paper we consider the well-known single machine scheduling problem with release dates and minimization of the total job completion time. For solving this problem, denoted by 1|r"j|@?C"j, we provide a new metaheuristic which is an extension of the so-called filtered beam search proposed by Ow and Morton [30]. This metaheuristic, referred to as a Genetic Recovering Beam Search (GRBS), takes advantages of a Genetic Local Search (GLS) algorithm and a Recovering Beam Search (RBS) in order to efficiently explore the solution space. In this paper we present the GRBS framework and its application to the 1|r"j|@?C"j problem. Computational results show that it consistently yields optimal or near-optimal solutions and that it provides interesting results by comparison to GLS and RBS algorithms. Moreover, these results highlight that the proposed algorithm outperforms the state-of-the-art heuristics.

[1]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[2]  Günther R. Raidl,et al.  A Unified View on Hybrid Metaheuristics , 2006, Hybrid Metaheuristics.

[3]  Vincent T'Kindt,et al.  Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems , 2004, J. Sched..

[4]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[5]  Federico Della Croce,et al.  A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem , 2002, J. Oper. Res. Soc..

[6]  Chengbin Chu.  Efficient heuristics to minimize total flow time with release dates , 1992, Oper. Res. Lett..

[7]  David J. Lilja,et al.  Measuring computer performance : A practitioner's guide , 2000 .

[8]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[9]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[10]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[11]  Mohamed Haouari,et al.  A branch-and-bound-based local search method for the flow shop problem , 2003, J. Oper. Res. Soc..

[12]  Chengbin Chu.  A branch‐and‐bound algorithm to minimize total flow time with unequal release dates , 1992 .

[13]  Giovanni Manzini,et al.  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..

[14]  Andrew Lim,et al.  Minimizing total flow time in single machine environment with release time: an experimental analysis , 2004, Comput. Ind. Eng..

[15]  Günther R. Raidi.  A unified view on hybrid metaheuristics , 2006 .

[16]  Carlos Cotta,et al.  Hybridizations of Metaheuristics With Branch & Bound Derivates , 2008, Hybrid Metaheuristics.

[17]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[18]  Reha Uzsoy,et al.  An iterative heuristic for the single machine dynamic total completion time scheduling problem , 1996, Comput. Oper. Res..

[19]  Roberto Tadei,et al.  Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems , 2004, J. Heuristics.

[20]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[21]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[22]  Christian Blum,et al.  Hybrid Metaheuristics: An Introduction , 2008, Hybrid Metaheuristics.

[23]  Jiyin Liu,et al.  Effective heuristics for the single machine sequencing problem with ready times , 1991 .

[24]  Philippe Baptiste,et al.  Dominance-based heuristics for one-machine total cost scheduling problems , 2008, Eur. J. Oper. Res..

[25]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[26]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[27]  Irène Charon,et al.  The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..

[28]  El-Ghazali Talbi,et al.  Hybridizing exact methods and metaheuristics: A taxonomy , 2009, Eur. J. Oper. Res..

[29]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[30]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[31]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[32]  Talel Ladhari,et al.  Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop , 2009 .

[33]  Reha Uzsoy,et al.  Single-machine scheduling with dynamic arrivals : Decomposition results and an improved algorithm , 1996 .

[34]  Reha Uzsoy,et al.  Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates , 1997, Ann. Oper. Res..

[35]  Gerhard J. Woeginger,et al.  Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine , 1999, SIAM J. Comput..

[36]  Chris N. Potts,et al.  Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs , 1996 .

[37]  Colin R. Reeves,et al.  Heuristics for scheduling a single machine subject to unequal job release times , 1995 .

[38]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .