Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs

References

• Allahverdi A., Mittenthal J. Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time. Naval Res. Logist. (1994) 41:677–682Crossref, Google Scholar
• Baker K. R., Scudder G. D. Sequencing with earliness and tardiness penalties: A review. Opns. Res. (1990) 38:22–36Link, Google Scholar
• Balut S. J. Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Sci. (1973) 19:1283–1288Link, Google Scholar
• Bayard D. S. Proof of quasi-adaptivity for the m-measurement feedback class of stochastic control policies. IEEE Trans. Automatic Control (1987) 32:447–451Crossref, Google Scholar
• Bertsekas D. P.Dynamic Programming and Stochastic Control (1976) (Academic Press, New York) Google Scholar
• Birge J., Frenk J. B. G., Mittenthal J., Rinnooy Kan A. H. G. Single-machine scheduling subject to stochastic breakdowns. Naval Res. Logist. (1990) 37:661–677Crossref, Google Scholar
• Blau R. A. N-job, one machine sequencing problems under uncertainty. Management Sci. (1973) 20:101–109Link, Google Scholar
• Blazewicz J., Ecker K. H., Schmidt G., Weglarz J.Scheduling in Computer and Manufacturing Systems (1994) 2nd ed.(Springer-Verlag, Berlin) Crossref, Google Scholar
• Boxma O. J., Forst F. G. Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Oper. Res. Lett. (1986) 5:119–126Crossref, Google Scholar
• Buzacott J. A., Shanthikumar J. G.Stochastic Models of Manufacturing Systems (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Cai X. Minimization of agreeably weighted variance in single machine systems. Eur. J. Oper. Res. (1995) 85:576–592Crossref, Google Scholar
• Cai X. V-shape property for job sequences that minimize the expected completion time variance. Eur. J. Oper. Res. (1996) 91:118–123Crossref, Google Scholar
• Cai X., Zhou S. Scheduling stochastic jobs with asymmetric earliness and tardiness penalties. Naval Res. Logist. (1997) 44:531–557Crossref, Google Scholar
• Chakravarthy S. A single machine scheduling problem with random processing times. Naval Res. Logist. Quart. (1986) 33:391–397Crossref, Google Scholar
• Cheng T. C. E. Optimal due-date assignment for a single machine sequencing problem with random processing times. Internat. J. Systems Sci. (1986) 17:1139–1144Crossref, Google Scholar
• Cheng T. C. E. Optimal due-date determination and sequencing with random processing times. Math. Model. (1987) 9:573–576Crossref, Google Scholar
• Coffman E. G., Flatto L., Wright P. E. Optimal stochastic allocation of machines under waiting-time constraints. SIAM J. Comput. (1993) 22:332–348Crossref, Google Scholar
• De P., Ghosh J. B., Wells C. E. On the minimization of the weighted number of tardy jobs with random processing times and deadline. Comput. Oper. Res. (1991) 18:457–463Crossref, Google Scholar
• Derman C., Lieberman G., Ross S. A renewal decision problem. Management Sci. (1978) 24:554–561Link, Google Scholar
• Emmons H., Pinedo M. Scheduling stochastic jobs with due dates on parallel machines. Eur. J. Oper. Res. (1990) 47:49–55Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W.H. Freeman and Company, New York) Google Scholar
• Gittins J. C.Multi-Armed Bandit Allocation Indices (1989) (John Wiley & Sons, Chichester, England) Google Scholar
• Glazebrook K. D. Scheduling stochastic jobs on a single machine subject to breakdowns. Naval Res. Logist. Quart. (1984) 31:251–264Crossref, Google Scholar
• Kahlbacher H. G., Cheng T. C. E. Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Appl. Math. (1993) 47:139–164Crossref, Google Scholar
• Kampke T. Optimal scheduling of jobs with exponential service times on identical parallel processors. Oper. Res. (1989) 37:126–133Link, Google Scholar
• Karp R. M., Miller R. E., Thatcher J. W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) Crossref, Google Scholar
• Katoh N., Ibaraki T. A polynomial time algorithm for a chance-constrained single machine scheduling problem. Oper. Res. Lett. (1983) 2:62–65Crossref, Google Scholar
• Kise H., Ibaraki T. On Balut's algorithm and NP-completeness for a chance-constrained scheduling problem. Management Sci. (1983) 29:384–388Link, Google Scholar
• Kise H., Ibaraki T., Mine H. A solvable case of the onemachine scheduling problem with ready and due times. Oper. Res. (1978) 26:121–126Link, Google Scholar
• Kise H., Shiomi A., Uno M., Chao D. An efficient algorithm for a chance-constrained scheduling problem. J. Oper. Res. Soc. Japan (1982) 25:193–203Google Scholar
• Lee C.-Y., Danusaputro S. L., Lin C.-S. Minimizing weighted number of tardy jobs and weighted earlinesstardiness penalties about a common due date. Comput. Oper. Res. (1991) 18:379–389Crossref, Google Scholar
• Lawler E. L. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. (1977) 1:331–342Crossref, Google Scholar
• Mayne D. Q., Michalska H. Receding horizon control of nonlinear systems. IEEE Trans. Automatic Control (1990) 35:814–824Crossref, Google Scholar
• Mittenthal J., Raghavachari M. Stochastic single machine scheduling with quadratic early-tardy penalties. Oper. Res. (1993) 41:786–796Link, Google Scholar
• Pinedo M. Stochastic scheduling with release dates and due dates. Oper. Res. (1983) 31:559–572Link, Google Scholar
• Pinedo M., Ross S. H. Scheduling jobs subject to nonhomogeneous Poisson shocks. Management Sci. (1980) 26:1250–1257Link, Google Scholar
• Sarin S. C., Erel E., Steiner G. Sequencing jobs on a single machine with a common due date and stochastic processing times. Eur. J. Oper. Res. (1991) 51:287–302Crossref, Google Scholar
• Soroush H. M., Fredendall L. D. The stochastic single machine scheduling problem with earliness and tardiness costs. Eur. J. Oper. Res. (1994) 77:287–302Crossref, Google Scholar
• Tse E., Athans M. Adaptive stochastic control for a class of linear systems. IEEE Trans. Automatic Control (1972) 17:38–51Crossref, Google Scholar
• Vani V., Raghavachari M. Deterministic and random single machine sequencing with variance minimization. Oper. Res. (1987) 35:111–120Link, Google Scholar
• Weber R. On the Gittins index for multiarmed bandits. Ann. Appl. Probab. (1992) 2:1024–1033Crossref, Google Scholar
• Weiss G., Pinedo M. Scheduling tasks with exponential services times on non-identical processors to minimize various cost functions. J. Appl. Probab. (1980) 17:187–202Crossref, Google Scholar
• Xu S. H., Kumar S. P. R., Mirchandani P. B. Scheduling stochastic jobs with increasing hazard rate on identical parallel machines. Comput. Oper. Res. (1992) 19:535–544Crossref, Google Scholar