Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops

The paper deals with the classical problem of minimizing the makespan in a two-machine flow shop. When the job processing times are deterministic, the optimal job sequence can be determined by applying Johnson's rule. When they are independent and exponential random variables, Talwar's rule yields a job sequence that minimizes the makespan stochastically. Assuming that the random job processing times are independent and Gompertz distributed, we propose a new scheduling rule that is a generalization of both Johnson's and Talwar's rules. We prove that our rule yields a job sequence that minimizes the makespan stochastically. Extensions to m-machine proportionate stochastic flow shops, two-machine stochastic job shops, and stochastic assembly systems are indicated.

[1]  B. Gompertz,et al.  On the Nature of the Function Expressive of the Law of Human Mortality , 1825 .

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

[3]  Michael Pinedo.  A note on the two machine job shop with exponential processing times , 1981 .

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

[5]  Kenneth N. McKay,et al.  Job-Shop Scheduling Theory: What Is Relevant? , 1988 .

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

[7]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

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

[9]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[10]  Rhonda Righter.  A generalized Johnson's rule for stochastic assembly systems , 1997 .

[11]  Jerzy Kamburowski,et al.  On three-machine flow shops with random job processing times , 2000, Eur. J. Oper. Res..

[12]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[13]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[14]  Bajis M. Dodin,et al.  Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops , 1996, Comput. Oper. Res..

[15]  Benjamin Gompertz,et al.  XXIV. On the nature of the function expressive of the law of human mortality, and on a new mode of determining the value of life contingencies. In a letter to Francis Baily, Esq. F. R. S. &c , 1825, Philosophical Transactions of the Royal Society of London.

[16]  P P Talwar,et al.  A NOTE ON SEQUENCING PROBLEM WITH UNCERTAIN JOB TIMES , 1967 .

[17]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[18]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[19]  Dan Trietsch,et al.  Makespan-related criteria for comparing schedules in stochastic environments , 1998, J. Oper. Res. Soc..

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

[21]  M. Ogborn.  On the Nature of the Function Expressive of the Law of Human Mortality , 1953 .

[22]  Sujit K. Dutta,et al.  Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop , 1973 .