Two-machine flow-shop scheduling to minimize total late work
暂无分享,去创建一个
[1] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[2] Chris N. Potts,et al. Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..
[3] Chris N. Potts,et al. Single Machine Scheduling to Minimize Total Weighted Late Work , 1995, INFORMS J. Comput..
[4] Malgorzata Sterna,et al. The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..
[5] Chris N. Potts,et al. Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..
[6] Malgorzata Sterna,et al. Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..
[7] X. Chao,et al. Operations scheduling with applications in manufacturing and services , 1999 .
[8] Bahram Alidaee,et al. Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms , 2002 .
[9] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[10] Jacek Blazewicz,et al. Scheduling preemptible tasks on parallel processors with information loss , 1984 .
[11] Gerd Finke,et al. Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors , 1987, Inf. Process. Lett..
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .