Online and Semi-Online Scheduling on capacitated Two-Parallel Machines
暂无分享,去创建一个
[1] Eric Sanlaville,et al. Machine scheduling with availability constraints , 1998, Acta Informatica.
[2] Dieter Jungnickel,et al. Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem , 2000, Oper. Res. Lett..
[3] Yong He,et al. Semi-on-line problems on two identical machines with combined partial information , 2002, Oper. Res. Lett..
[4] Yossi Azar,et al. On-line bin-stretching , 1998, Theor. Comput. Sci..
[5] Oscar H. Ibarra,et al. Approximation Algorithms for Certain Scheduling Problems , 1978, Math. Oper. Res..
[6] Chien-Hung Lin,et al. Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..
[7] Gerhard J. Woeginger,et al. Semi-online scheduling with decreasing job sizes , 2000, Oper. Res. Lett..
[8] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[9] Zsolt Tuza,et al. Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..
[10] Chung-Yee Lee,et al. Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..
[11] Hans Kellerer,et al. An efficient fully polynomial approximation scheme for the Subset-Sum Problem , 2003, J. Comput. Syst. Sci..
[12] Michael Pinedo,et al. Current trends in deterministic scheduling , 1997, Ann. Oper. Res..
[13] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .