Please use this identifier to cite or link to this item:
Böttcher, Jan
Drexl, Andreas
Kolisch, Rainer
Salewski, Frank
Year of Publication: 
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 398
We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially reiiewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make e.g. timetabling and shift scheduling aspects amenable to project scheduling. In addition, partially renewable resources serve to model complicated labor regulations. Furthermore, they cover traditional renewable and nonre-newable resource constraints as special cases. We consider makespan minimization as objective. For the exact Solution of the problem we employ a basic enumeration scheme. In order to speed up convergence, we formulate bounds which take into account future resource consumption of partially renewable resources. Moreover, we generalize the serial scheduling scheme in order to get fast approximation methods. A rigorous assessment of the procedures is provided by solving Pro Gen instances generated under a full factorial test design. Besides the well-known problem parameters we employ additionally three parameters which control the generation of partially renewable resources.
Project scheduling
resource constraints
partially renewable resources
branch-and-bound algorithm
serial scheduling scheme
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:

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