Minimizing the number of late jobs when the start time of the machine is variable
暂无分享,去创建一个
[1] Jean-Charles Billaut,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[2] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[3] Kenneth R. Baker,et al. Minimizing the number of tardy jobs with stochastically-ordered processing times , 2008, J. Sched..
[4] Yixun Lin,et al. Necessary and sufficient conditions of optimality for some classical scheduling problems , 2007, Eur. J. Oper. Res..
[5] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[6] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..