On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements
暂无分享,去创建一个
[1] Zsolt Tuza,et al. Efficiency and effectiveness of normal schedules on three dedicated processors , 1997, Discret. Math..
[2] Maciej Drozdowski,et al. Scheduling multiprocessor tasks -- An overview , 1996 .
[3] Han Hoogeveen,et al. Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..
[4] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Jacek Blazewicz,et al. Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..
[7] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[8] Denis Trystram,et al. Efficient approximation algorithms for scheduling malleable tasks , 1999, SPAA '99.
[9] Gerhard J. Woeginger,et al. A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .
[10] T. C. Edwin Cheng,et al. The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..
[11] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[12] Bahram Alidaee,et al. Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..
[13] Klaus Jansen,et al. Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks , 1999, SODA '99.
[14] Evripidis Bampis,et al. Scheduling Independent Multiprocessor Tasks , 2002, Algorithmica.
[15] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[16] Carsten Lund,et al. Hardness of approximations , 1996 .
[17] Michel X. Goemans,et al. An Approximation Algorithm for Scheduling on Three Dedicated Machines , 1995, Discret. Appl. Math..