The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine
暂无分享,去创建一个
[1] Reha Uzsoy,et al. Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .
[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[3] Reha Uzsoy,et al. Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..
[4] T. C. Edwin Cheng,et al. On scheduling an unbounded batch machine , 2003, Oper. Res. Lett..
[5] Chris N. Potts,et al. Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..
[6] Yuzhong Zhang,et al. Approximation Algorithms in Batch Processing , 1999, ISAAC.
[7] Yuzhong Zhang,et al. Minimizing Mean Response Time in Batch Processing System , 1999, COCOON.
[8] Reha Uzsoy,et al. Minimizing total completion time on batch processing machines , 1993 .
[9] J. A. Hoogeveen,et al. Scheduling a batching machine , 1998 .
[10] Chris N. Potts,et al. Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..
[11] Chris N. Potts,et al. A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work , 1994, Math. Oper. Res..
[12] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[13] T. C. Edwin Cheng,et al. Scheduling Jobs with Release Dates and Deadlines on a Batch Processing Machine , 2001 .
[14] Reha Uzsoy,et al. Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..
[15] Evripidis Bampis,et al. Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[16] Zhaohui Liu,et al. Scheduling one batch processor subject to job release dates , 2000, Discret. Appl. Math..