Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment-based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.

[1]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[2]  Uttarayan Bagchi,et al.  Lower bounds for single‐machine scheduling problems , 1990 .

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

[4]  Andrew V. Goldberg,et al.  An efficient cost scaling algorithm for the assignment problem , 1995, Math. Program..

[5]  Han Hoogeveen,et al.  Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time , 1994, Oper. Res. Lett..

[6]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[7]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[8]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[9]  Can Akkan,et al.  The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm , 2004, Eur. J. Oper. Res..

[10]  Jatinder N. D. Gupta,et al.  An empirical analysis of integer programming formulations for the permutation flowshop , 2004 .

[11]  Han Hoogeveen,et al.  Lower bounds for minimizing total completion time in a two-machine flow shop , 2006, J. Sched..

[12]  Mohamed Ali Rakrouki,et al.  A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates , 2009, 2009 International Conference on Computers & Industrial Engineering.

[13]  Emre A. Veral,et al.  OUTPATIENT SCHEDULING IN HEALTH CARE: A REVIEW OF LITERATURE , 2003 .

[14]  Ahmet B. Keha,et al.  Mixed integer programming formulations for single machine scheduling problems , 2009, Comput. Ind. Eng..

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

[16]  I. Tajunisah,et al.  Ophthalmology inpatient consultation: does it make a difference to inpatient management? , 2009, The Medical journal of Malaysia.

[17]  Mohamed Haouari,et al.  MIP models for minimizing total tardiness in a two-machine flow shop , 2013, J. Oper. Res. Soc..

[18]  Jacques Teghem,et al.  Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints , 2013, Int. Trans. Oper. Res..

[19]  Angel A. Juan,et al.  Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues , 2014, Int. Trans. Oper. Res..

[20]  Federico Della Croce,et al.  A matheuristic approach for the two-machine total completion time flow shop problem , 2014, Ann. Oper. Res..

[21]  Chin-Chia Wu,et al.  A Truncated Sum of Processing‐Times–Based Learning Model for a Two‐Machine Flowshop Scheduling Problem , 2014 .

[22]  Mehdi Serairi,et al.  A mixed integer programming approach for the single machine problem with unequal release dates , 2014, Comput. Oper. Res..

[23]  Xie Xie,et al.  Two-Machine Flowshop Problem with Release Dates, Rejection and Non-Availability Interval on the First Machine , 2014 .

[24]  Fantahun M. Defersha,et al.  A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem , 2015, Int. Trans. Oper. Res..

[25]  Jian-Jun Wang,et al.  Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects , 2015, Comput. Oper. Res..

[26]  Danyu Bai.  Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates , 2015, Int. J. Syst. Sci..

[27]  Lin Lin,et al.  A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates , 2015 .

[28]  Pandu R. Tadikamalla,et al.  Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time , 2015, J. Oper. Res. Soc..

[29]  Boris Detienne,et al.  The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation , 2016, Eur. J. Oper. Res..

[30]  Mohamed Kais Msakni,et al.  Minimizing the total completion time in a two-machine flowshop problem with time delays , 2016 .

[31]  Ji-Bo Wang,et al.  Research on m-machine flow shop scheduling with truncated learning effects , 2019, Int. Trans. Oper. Res..