Stochastic Scheduling with Incomplete Information

  • Xiaoqiang Cai
  • Xianyi Wu
  • Xian Zhou
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 207)


This chapter treats a class of scheduling models subject to machine breakdowns with incomplete information. Under this class of models, the repeated processing times between breakdowns are dependent via a latent random variable. This leads to partially available information on the processing times during the process, and the information is gradually accumulated from previous processing experience and adaptively incorporated into the decision making for processing remaining jobs. Section 8.1 formulates the model and discusses the probabilistic characteristics of the repetition frequency and occupying times, and the impact of incomplete information. The optimal restricted dynamic policies for this model are derived in Section 8.2 based on posterior Gittins indices. Finally, Section 8.3 discusses an interesting case in which the posterior Gittins indices can be represented by the one-step rewards rates of the jobs.


Posterior Distribution Optimal Policy Probabilistic Characteristic Reward Rate Decision Epoch 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Bast, H. (1998). Dynamic scheduling with incomplete information. Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures, Puerto Vallarta (pp. 182–191).Google Scholar
  2. Chen, C. Y. I., George, E. I., & Tardif, V. (2001). A Bayesian model of cycle time prediction. IIE Transactions, 33(10), 921–930.Google Scholar
  3. Gage, A., & Murphy, R. R. (2004). Sensor scheduling in mobile robots using incomplete information via Min-Conflict with Happiness. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 34, 454–467.CrossRefGoogle Scholar
  4. Gardoni, P., Reinschmidt, K. F., & Kumar, R. (2007). A probabilistic framework for Bayesian adaptive forecasting of project progress. Computer-Aided Civil and Infrastructure Engineering, 22, 182–196.CrossRefGoogle Scholar
  5. Gittins, J. C. (1989). Multi-armed bandit allocation indices (Wiley-Interscience series in systems and optimization). Chichester: Wiley. ISBN:0-471-92059-2.Google Scholar
  6. Glazebrook, K. D., & Boys, R. J. (1995). A class of Bayesian models for optimal exploration. Journal of the Royal Statistical Society, Series B (Methodological), 57, 705–720.Google Scholar
  7. Lai, T. L., & Ying, Z. (1988). Open bandit processes and optimal scheduling of queueing networks. Advances in Applied Probability, 20, 447–472.CrossRefGoogle Scholar
  8. Lee, S. I., & Kitanidis, P. K. (1991). Optimal estimation and scheduling in aquifer remediation with incomplete information. Water Resources Research, 27, 2203–2217.CrossRefGoogle Scholar
  9. Ross, S. M. (1996). Stochastic processes (2nd ed.). New York: Wiley.Google Scholar
  10. Varaiya, P., Walrand, J., & Buyukkoc, C. (1985). Extensions of the multiarmed bandit problem: The discounted case. IEEE Transactions on Automatic Control, 230, 426–439.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Xiaoqiang Cai
    • 1
  • Xianyi Wu
    • 2
  • Xian Zhou
    • 3
  1. 1.Department of Systems Engineering and Engineering ManagementThe Chinese University of Hong KongShatin, N.T.Hong Kong SAR
  2. 2.Department of Statistics and Actuarial ScienceEast China Normal UniversityShanghaiPeople’s Republic of China
  3. 3.Department of Applied Finance and Actuarial StudiesMacquarie UniversityNorth RydeAustralia

Personalised recommendations