@inproceedings{902162ff6cc149b28a24421b1dc22911,

title = "Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms",

abstract = "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.",

author = "A. Grigoriev and G.J. Woeginger",

year = "2002",

month = nov,

day = "8",

doi = "10.1007/3-540-36136-7_34",

language = "English",

isbn = "978-3-540-00142-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Berlin, Heidelberg",

pages = "381--390",

editor = "P. Bose and P. Morin",

booktitle = "Algorithms and Computation. ISAAC 2002",

address = "Germany",

}