Preemptive scheduling with job-dependent setup times
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[3] Clyde L. Monma,et al. Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, Oper. Res..
[4] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[5] Bo Chen,et al. A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, SIAM J. Comput..
[6] Clyde L. Monma,et al. On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..
[7] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .