Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/155418
Authors: 
Kolisch, Rainer
Year of Publication: 
1994
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344
Abstract: 
We consider the classical resource-constrained project scheduling problem (RCPSP). The paper gives a detailed algorithmic description and provides theoretical results on two widely known problem specific heuristics: The serial and the parallel scheduling scheme. An in-depth computational study compares both schemes when applied as a deterministic single-pass and a probabilistic multi-pass (sampling) method.
Subjects: 
Resource-Constrained Project Scheduling
Serial And Parallel Scheduling Method
Single-Pass And Multi-Pass Heuristics
Sampling
Active And Non-Delay Schedules
Priority Rules
Experimental Investigation
Document Type: 
Working Paper

Files in This Item:
File
Size





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