Dynamically optimal policies for stochastic scheduling subject to preemptive-repeat machine breakdowns

IEEE Transactions on Automation Science and Engineering

Volumn 2, Issue 2, 2005, Pages 158-172

  Cai, Xiaoqiang ^a   Wu, Xianyi ^b   Zhou, Xian ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b EAST CHINA NORMAL UNIVERSITY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Discounted reward; Dynamic policy; Gittins index; Machine breakdowns; Min max criterion; Number of tardy jobs; Preemptive repeat; Semi Markov decision process; Stochastic scheduling; Weighted flow time

Indexed keywords

COMPUTATIONAL METHODS; DECISION THEORY; MACHINERY; MAINTENANCE; MARKOV PROCESSES; OPERATIONS RESEARCH; PROCESS CONTROL; RANDOM PROCESSES;

DISCOUNTED REWARD; DYNAMIC POLICY; GITTINS INDEX; MACHINE BREAKDOWNS; MIN-MAX CRITERION; NUMBER OF TARDY JOBS; PREEMPTIVE-REPEAT; SEMI-MARKOV DECISION PROCESS; STOCHASTIC SCHEDULING; WEIGHTED FLOWTIME;

SCHEDULING;

EID: 17644426366     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2005.844119     Document Type: Article

References (30)

1. I. Adiri, J. Bruno, E. Frostig, and A. H. G. Rinnooy Kan, "Single machine flowtime scheduling with a single breakdown," Act. Informatica, vol. 26, no. 7, pp. 679-696, 1989.
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. Logistics, vol. 38, no 2 pp 261-271, 1991.
3. J. Birge, J. B. G. Frenk, J. Mittenthal, and A. H. G. Rinnooy Kan, "Single-machine scheduling subject to stochastic breakdown," Naval Res. Logistics, vol. 37, pp. 661-677, 1990.
4. P. Brucker, B. Jurisch, and A. Kramer, "Complexity of scheduling problems with multi-purpose machines," Ann. Oper. Res., vol. 70, no. 6, pp. 57-73, 1997.
5. X. Cai and X. Zhou, "Deterministic and stochastic scheduling with teamwork tasks," Naval Res. Logistics, vol. 51, no. 6, pp. 818-840, 2004.
6. X. Cai, X. Sun, and X. Zhou, "Stochastic scheduling subject to machine breakdowns: the preemptive-repeat model with discounted reward and other criteria," Naval Res. Logistics, vol. 51, no. 6, pp. 800-817, 2004.
7. 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., vol. 47, pp. 422-437, 1999.
8. _, "Asymmetric earliness-tardiness scheduling with exponential processing times on an unreliable machine," Ann. Oper. Res., vol. 98, pp. 313-331, 2000.
9. X. Cai, X. Sun, and X. Zhou, "Stochastic scheduling with preemptive-repeat machine breakdowns to minimize the expected weighted flowtime," Probability Eng. Inf. Sci., vol. 17, no. 4, pp. 467-485, 2003.
10. E. Frostig, "A note on stochastic scheduling on a single machine subject to breakdown-the preemptive-repeat model," Probability Eng. Inf. Sci., vol. 5, pp. 349-354, 1991.
11. J. C. Gittins, Multi-Armed Bandit Allocation Indices. Chichester, U.K.: Wiley, 1989.
12. K. D. Glazebrook, "Scheduling stochastic jobs on a single machine subject to breakdowns," Naval Res. Logistics Quart., vol. 31, no. 2, pp. 251-264, 1984.
13. _, "Evaluating the effects of machine breakdowns in scheduling stochastic problems," Naval Res. Logistics, vol. 34, no. 3, pp. 319-335, 1987.
14. _, "On nonpreemptive policies for stochastic single-machine scheduling with breakdowns," Probability Eng. Inf. Sci., vol. 5, pp. 77-87, 1991.
15. T. Gyires and K. Muthuswamy, "A bidirectional search approach for restoring circuits in communication networks," J. Comp. Inf. Syst., vol. 37, no. 2, pp. 85-95, 1996.
16. H. Krawczyk and M. Kubale, "An approximation algorithm for diagnostic test scheduling in multi-computer systems," IEEE Trans. Comput., vol. C-34, no. 9, pp. 869-872, Sep. 1985.
17. C. L. Li, X. Cai, and C.-Y. Lee, "Machine scheduling with multiple-job-on-one-processor pattern," HE Trans. Sched. Logist., vol. 30, no. 5, pp. 433-446, 1998.
18. W. Li, W. J. Braun, and Y. Q. Zhao, "Stochastic scheduling on a repairable machine with Erlang uptime distribution," Adv. Appl. Probab., vol. 30, no. 4, pp. 1073-1088, 1998.
19. S. V. Mehta and R. M. Uzsoy, "Predictable scheduling of a job shop subject to breakdowns," IEEE Trans. Robot. Autom., vol. 14, no. 3, pp. 365-378, Mar. 1998.
20. J. Mittenthal and M. Raghavachari, "Stochastic single machine scheduling with quadratic early-tardy penalties," Oper. Res., vol. 41, no. 4, pp. 786-796, 1993.
21. P. Panaite and A. Pelc, "Optimal broadcasting in faulty trees," J. Parallel Distrib. Comput., vol. 60, no. 5, pp. 566-584, 2000.
22. A. Pelc, "Optimal diagnosis of heterogeneous systems with random faults," IEEE Trans. Comput., vol. 47, no. 3, pp. 298-304, Mar. 1998.
23. M. Pinedo and E. Rammouz, "A note on stochastic scheduling on a single machine subject to breakdown and repair," Probability Eng. Inf. Sci., vol. 2, pp. 41-49, 1988.
24. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2002.
25. X. D. Qi, G. Yin, and J. R. Birge, "Scheduling problems with random processing times under expected earliness/tardiness costs," Stochastic Anal. Appl., vol. 18, no. 3, pp. 453-473, 2000a.
26. _, "Single machine scheduling with random machine breakdowns and randomly compressible processing times," Stochastic Anal. Appl., vol. 18, no. 4, pp. 635-653, 2000b.
27. L. X. Tang, P. B. Luh, J. Y. Liu, and L. Fang, "Steel-making process scheduling using Lagrangian relaxation," Int. J. Production Res., vol. 40, no. 1, pp. 55-70, 2002.
28. K. S. Trivedi, Probability and Statistics With Reliability, Queuing, and Computer Science Applications. New York: Wiley, 2001.
29. G. Vairaktarakis and X. Cai, "The value of processing flexibility in multipurpose machines," IIE Trans. Sched. Logist., vol. 35, no. 8, pp. 763-774, 2003.
30. D. J. White, Markov Decision Processes. Chichester, U.K.: Wiley, 1993.