Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/147572 
Year of Publication: 
1996
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 426
Publisher: 
Universität Kiel, Institut für Betriebswirtschaftslehre, Kiel
Abstract: 
Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible a makespan minimal schedule among the resource and precedence feasible ones. The enumeration is oftenly reduced to the dominant set of semi-active schedules by checking feasibility of local left-shifts. In this paper we show that combining the concepts of minimal delaying alternatives and local left-shifts, if not properly done, does not, as claimed in the literature, reduce the enumeration to the set of semi-active schedules.
Subjects: 
Project Scheduling
Resource Constraints
Branch-and-Bound
Delaying-Sets
Semi-Active Schedules
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:
File
Size





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