Single machine scheduling with stochastically dependent times
- 22 Downloads
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.
KeywordsStochastic scheduling Dependence Completion times Maximum lateness Expected total cost Deteriorations/learning effects
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.
- 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
- Müller, A., & Stoyan, D. (2002). Comparison methods for stochastic models and risks. Chichester: Wiley.Google Scholar
- Wei, W. (2017). Joint stochastic orders of high degrees and their applications in portfolio selections. Insurance: Mathematics and Economics, 76, 141–148.Google Scholar