Search tree based approaches for parallel machine scheduling

This article compares two branching schemes for the parallel machine scheduling problem with release dates and tails. Both branching schemes can be used for either complete or incomplete search tree based algorithms. In particular, our study aims to prove the robustness of each of them for several search methods. We experimentally compare the efficiency of the two branching schemes when they are used in a branch-and-bound (BnB) method, in a limited discrepancy search, in a branch-and-greed (BnG) method or in a beam search (BS).

[1]  Mohamed Haouari,et al.  An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines , 2003, Oper. Res. Lett..

[2]  S. Webster.  A general lower bound for the makespan problem , 1996 .

[3]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[4]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[5]  Eric Pinson,et al.  Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem , 1998, Ann. Oper. Res..

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

[7]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .

[8]  S. Voss,et al.  The pilot method; a strategie of heuristic repetition with application to the Steiner problem in graphs , 1996 .

[9]  Emmanuel Néron,et al.  Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem , 2006, 4OR.

[10]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[11]  Mohamed Haouari,et al.  An approximate decomposition algorithm for scheduling on parallel machines with heads and tails , 2007, Comput. Oper. Res..

[12]  Roberto Tadei,et al.  A hybrid polynomial heuristic framework for combinatorial optimization problems , 2000 .

[13]  Emmanuel Néron,et al.  Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines , 2004, Oper. Res. Lett..

[14]  Chris N. Potts,et al.  Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach , 2005, Eur. J. Oper. Res..

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

[16]  Han Hoogeveen,et al.  Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop , 2005, INFORMS J. Comput..

[17]  Cees Duin,et al.  Looking Ahead with the Pilot Method , 2005, Ann. Oper. Res..

[18]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[19]  Francis Sourd.  Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures , 2001, J. Heuristics.

[20]  Francis Sourd,et al.  Fiber-to-object assignment heuristics , 1999, Eur. J. Oper. Res..

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