MINIMIZING THE MAKESPAN IN A SINGLE MACHINE SCHEDULING PROBLEM WITH A FLEXIBLE MAINTENANCE
暂无分享,去创建一个
Maw-Sheng Chern | Chou-Jung Hsu | Dar-Li Yang | Ching-Lien Hung | Maw-Sheng Chern | Chou-Jung Hsu | Dar-Li Yang | Ching-Lien Hung
[1] Chung-Yee Lee,et al. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..
[2] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .