A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

In this paper, we address the three-machine flowshop scheduling problem. Setup times are considered separate from processing times, and the objective is to minimize total completion time. We show that the three-site distributed database scheduling problem can be modeled as a three-machine flowshop scheduling problem. A lower bound is developed and a dominance relation is established. Moreover, an upper bound is developed by using a three-phase hybrid heuristic algorithm. Furthermore, a branch-and-bound algorithm, incorporating the developed lower bound, dominance relation, and the upper bound is presented. Computational analysis on randomly generated problems is conducted to evaluate the lower and upper bounds, the dominance relation, and the branch-and-bound algorithm. The analysis shows the efficiency of the upper bound, and, hence, it can be used for larger size problems as a heuristic algorithm.

[1]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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

[3]  Jatinder N. D. Gupta,et al.  Scheduling a flowline manufacturing cell with sequence dependent family setup times , 2000, Eur. J. Oper. Res..

[4]  S. C. Kim,et al.  Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .

[5]  Ali Allahverdi,et al.  Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns , 1995 .

[6]  Jonathan F. Bard,et al.  An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times , 1999, J. Heuristics.

[7]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[8]  Wei-Chang Yeh.  A new branch-and-bound approach for the n/2/flowshop/alphaF+betaCmax flowshop scheduling problem , 1999, Comput. Oper. Res..

[9]  B. M. Khumawala,et al.  A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times , 1995 .

[10]  Fawaz S. Al-Anzi,et al.  Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications , 2002, Comput. Oper. Res..

[11]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

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

[13]  R. Ahmadi,et al.  Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop , 1990 .

[14]  Reha Uzsoy,et al.  Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .

[15]  Tapan Sen,et al.  Job lateness in a two-machine flowshop with setup times separated , 1991, Comput. Oper. Res..

[16]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

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

[18]  G. Rinaldi,et al.  Scheduling tasks with sequence-dependent processing times , 1988 .

[19]  Chandrasekharan Rajendran,et al.  Heuristics for scheduling in a flowshop with setup, processing and removal times separated , 1997 .

[20]  Soumen Ghosh,et al.  A MILP model for the n-job, M-stage flowshop with sequence dependent set-up times , 1986 .

[21]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[22]  W. Yeh.  An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem , 2001 .

[23]  Ali Allahverdi,et al.  Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times , 2000, Comput. Oper. Res..

[24]  Jonathan F. Bard,et al.  Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups , 1998, Comput. Oper. Res..

[25]  Gabriel R. Bitran,et al.  Sequencing production on parallel machines with two magnitudes of sequence dependent setup costs , 1989 .