TY - JOUR

T1 - Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms

AU - Grigoriev, A.

AU - Woeginger, G.J.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-36136-7_34

DO - 10.1007/3-540-36136-7_34

M3 - Article

VL - 2518

SP - 381

EP - 390

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -