Flowshop scheduling problem to minimize total completion time with random and bounded processing times

The flowshop scheduling problems with n jobs processed on two or three machines, and with two jobs processed on k machines are addressed where jobs have random and bounded processing times. The probability distributions of random processing times are unknown, and only the lower and upper bounds of processing times are given before scheduling. In such cases, there may not exist a unique schedule that remains optimal for all feasible realizations of the processing times, and therefore, a set of schedules has to be considered which dominates all other schedules for the given criterion. We obtain sufficient conditions when transposition of two jobs minimizes total completion time for the cases of two and three machines. The geometrical approach is utilized for flowshop problem with two jobs and k machines.

[1]  Ali Allahverdi,et al.  Two–machine flowshop minimum–length scheduling problem with random and bounded processing times , 2003 .

[2]  Frank Werner,et al.  Mean flow time minimization with given bounds of processing times , 2004, Eur. J. Oper. Res..

[3]  Frank Werner,et al.  Optimal makespan scheduling with given bounds of processing times , 1997 .

[4]  Wlodzimierz Szwarc,et al.  SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .

[5]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

[6]  Chengbin Chu,et al.  Cyclic scheduling of a hoist with time window constraints , 1998, IEEE Trans. Robotics Autom..

[7]  V. Tanaev,et al.  Scheduling theory single-stage systems , 1994 .

[8]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

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

[11]  George L. Nemhauser,et al.  A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .

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

[13]  A. Janiak.  General flow-shop scheduling with resource constraints , 1988 .

[14]  Lei Lei,et al.  The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints , 1991 .

[15]  Y. Sotskov,et al.  The complexity of shop-scheduling problems with two or three jobs , 1991 .

[16]  Hiroaki Ishii,et al.  Two machine mixed shop scheduling problem with controllable machine speeds , 1987, Discret. Appl. Math..

[17]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[18]  Shun-Chen Niu,et al.  On Johnson's Two-Machine Flow Shop with Random Processing Times , 1986, Oper. Res..

[19]  Jerzy Kamburowski,et al.  Stochastically minimizing the makespan in two-machine flow shops without blocking , 1999, Eur. J. Oper. Res..

[20]  T.-C. Lai,et al.  Sequencing with uncertain numerical data for makespan minimisation , 1999, J. Oper. Res. Soc..

[21]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

[22]  Peter Brucker,et al.  An efficient algorithm for the job-shop problem with two jobs , 2005, Computing.

[23]  Ali Allahverdi,et al.  New heuristics to minimize total completion time in m-machine flowshops , 2002 .

[24]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

[25]  Ali Allahverdi,et al.  Two-machine ordered flowshop scheduling under random breakdowns , 1994 .

[26]  Ali Allahverdi.  Stochastically minimizing total flowtime in flowshops with no waiting space , 1999, Eur. J. Oper. Res..

[27]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[28]  Vitaly A. Strusevich,et al.  Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds , 1995, Discret. Appl. Math..

[29]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[30]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

[31]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[32]  Salah E. Elmaghraby,et al.  The two-machine stochastic flowshop problem with arbitrary processing time distributions , 1999 .