Article ID: | iaor2014178 |
Volume: | 27 |
Issue: | 1 |
Start Page Number: | 164 |
End Page Number: | 181 |
Publication Date: | Jan 2014 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Megow Nicole, Gnther Elisabeth, Knig Felix |
Keywords: | packing |
We study the problems of non‐preemptively scheduling and packing malleable and parallel tasks with precedence constraints to minimize the makespan. In the scheduling variant, we allow the free choice of processors; in packing, each task must be assigned to a contiguous subset. Malleable tasks can be processed on different numbers of processors with varying processing times, while parallel tasks require a fixed number of processors. For precedence constraints of bounded width, we resolve the complexity status of the problem with any number of processors and any width bound. We present an FPTAS based on Dilworth’s decomposition theorem for the NP‐hard problem variants, and exact efficient algorithms for all remaining special cases. For our positive results, we do not require the otherwise common monotonous penalty assumption on the processing times of malleable tasks, whereas our hardness results hold even when assuming this restriction. We complement our results by showing that these problems are all strongly NP‐hard under precedence constraints which form a tree.