Asymmetric Earliness and Tardiness Scheduling with Exponential Processing Times on an Unreliable Machine

Annals of Operations Research

Volumn 98, Issue 1-4, 2000, Pages 313-331

  Cai, Xiaoqiang ^a   Zhou, Xian ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Dynamic programming; Earliness tardiness scheduling; Random due dates; Random processing times; Stochastic machine breakdowns

Indexed keywords

EID: 0034558594     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1019220826984     Document Type: Article

References (21)

1. U.M. Al-Turck, J. Mittenthal and M. Raghavachari, The single-machine absolute-deviation early-tardy problem with random completion times, Naval Research Logistics 43 (1996) 573-587.
2. M. Azizoglu and S. Webster, Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates, IIE Transactions 29 (1997) 1001-1006.
3. M. Azizoglu and S. Webster, Scheduling job families about an unrestricted common due date on a single machine, International Journal of Production Research 35 (1997) 1321-1330.
4. K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: a review, Operations Research 38 (1990) 22-36.
5. 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 (1990) 661-677.
6. X. Cai and S. Zhou, Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs, Operations Research 47 (1999) 422-437.
7. X. Cai and S. Zhou, Scheduling stochastic jobs with asymmetric earliness and tardiness penalties, Naval Research Logistics 44 (1997) 531-557.
8. X. Cai and S. Zhou, Sequencing jobs with random processing times to minimize weighted completion time variance, Annals of Operations Research, 70 (1997) 241-260.
9. X. Cai and F.S. Tu, Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties, Naval Research Logistics 43 (1996) 1127-1146.
10. X. Cai, Minimization of agreeably weighted variance in single machine systems, European Journal of Operational Research 85 (1995) 576-592.
11. S. Chakravarthy, A Single machine scheduling problem with random processing times, Naval Research Logistics 33 (1986) 391-397.
12. B. Chen, C.N. Potts and G.J. Woeginger, A review of machine scheduling: complexity, algorithms, and approximability, in: Handbook of Combinatorial Optimization, eds. D.-Z. Du and P. Pardalos (Kluwer Academic, 1998).
13. T.C.E. Cheng, Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine, European Journal of Operational Research 51 (1991) 348-353.
14. T.C.E. Cheng and M. Gupta, Survey of scheduling research involving due date determination decisions, European Journal of Operational Research 38 (1989) 156-166.
15. P. Dileepan, Common due date scheduling problem with separate earliness and tardiness penalties, Computers and Operations Research 20 (1991) 179-184.
16. C.-Y. Lee, Danusaputro and Lin, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, Computers and Operations Research 18 (1991) 379-389.
17. J. Mittenthal and M. Raghavachari, Stochastic single machine scheduling with quadratic early-tardy penalties, Operations Research 41 (1993) 786-796.
18. M. Pinedo, Scheduling: Theory, Algorithms, and Systems (Prentice-Hall, Englewood Cliffs, NJ, 1995).
19. S. Ross, Introduction to Stochastic Dynamic Programming (Academic Press, New York, 1983).
20. V. Vani and M. Raghavachari, Deterministic and random single machine sequencing with variance minimization, Operations Research 35 (1987) 111-120.
21. G. Weiss and M. Pinedo, Scheduling tasks with exponential service times on nonidentical processors to minimize makespan or flow time, Journal of Applied Probability 17 (1980) 187-202.