Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
暂无分享,去创建一个
Aravind Srinivasan | Madhav V. Marathe | V. S. Anil Kumar | Srinivasan Parthasarathy | S. Parthasarathy | A. Srinivasan | M. Marathe | V. S. A. Kumar
[1] Aravind Srinivasan,et al. Better approximation guarantees for job-shop scheduling , 1997, SODA '97.
[2] Michael E. Saks,et al. Trees and Euclidean metrics , 1998, STOC '98.
[3] Ashish Goel,et al. Multi-processor scheduling to minimize flow time with ε resource augmentation , 2004, STOC '04.
[4] Christian Scheideler,et al. Improved Bounds for Acyclic Job Shop Scheduling , 2002, Comb..
[5] Bruce M. Maggs,et al. Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..
[6] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[7] Sanjeev Khanna,et al. Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.
[8] Bruce M. Maggs,et al. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..
[9] Leslie A. Hall,et al. Approximation algorithms for scheduling , 1996 .
[10] Maxim Sviridenko,et al. Approximation algorithms for shop scheduling problems with minsum objective , 2002 .
[11] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[12] Dimitris Bertsimas,et al. On Dependent Randomized Rounding Algorithms , 1996, IPCO.
[13] David B. Shmoys,et al. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..
[14] Stefano Leonardi,et al. Approximating total flow time on parallel machines , 1997, STOC '97.
[15] Klaus Jansen,et al. Makespan minimization in job shops: a polynomial time approximation scheme , 1999, STOC '99.
[16] Fabián A. Chudak,et al. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.
[17] J. Vitter,et al. Approximations with Minimum Packing Constraint Violation , 1992 .
[18] Martin Skutella,et al. Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.
[19] Klaus Jansen,et al. Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints , 2003, PPAM.
[20] Michael A. Bender,et al. An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 1998, IPCO.
[21] Martin Skutella,et al. The power of -points in preemptive single machine scheduling , 2002 .
[22] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[23] Jeffrey Scott Vitter,et al. e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.
[24] Klaus Jansen,et al. Improved Approximation Schemes for Scheduling Unrelated Parallel Machines , 2001, Math. Oper. Res..
[25] Aravind Srinivasan,et al. Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..
[26] Klaus Jansen,et al. Scheduling Jobs with Chain Precedence Constraints , 2003 .
[27] Gerhard J. Woeginger,et al. Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .