Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria

Naval Research Logistics

Volumn 51, Issue 6, 2004, Pages 800-817

  Cai, Xiaoqiang ^a   Sun, Xiaoqian ^b   Zhou, Xian ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HUAIYIN NORMAL UNIVERSITY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Delayed delivery; Discounted reward; Machine breakdowns; Preemptive repeat; Stochastic scheduling; Weighted number of tardy jobs; Weighted squared flowtime

Indexed keywords

FAILURE (MECHANICAL); JOB ANALYSIS; MACHINE COMPONENTS; NUMERICAL ANALYSIS; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

DELAYED DELIVERY; DISCOUNTED REWARD; MACHINE BREAKDOWNS; PRE-EMPTIVE REPEAT; STOCHASTIC SCHEDULING; WEIGHTED NUMBER OF TARDY JOBS; WEIGHTED SQUARED FLOWTIME;

PRODUCTION CONTROL;

EID: 4444319965     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20024     Document Type: Article

References (19)

1. I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan, Single machine flowtime scheduling with a single breakdown, Acta Inform 26 (1989), 679-696.
2. I. Adiri, E. Frostig, and A.H.G. Rinnooy Kan, Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs, Naval Res Logist 38 (1991), 261-271.
3. P.C. Bagga and K.R. Kalra, Single machine scheduling problem with quadratic functions of completion times - a modified approach, J Inform Optim Sci 2 (1981), 103-108.
4. J. Birge, J.B.G. Frenk, J. Mittenthal, and A.H.G. Rinnooy Kan, Single-machine scheduling subject to stochastic breakdown, Naval Res Logist 37 (1990), 661-677.
5. X. Cai and X. Zhou, Stochastic scheduling on parallel machine subject to random breakdowns to minimize expected costs for earliness and tardy cost, Oper Res 47 (1999), 422-437.
6. X. Cai and X. Zhou, Asymmetric earliness-tardiness scheduling with exponential processing times on an unreliable machine, Ann Oper Res 98 (2000), 313-331.
7. X. Cai, X. Sun, and X. Zhou, Stochastic scheduling with preemptive-repeat machine breakdowns to minimize the expected weighted flowtime, Probab Engrg Inf Sci, 17 (2003), 467-485.
8. S. French, Sequencing and scheduling: An introduction to the mathematics of the job-shop, Ellis Horwood, Chichester, 1982.
9. E. Frostig, A note on stochastic scheduling on a single machine subject to breakdown - the preemptive-repeat model, Probab Engrg Inform Sci 5 (1991), 349-354.
10. J. Mittenthal and M. Raghavachari, Stochastic single machine scheduling with quadratic early-tardy penalties, Oper Res 41 (1993), 786-796.
11. A. Muller and D. Stoyan, Comparison methods for stochastic models and risks, Wiley, Chichester, 2002.
12. M. Pinedo and E. Rammouz, A note on stochastic scheduling on a single machine subject to breakdown and repair, Probab Engrg Inform Sci 2 (1988), 41-49.
13. M. Pinedo, Scheduling: Theory, algorithms, and systems, 2nd edition, Prentice Hall, Englewood Cliffs, NJ, 2002.
14. X.D. Qi, G. Yin, and J.R. Birge, Single machine scheduling with random machine breakdowns and randomly compressible processing times, Stochastic Anal Appl 18 (2000), 635-653.
15. M.H. Rothkopf, Scheduling independent tasks on parallel processors, Management Sci 12 (1966), 437-447.
16. M.H. Rothkopf, Scheduling with random service times, Management Sci 12 (1966), 707-713.
17. M.H. Rothkopf and S.A. Smith, There are no undiscovered priority index sequencing rules for minimizing total delay costs, Oper Res 32 (1984), 451-456.
18. W. Townsend, The single-machine problem with quadratic penalty function of completion times: A branch-and-bound solution, Management Sci 24 (1978), 530-534.
19. X. Zhou and X. Cai, General stochastic single-machine scheduling with regular cost functions, Math Comput Modelling 26 (1997), 95-108.