Single machine scheduling with stochastically dependent times

Abstract

This paper examines the behavior of several single machine scheduling problems when presented with times that are random and potentially dependent. A position-based learning effect model is revisited and optimal schedules are derived under several typical performance measures. A sum-of-processing-time based model is proposed to incorporate the learning effects and deteriorations in one unified framework. Optimal schedules are derived to minimize the maximum lateness or jointly minimize the completion times under the proposed model, and the model is used to solve the optimal issuing problem.

This is a preview of subscription content, log in to check access.

References

  1. Belzunce, F., Martnez-Puertas, H., & Ruiz, J. M. (2013). On allocation of redundant components for systems with dependent components. European Journal of Operational Research, 230(3), 573–580.

    Article  Google Scholar 

  2. Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188(2), 315–329.

    Article  Google Scholar 

  3. Brown, M., & Ross, S. M. (1973). Optimal issuing policies. Management Science, 19(11), 1292–1294.

    Article  Google Scholar 

  4. Brown, M., & Solomon, H. (1973). Optimal issuing policies under stochastic field lives. Journal of Applied Probability, 10(4), 761–768.

    Article  Google Scholar 

  5. Cai, J., & Wei, W. (2014). Some new notions of dependence with applications in optimal allocation problems. Insurance: Mathematics and Economics, 55, 200–209.

    Google Scholar 

  6. Cai, J., & Wei, W. (2015). Notions of multivariate dependence and their applications in optimal portfolio selections with dependent risks. Journal of Multivariate Analysis, 138, 156–169.

    Article  Google Scholar 

  7. Cai, X., Wang, L., & Zhou, X. (2007). Single-machine scheduling to stochastically minimize maximum lateness. Journal of Scheduling, 10(4), 293–301.

    Article  Google Scholar 

  8. Cai, X., Wu, X., & Zhou, X. (2007). Single-machine scheduling with general costs under compound-type distributions. Journal of Scheduling, 10(1), 77–84.

    Article  Google Scholar 

  9. Chang, C. S., & Yao, D. D. (1993). Rearrangement, majorization and stochastic scheduling. Mathematics of Operations Research, 18(3), 658–684.

    Article  Google Scholar 

  10. Cheng, T. E., Ding, Q., & Lin, B. M. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1–13.

    Article  Google Scholar 

  11. Kijima, M., & Ohnishi, M. (1996). Portfolio selection problems via the bivariate characterization of stochastic dominance relations. Mathematical Finance, 6(3), 237–277.

    Article  Google Scholar 

  12. Kuo, W. H., & Yang, D. L. (2006). Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174(2), 1184–1190.

    Article  Google Scholar 

  13. Landsberger, M., & Meilijson, I. (1990). Demand for risky financial assets: a portfolio analysis. Journal of Economic Theory, 50(1), 204–213.

    Article  Google Scholar 

  14. Müller, A., & Stoyan, D. (2002). Comparison methods for stochastic models and risks. Chichester: Wiley.

    Google Scholar 

  15. Shaked, M., & Shanthikumar, J. G. (2007). Stochastic orders. New York: Springer.

    Google Scholar 

  16. Shanthikumar, J. G., & Yao, D. (1991). Bivariate characterization of some stochastic order. Advances in Applied Probability, 93(3), 642–659.

    Article  Google Scholar 

  17. Wei, W. (2017). Joint stochastic orders of high degrees and their applications in portfolio selections. Insurance: Mathematics and Economics, 76, 141–148.

    Google Scholar 

  18. Yang, D. L., & Kuo, W. H. (2007). Single-machine scheduling with an actual time-dependent learning effect. Journal of the Operational Research Society, 58(10), 1348–1353.

    Article  Google Scholar 

  19. Zhang, Y., Wu, X., & Zhou, X. (2013). Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns. Journal of Scheduling, 16(3), 331–336.

    Article  Google Scholar 

Download references

Acknowledgements

The author acknowledges valuable comments from the two anonymous reviewers, which greatly improve the presentation of this paper. The author also thanks the support by the Research and Creative Activities Support grant (Grant No. AAC2253) and the startup grant (Grant No. PRJ69VR) from the University of Wisconsin-Milwaukee.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Wei Wei.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wei, W. Single machine scheduling with stochastically dependent times. J Sched 22, 677–689 (2019). https://doi.org/10.1007/s10951-019-00600-2

Download citation

Keywords

  • Stochastic scheduling
  • Dependence
  • Completion times
  • Maximum lateness
  • Expected total cost
  • Deteriorations/learning effects