Preemptive scheduling with rejection
暂无分享,去创建一个
[1] Leen Stougie,et al. Multiprocessor scheduling with rejection , 1996, SODA '96.
[2] David R. Karger,et al. Techniques for scheduling with rejection , 1998, J. Algorithms.
[3] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[4] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Gerhard J. Woeginger,et al. When does a dynamic programming formulation guarantee the existence of an FPTAS? , 1999, SODA '99.
[7] Yiannis Gabriel,et al. Logistics of Production and Inventory , 1993, Handbooks in Operations Research and Management Science.
[8] Dimitris Bertsimas,et al. On Dependent Randomized Rounding Algorithms , 1996, IPCO.
[9] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[10] Sudipta Sengupta,et al. Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection , 2003, WADS.