Please use this identifier to cite or link to this item:
For citation please use:
Main Title: Branch-and-Bound Algorithms for Stochastic Resource-Constrained Project Scheduling
Author(s): Stork, Frederik
Type: Research Paper
Abstract: We study branch-and-bound algorithms for resource-constrained project scheduling where processing times of jobs are random. The objective is to find a so-called scheduling policy which minimizes the project makespan in expectation. The proposed procedures are based upon four classes of scheduling policies which differ considerably with respect to their computational tractability as well as with respect to the optimum costs that can be achieved within the respective class. The purpose of the paper is twofold. First, we establish results on the trade-off between computational efficiency and solution quality for each of the considered classes of policies and evaluate their practical applicability for scheduling stochastic resource-constrained projects. Second, we develop and apply various ingredients such as dominance rules and lower bounds that turn out to be useful within the computation. In order to comprehensively study these issues we have implemented five different branch-and-bound algorithms and explore their computational behavior on 1440 test instances.
Subject(s): project scheduling
branch-and-bound algorithms
processing times
scheduling policy
Issue Date: 2000
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2000, 702
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Format: Adobe PDF | Size: 208.96 kB
DownloadShow Preview
Format: Postscript | Size: 654.36 kB

Item Export Bar

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