We address a generalization of the classical discrete time-cost tradeoff problem where the costs are irregular and depend on the starting and the completion times of the activities. We present a complete picture of the computational complexity and the approximability of this problem for several natural classes of precedence constraints. We prove that the problem is NP-hard and hard to approximate, even in case the precedence constraints form an interval order. For orders of bounded height, there is a complexity jump: For height one, the problem is polynomially solvable, whereas for height two, it is NP-hard and APX-hard. Finally, the problem is shown to be polynomially solvable for orders of bounded width and for series parallel orders. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Grigoriev, A., & Woeginger, G. J. (2002). Project scheduling with irregular costs: Complexity, approximability, and algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 381–390). https://doi.org/10.1007/3-540-36136-7_34
Mendeley helps you to discover research relevant for your work.