Please use this identifier to cite or link to this item:
Choi, Byung-Cheon
Briskorn, Dirk
Year of Publication: 
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 651
We consider a project scheduling problem where the precedence constraints graph is an out-tree. The processing times can be compressed by using additional resources, which causes cost and simultaneously reduces the processing times of jobs. The objective is to minimize the sum of total lateness penalties and total compression costs where the cost function for compressing the processing times is linear in the amount of compression. The problem can be decomposed into two types of subproblems. We show that both subproblems can be solved in polynomial time. Using these results, we show that the main problem is solvable in polynomial time if the number of chains in the out-tree is fixed.
Project scheduling
controllable processing times
convex programming
shortest path problem
Document Type: 
Working Paper

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.