Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14500
For citation please use:
Main Title: Linear preselective policies for stochastic project scheduling
Author(s): Möhring, Rolf H.
Stork, Frederik
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15727
http://dx.doi.org/10.14279/depositonce-14500
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: In the context of stochastic resource-constrained project scheduling we introduce a novel class of scheduling policies, the linear preselective policies. They combine the benefits of preselective policies and priority policies; two classes that are well known from both deterministic and stochastic scheduling. We study several properties of this new class of policies which indicate its usefulness for computational purposes. Based on a new representation of preselective policies as AND/OR precedence constraints we derive efficient algorithms for computing earliest job start times and state a necessary and sufficient dominance criterion for preselective policies. A computational experiment based on 480 instances empirically validates the theoretical findings.
Subject(s): resource-constrained project scheduling
random processing times
scheduling policies
AND/OR precedence constraints
Issue Date: 1998
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: 1998, 612
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:
Report-612-1998.pdf
Format: Adobe PDF | Size: 205.71 kB
DownloadShow Preview
Thumbnail
Report-612-1998.ps
Format: Postscript | Size: 247.95 kB
Download

Item Export Bar

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