Polynomial time approximation schemes for general multiprocessor job shop scheduling

Amoura, 2002, Scheduling independent multiprocessor tasks, Algorithmica, 32, 247, 10.1007/s00453-001-0076-9 Bianco, 1995, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Ann. Oper. Res., 58, 493, 10.1007/BF02057160 Bischof, 2001, On-line scheduling of parallel jobs with runtime restrictions, Theoret. Comput. Sci., 268, 67, 10.1016/S0304-3975(00)00260-7 Blazewicz, 1992, Scheduling multiprocessor tasks on the three dedicated processors, Inform. Process. Lett., 41, 275, 10.1016/0020-0190(92)90172-R Blazewicz, 1986, Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput., C-35, 389, 10.1109/TC.1986.1676781 Brucker, 1998 Chakrabarti, 1996, Resource scheduling for parallel database and scientific applications, 329 Chen, 1999, General multiprocessor tasks scheduling, Naval Res. Logist., 46, 57, 10.1002/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H Chen, 2001, A polynomial time approximation scheme for general multiprocessor job scheduling, SIAM J. Comput., 31, 1, 10.1137/S0097539798348110 Drozdowski, 1995, On the complexity of multiprocessor task scheduling, Bull. Polish Acad. Sci., 43, 381 Drozdowski, 1996, Scheduling multiprocessor tasks—an overview, European J. Oper. Res., 94, 215, 10.1016/0377-2217(96)00123-3 Du, 1989, Complexity of scheduling parallel task systems, SIAM J. Discrete Math., 2, 473, 10.1137/0402042 Feldmann, 1998, Optimal online scheduling of parallel jobs with dependencies, J. Combin. Optim., 1, 393, 10.1023/A:1009794729459 Feldmann, 1994, Dynamic scheduling on parallel machines, Theoret. Comput. Sci., 130, 49, 10.1016/0304-3975(94)90152-X Garey, 1976, Resource constrained scheduling as generalized bin packing, J. Combin. Theory Ser. A, 21, 257, 10.1016/0097-3165(76)90001-7 Garey, 1976, The complexity of flowshop and jobshop scheduling, Math. Oper. Res., 1, 117, 10.1287/moor.1.2.117 Goldberg, 2001, Better approximation guarantees for job-shop scheduling, SIAM J. Discrete Math., 14, 67, 10.1137/S0895480199326104 Grigoriadis, 1996, Coordination complexity of parallel price-directive decomposition, Math. Oper. Res., 21, 321, 10.1287/moor.21.2.321 Hall, 1998, Approximability of flow shop scheduling, Math. Programming, 82, 175, 10.1007/BF01585870 Hoogeveen, 1994, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Appl. Math., 55, 259, 10.1016/0166-218X(94)90012-4 Jansen, 2000, Approximation algorithms for flexible job shop problems, 1776, 68 Jansen, 2002, Linear-time approximation schemes for scheduling malleable parallel tasks, Algorithmica, 32, 507, 10.1007/s00453-001-0085-8 Jansen, 2001, Improved approximation schemes for scheduling unrelated parallel machines, Math. Oper. Res., 26, 324, 10.1287/moor.26.2.324.10559 Jansen, 1999, General multiprocessor task scheduling: approximate solution in linear time, 1663, 110 Jansen, 1999, Makespan minimization in job shops: a polynomial time approximation scheme, 394 Jansen, 1999, A linear time approximation scheme for the job shop scheduling problem, 1671, 177 Kenyon, 2000, Approximate strip packing, Math. Oper. Res., 25, 645, 10.1287/moor.25.4.645.12118 Lawler, 1993, Sequencing and scheduling: algorithms and complexity, 4 Lepere, 2001, Approximation algorithms for scheduling malleable tasks under precedence constraints, 2161, 146 Ludwig, 1994, Scheduling malleable and nonmalleable parallel tasks, 167 Schwiegelshohn, 1996, Preemptive weighted completion time scheduling of parallel jobs, 1136, 39 Shmoys, 1994, Improved approximation algorithms for shop scheduling problems, SIAM J. Comput., 23, 617, 10.1137/S009753979222676X Sevastianov, 1998, Makespan minimization in open shops: A polynomial time approximation scheme, Math. Programming, 82, 191, 10.1007/BF01585871 Steinberg, 1997, A strip-packing algorithm with absolute performance bound two, SIAM J. Comput., 26, 401, 10.1137/S0097539793255801 Turek, 1992, Approximate algorithms for scheduling parallelizable tasks, 323 Williamson, 1997, Short shop schedules, Oper. Res., 45, 288, 10.1287/opre.45.2.288