On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem

References

• Burkholder D., Davis D., Gundy R. Integral inequalities for convex functions of operators on martingales. Proc. Sixth Berkeley Sympos. Math. Statist. Probab. (1972) 2(Univ. of California Press, Berkeley, CA) 223–240Google Scholar
• Buzacott J., Shanthikumar J.G.Stochastic Models of Manufacturing Systems (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Chung K. L.A Course in Probability Theory (1974) (Academic Press, New York) Google Scholar
• Conway R. W., Maxwell W. L., Miller L. W.Theory of Scheduling (1967) (Addison-Wesley, Reading, MA) Google Scholar
• Garey M. R., Johnson D. S., Sethi R. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. (1976) 1:117–129Link, Google Scholar
• Glynn P. W., Whitt W. Departures from many queues in series. Ann. Appl. Probab. (1991) 4:546–572Crossref, Google Scholar
• Hillier F. S., Boling R. M. On the optimal allocation of work in symmetric balanced production line systems with variable operation times. Management Sci. (1979) 25:721–728Link, Google Scholar
• Kaminsky P., Simchi-Levi D. Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem. Oper. Res. (1996a) 46:872–882Link, Google Scholar
• Kaminsky P., Simchi-Levi D. The asymptotic optimality of the SPT rule for the flow shop mean completion time problem. . (1996b) . To appear in Oper. Res.Google Scholar
• Krone M. J., Steiglitz K. Heuristic programming solutions of a flowshop scheduling problem. Oper. Res. (1974) 22:629–638Link, Google Scholar
• Muth E. J. The reversibility property of production lines. Management Sci. (1979) 25:152–158Link, Google Scholar
• Pinedo M. Minimizing the expected makespan in stochastic flow shops. Oper. Res. (1995a) 30:148–162Link, Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms and Systems (1995b) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Shanthikumar J. G., Xu S. Asymptotically optimal routing and service rate allocation in a multi-server queueing system. Oper. Res. (1997) 45:464–469Link, Google Scholar
• Van de Velde S. L. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangean relaxation. Ann. Oper. Res. (1990) 26:257–268Google Scholar
• Weber R. R. The interchangeability of tandem queues with heterogeneous customers and dependent service times. Adv. Appl. Prob. (1992) 24:727–737Crossref, Google Scholar
• Williams D.Probability with Martingales (1991) (University Press, Cambridge, UK) Crossref, Google Scholar
• Xia C. H. Dynamic scheduling of queuing systems with applications to computer networks and flexible manufacturing. (1999) . Ph.D. Thesis, Stanford UniversityGoogle Scholar
• Xia C. H., Shanthikumar J. G. Optimal and asymptotically optimal scheduling—an extension of the cμ rule. (1998) . Working Paper, Stanford UniversityGoogle Scholar