Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information

Operations Research

Volumn 57, Issue 5, 2009, Pages 1236-1249

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

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b EAST CHINA NORMAL UNIVERSITY   (China)

^c MACQUARIE UNIVERSITY   (Australia)

Author keywords

Dynamic programming optimal control; Learning; Probability; Production scheduling; Semi markov; Stochastic; Stochastic model applications

Indexed keywords

DYNAMIC PROGRAMMING/OPTIMAL CONTROL; LEARNING; PRODUCTION/SCHEDULING; SEMI-MARKOV; STOCHASTIC; STOCHASTIC MODEL APPLICATIONS;

OPTIMIZATION; RANDOM PROCESSES; RANDOM VARIABLES; SCHEDULING; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC MODELS;

PROBABILITY DISTRIBUTIONS;

EID: 70350219098     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0660     Document Type: Article

References (38)

1. Adiri, I., E. Frostig, A. H. G. Rinnooy Kan. 1991. Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Res. Logist. 38 261-271.
2. Adiri, I., J. Bruno, E. Frostig, A. H. G. Rinnooy Kan. 1989. Single machine flowtime scheduling with a single breakdown. Acta Informatica 26 679-696.
3. Ball, M., C. Barnhart, G. Nemhauser, A. Odoni. 2007. Air transportation: Irregular operations and control. C. Barnhart, G. Laporte, eds. Transportation. Handbooks in Operations Research and Management Science, Vol. 14. Elsevier, Amsterdam, 1-68.
4. Bast, H. 1998. Dynamic scheduling with incomplete information. Proc. Tenth Ann. ACM Sympos. Parallel Algorithms Architectures. ACM Press, New York, 182-191.
5. Birge, J., J. B. G. Frenk, J. Mittenthal, A. H. G. Rinnooy Kan. 1990. Single-machine scheduling subject to stochastic breakdown. Naval Res. Logist. 37 661-677.
6. Cai, X., X. Zhou. 1999. Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs. Oper. Res. 47 422-437.
7. Cai, X., X. Sun, X. Zhou. 2003. Stochastic scheduling with preemptiverepeat machine breakdowns to minimize the expected weighted flowtime. Probab. Engrg. Informational Sci. 17 467-485.
8. Cai, X., X. Sun, X. Zhou. 2004. Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria. Naval Res. Logist. 51 800-817.
9. Cai, X., X. Wu, X. Zhou. 2005. Dynamically optimal policies for stochastic scheduling subject to preemptive-repeat breakdowns. IEEE Trans. Automation Sci. Engrg. 2 158-172.
10. Chen, C. Y. I., E. I. George, V. Tardif. 2001. A Bayesian model of cycle time prediction. IIE Trans. 33(10) 921-930.
11. Chimento, P. F., K. S. Trivedi. 1993. The completion time of programs on processors subject to failure and repair. IEEE Trans. Comput. 42 1184-1194.
12. Delp, D., J. Si, J. W. Fowler. 2006. The development of the complete X-factor contribution measurement for improving cycle time and cycle time variability. IEEE Trans. Semiconductor Manufacturing 19(3) 352-362.
13. Duffy, J. A. 2000. Service recovery. J. A. Fitzsimmons, M. J. Fitzsimmons, eds. New Service Development-Creating Memorable Experiences. Sage Publications, Thousand Oaks, CA, 277-290.
14. Frostig, E. 1991. A note on stochastic scheduling on a single machine subject to breakdown-The preemptive repeat model. Probab. Engrg. Informational Sci. 5 349-354.
15. Gage, A., R. R. Murphy. 2004. Sensor scheduling in mobile robots using incomplete information via min-conflict with happiness. IEEE Trans. Systems, Man, Cybernetics, Part B 34 454-467.
16. Gardoni, P., K. F. Reinschmidt, R. Kumar. 2007. A probabilistic framework for Bayesian adaptive forecasting of project progress. Comput.-Aided Civil Infrastructure Engrg. 22 182-196.
17. Gittins, J. C. 1989. Multi-Armed Bandit Allocation Indices. Wiley, New York.
18. Glazebrook, K. D., R. J. Boys. 1995. A class of Bayesian models for optimal exploration. J. Roy. Statist. Soc., Ser. B-Methodological 57 705-720.
19. Groenevelt, H., L. Pintelon, A. Seidmann. 1992. Production batching with machine breakdowns and safety stocks. Oper. Res. 40 959-971. (Pubitemid 23581842)
20. Hanemann, A., M. Sailer, D. Schmitz. 2005. Towards a framework for IT service fault management. Proc. Eur. Univ. Inform. Systems Conf. (EUNIS 2005), Manchester, UK.
21. Heathcote, C. R. 1961. Preemptive priority queueing. Biometrika 48 57-63.
22. Iannaccone, G., C. Chuah, R. Mortier, S. Bhattacharyya, C. Diot. 2002. Analysis of link failures in an IP backbone. Proc. ACM Sigcomm Internet Measurement Workshop.
23. Jain, S., W. J. Foley. 2002. Impact of interruptions on schedule execution in flexible manufacturing systems. Internat. J. Flexible Manufacturing Systems 14 319-344.
24. Kasapa, N., H. Aytugb, A. Paulb. 2006. Minimizing makespan on a single machine subject to random breakdowns. Oper. Res. Lett. 44 29-36.
25. Khalil, Z., B. Dimitrov. 1994. The service time properties of an unreliable server characterize the exponential distribution. Adv. Appl. Probab. 26 172-182.
26. Lai, T. L., Z. Ying. 1988. Open bandit processes and optimal scheduling of queueing networks. Adv. Appl. Probab. 20 447-472.
27. Lee, C.-Y., C.-S. Lin. 2001. Single-machine scheduling with maintenance and repair rate-modifying activities. Eur. J. Oper. Res. 135 493-513.
28. Lee, C.-Y., G. Yu. 2007. Single machine scheduling under potential disruption. Oper. Res. Lett. 35 541-548.
29. Lee, S.-I., P. K. Kitanidis. 1991. Optimal estimation and scheduling in aquifer remediation with incomplete information. Water Resources Res. 27 2203-2217.
30. Nicola, V. F., V. G. Kulkarni, K. S. Trivedi. 1987. A queueing analysis of fault-tolerant computer systems. IEEE Trans. Software Engrg. 13 363-375.
31. Pinedo, M. 2002. Scheduling- Theory, Algorithms, and Systems, 2nd ed. Prentice Hall, Englewood Cliffs, NJ.
32. Pinedo, M., E. Rammouz. 1988. A note on stochastic scheduling on a single machine subject to breakdown and repair. Probab. Engrg. Informational Sci. 2 41-49.
33. Righter, R., J. G. Shanthikumar. 1989. Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probab. Engrg. Informational Sci. 3 323-333.
34. Takine, T., B. Sengupta. 1997. A single server queue with service interruptions. J. Queueing Systems 26 285-300.
35. Varaiya, P., J. Walrand, C. Buyukkoc. 1985. Extensions of the multiarmed bandit problem: The discounted case. IEEE Trans. Automatic Control 230 426-439.
36. Yu, G., X. Qi. 2004. Disruption Management- Framework, Models and Applications. World Scientific, Singapore.
37. Zhang, H., S. C. Graves. 1997. Cyclic scheduling in a stochastic environment. Oper. Res. 45 894-903.
38. Zhou, X., X. Cai. 1997. General stochastic single-machine scheduling with regular cost functions. Math. Comput. Modeling 26 95-108.