Project Scheduling Under Partially Renewable Resource Constraints

Jan Böttcher, Andreas Drexl, Rainer Kolisch and Frank Salewski
Additional contact information
Jan Böttcher: Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olshausenstr, 40, 24118 Kiel, Germany
Andreas Drexl: Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olshausenstr, 40, 24118 Kiel, Germany
Rainer Kolisch: Institut für Betriebswirtschaftlehre, Technische Universität Darmstadt, Hochschulstr, 1, 64289 Darmstadt, Germany
Frank Salewski: Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olshausenstr, 40, 24118 Kiel, Germany

Management Science, 1999, vol. 45, issue 4, 543-559

Abstract: We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially renewable 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 nonrenewable 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 ProGen 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.

Keywords: project scheduling; resource constraints; partially renewable resources; branch-and-bound algorithm; serial scheduling scheme (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (34)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.45.4.543 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:45:y:1999:i:4:p:543-559

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().