General stochastic single-machine scheduling with regular cost functions

Mathematical and Computer Modelling

Volumn 26, Issue 3, 1997, Pages 95-108

  Zhou, X ^a   Cai, X ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Due dates; Regular measures; Single machine; Stochastic scheduling

Indexed keywords

COSTS; FUNCTIONS; MATHEMATICAL MODELS; SCHEDULING;

DUE DATES; REGULAR MEASURES; SINGLE MACHINE; STOCHASTIC SCHEDULING;

RANDOM PROCESSES;

EID: 0031214284     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00134-9     Document Type: Article

References (34)

1. J. Birge, J.B.G. Frenk, J. Mittenthal and A.H.G. Rinnooy Kan, Single-machine scheduling subject to stochastic breakdowns, Naval Research Logistics 37, 661-677 (1990).
2. S. J. Balut, Scheduling to minimize the number of late jobs when set-up and processing times are uncertain, Management Science 19, 1283-1288 (1973).
3. R.A. Blau, N-Job, One machine sequencing problems under uncertainty, Management Science 20, 101-109 (1973).
4. O.J. Boxma and F.G. Forst, Minimizing the expected weighted number of tardy jobs in stochastic flow shops, Operations Research Letters 5, 119-126 (1986).
5. T.B. Crabill, and W.L. Maxwell, Single machine sequencing with random processing times and random due dates, Naval Research Logistic Quarterly 19, 549-554 (1969).
6. C. Derman, G. Lieberman and S. Ross, A renewal decision problem, Management Science 24, 554-561 (1978).
7. H. Emmons and M. Pinedo, Scheduling stochastic jobs with due dates on parallel machines, European Journal of Operational Research 47, 49-55 (1990).
8. K.D. Glazebrook, Scheduling tasks with exponential service times on parallel processors, Journal of Applied Probability 16, 658-689 (1979).
9. T. Kampke, On the optimality of static priority policies in stochastic scheduling on parallel machines, Journal of Applied Probability 24, 430-448 (1987).
10. N. Katoh and T. Ibaraki, A polynomial time algorithm for a chance-constrained single machine scheduling problem, Operations Research Letters 2, 62-65 (1983).
11. H. Kise and T. Ibaraki, On Balut's Algorithm and NP-completeness for a chance-constrained scheduling problem, Management Science 29, 384-388 (1983).
12. H. Kise, A. Shiomi, M. Uno and D. Chao, An efficient algorithm for a chance-constrained scheduling problem, Journal of the Operations Research Society of Japan 25, 193-203 (1982).
13. M. Pinedo, Stochastic scheduling with release dates and due dates, Operations Research 31, 559-572 (1983).
14. M. Pinedo and Z. Schechner, Inequalities and bounds for the scheduling of stochastic jobs on parallel machines, Journal of Applied Probability 22, 739-744 (1985).
15. S.C. Sarin, E. Erel and G. Steiner, Sequencing jobs on a single machine with a common due date and stochastic processing times, European Journal of Operational Research 51, 287-302 (1991).
16. R.R. Weber, Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan and ftowtime, Journal of Applied Probability 19, 167-182 (1982).
17. R.R. Weber, P. Varaiya and J. Walrand, Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime, Journal of Applied Probability 23, 841-847 (1986).
18. G. Weiss and M. Pinedo, Scheduling tasks with exponential services times on non-identical processors to minimize various cost functions, Journal of Applied Probability 17, 187-202 (1980).
19. M. Pinedo and S.H. Ross, Scheduling jobs subject to nonhomogeneous Poisson shocks, Management Science 26, 1250-1257 (1980).
20. K.D. Glazebrook, Scheduling stochastic jobs on a single machine subject to breakdowns, Naval Research Logistics Quarterly 31, 251-264 (1984).
21. A. Allahverdi and J. Mittenthal, Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time, Naval Research Logistics 41, 677-682 (1994).
22. W.E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly 3, 59-66 (1956).
23. M.H. Rothkopf, Scheduling with random service times, Managment Science 12, 437-447 (1966).
24. E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Recent development in deterministic sequencing and scheduling: A survey, In Deterministic and Stochastic Scheduling (Edited by M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan), D. Reidel, Dordrecht, (1982).
25. J. Du and Y.-T. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research 15, 483-495 (1990).
26. E.L. Lawler, A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics 2, 75-90 (1977).
27. R.M. Karp, Reducibility among combinatorial problems, In Complexity of Computer Computations (Edited by R.E. Miller and J.W. Thatcher), pp. 85-103, Plenum Press, New York, (1972).
28. E. Erel and S.C. Sarin, Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines, Annals of Operations Research 17, 181-198 (1989).
29. W. Townsend, The single-machine problem with quadratic penalty function of completion times: A branch-and-bound solution, Management Science 24, 530-534 (1978).
30. P.C. Bagga and K.R. Kalra, Single machine scheduling problem with quadratic functions of completion times - A modified approach, Journal of Inform. Optim. Sci. 2, 103-108 (1981).
31. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood Limited, Chichester, (1982).
32. F.G. Forst, Bicriterion stochastic scheduling on one or more machines, European Journal of Operational Research 80, 404-409 (1995).
33. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, UCLA, (1955).
34. B.P. Banerjee, Single facility sequencing with random execution times, Operations Research 13, 358-364, 483-495 (1965).