Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs

Operations Research

Volumn 47, Issue 3, 1999, Pages 422-437

  Cai, Xiaoqiang ^a   Zhou, Sean ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; DECISION MAKING; DECISION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POISSON DISTRIBUTION; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING;

STOCHASTIC BREAKDOWNS; STOCHASTIC SCHEDULING MODELS;

JUST IN TIME PRODUCTION;

EID: 0032654777     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.3.422     Document Type: Article

References (43)

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