A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

Dorndorf, Ulrich; Pesch, Erwin; Phan‐Huy, Toàn

doi:10.1287/mnsc.46.10.1365.12272

Cited by 100 publications

(54 citation statements)

References 21 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Problems with minimal and maximal time lags have been discussed by, e.g., Bartusch et al [16], Cesta et al [36], Dorndorf et al [58], Neumann and Zimmermann [135,137], Neumann et al [138], Schwindt [161], and Schwindt and Trautmann [162]). The concepts of minimal and maximal time lags has also been considered within the multi-mode RCPSP, see Barrios et al [14], Brucker and Knust [30], Heilmann [82,83], de Reyck and Herroelen [47] and Calhoun et al [34].…”

Section: Maximal Time Lagsmentioning

confidence: 99%

A survey of variants and extensions of the resource-constrained project scheduling problem

Hartmann

Briskorn

2010

European Journal of Operational Research

739

356

View full text Add to dashboard Cite

Section: Maximal Time Lagsmentioning

confidence: 99%

A survey of variants and extensions of the resource-constrained project scheduling problem

Hartmann

Briskorn

2010

European Journal of Operational Research

739

356

View full text Add to dashboard Cite

“…Dorndorf et al (2000) proposed an effective branch and bound method for the RCPSP problem denoted as PSjtempjC max (Błażewicz et al 1996;Brucker et al 1999a). The solution method is based on the constraint propagation that reduces the search space.…”

Section: Related Workmentioning

confidence: 99%

Robust Optimization for the Discrete Time-Cost Tradeoff Problem with Cost Uncertainty

Hazır

Haouari

Erel

2014

Handbook on Project Management and Scheduling Vol. 2

View full text Add to dashboard Cite

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher's location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) PrefaceThis handbook is devoted to scientific approaches to the management and scheduling of projects. Due to their practical relevance, project management and scheduling have been important subjects of inquiry since the early days of Management Science and Operations Research and remain an active and vibrant field of study. The handbook is meant to provide an overview of some of the most active current areas of research. Each chapter has been written by well-recognized scholars, who have made original contributions to their topic. The handbook covers both theoretical concepts and a wide range of applications. For our general readers, we give a brief introduction to elements of project management and scheduling in the first chapter, where we also survey the contents of this book. We believe that the handbook will be a valuable and comprehensive reference to researchers and practitioners in project management and scheduling and hope that it might stimulate further research in this exciting and practically important field.Short-listing and selecting the contributions to this handbook and working with more than one hundred authors have been a challenging and rewarding experience for us. We are grateful to Günter Sch...

show abstract

“…It is obvious that the choice of appropriate preference weights and priorities as well as the ordering of the partial goals by importance using parameters ai, 0%, may have a substantial impact on the optimal gate schedule. The basic optimization algorithm is a truncated branch and bound procedure (see [25] and [26]). The algorithm proceeds by assigning modes to the activities and by resolving resource conflicts that might appear.…”

Section: Find a Schedule (S C M) Which Assures The Following Constrmentioning

confidence: 99%

Flight gate scheduling: State-of-the-art and recent developments

Dorndorf

Drexl

Nikulin

et al. 2007

Omega

Self Cite

126

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. This work has been supported by the German Science Foundation (DFG) through the grant "Planung der Bodenabfertigung an Flughäfen" (Dr 170/9-1, 9-2 and Pe 514/10-2). Terms of use: Documents in2 Corresponding author Abstract This paper surveys a large variety of mathematical models and up-to-date Solution techniques developed for solving a general flight gate scheduling problem that deals with assigning difFerent aircraft activities (arrival, departure and intermediate parking) to distinct aircraft stands or gates. The aim of the work is both to present various models and Solution techniques which are available in nowadays literature and to give a general idea about new open problems that arise in practise. We restrict the scope of the paper to flight gate Management without touching scheduling of ground handling Operations.Keywords: flight gate scheduling, assignment of aircraft activities to terminals, survey of models and algorithms.

show abstract

A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

Cited by 100 publications

References 21 publications

A survey of variants and extensions of the resource-constrained project scheduling problem

A survey of variants and extensions of the resource-constrained project scheduling problem

Robust Optimization for the Discrete Time-Cost Tradeoff Problem with Cost Uncertainty

Flight gate scheduling: State-of-the-art and recent developments

Contact Info

Product

Resources

About