Scheduling with Release Times and Deadlines on a Minimum Number of Machines
暂无分享,去创建一个
[1] Federico Malucelli,et al. Shiftable Interval Graphs , 2000 .
[2] Stephan Eidenbenz,et al. Flexible Train Rostering , 2003, ISAAC.
[3] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[4] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.
[5] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[6] Rafail Ostrovsky,et al. Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] Frits C. R. Spieksma,et al. Interval selection: applications, algorithms and lower bounds , 2002 .
[8] Frits C. R. Spieksma,et al. Approximating an Interval Scheduling Problem , 1998, APPROX.
[9] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[10] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[11] Joseph Naor,et al. New hardness results for congestion minimization and machine scheduling , 2004, STOC '04.
[12] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..
[13] Sudipto Guha,et al. Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..
[14] Piotr Berman,et al. Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..
[15] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[16] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2000, STOC '00.
[17] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .