Resource-constrained project scheduling: A critical activity reordering heuristic

Valls, Vicente; Quintanilla, Sacramento; Ballestín, Francisco

doi:10.1016/s0377-2217(02)00768-3

Cited by 94 publications

(41 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solution representation: since delays in sections 4.1 and 4.2 are done according to the order in which activities appear in the PL, we employ the topological order (TO) representation first proposed by Valls et al (2003Valls et al ( , 2004, and used for the RCPSP by Debels et al (2006). The TO representation ensures a precedence feasible ordering of activities and is updated based on actual finish times after the improvement methods discussed in sections 4.2.2 and 4.2.3 have been applied.…”

Section: Metaheuristicsmentioning

confidence: 99%

Capital- and resource-constrained project scheduling with net present value optimization

Leyman

Vanhoucke

2017

European Journal of Operational Research

View full text Add to dashboard Cite

In this paper, we study the capital-constrained project scheduling problem with discounted cash flows (CCPSPDC) and the capital-and resource-constrained project scheduling problem with discounted cash flows (CRCPSPDC). The objective of both problems is to maximize the project net present value (NPV), based on three cash flow models. Both problems include capital constraints, which force the project to always have a positive cash balance. Hence, it is crucial to schedule activities in such an order that sufficient capital is available.The contribution of this paper is threefold. First, we propose three distinct cash flow models, which affect the capital availability during the project. Second, we introduce two new schedulers to improve capital feasibility, one for the CCPSPDC and one for the CRCPSPDC. The schedulers focus on delaying sets of activities, which cause cash outflows to be received at later time instances, in order to reduce capital shortages. Both schedulers are implemented as part of three metaheuristics from literature, in order to compare the metaheuristics' performance. Two penalty functions have been included, one to improve capital feasibility and another to improve deadline feasibility. Third, the proposed procedure has been tested on a large dataset and the added value of the schedulers has been validated. Managerial insights are provided with respect to the impact of key parameters.

show abstract

Section: Metaheuristicsmentioning

confidence: 99%

Capital- and resource-constrained project scheduling with net present value optimization

Leyman

Vanhoucke

2017

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…• Representation of a schedule: Based on the remarks by Debels et al (2006) who have illustrated that a random key representation is very effective thanks to the use of the topological ordering notation (Valls et al, 2003), this notation has been adapted to the dual population heuristic, as follows: the random key elements are equal to the activity finishing times for a left-justified schedule, and equal to the starting times for a right-justified schedule.…”

Section: Rcpsp Scheduling Stepmentioning

confidence: 99%

“…This representation consists of the starting times of the sub-activities with a positive duration in increasing order followed by set of remaining activity modes that are not part of the feasible schedule (i.e. the sub-activities with a duration of zero) and is an extension of the topological order representation of Valls et al (2003Valls et al ( , 2004. Since a feasible project schedule can be uniquely defined by its activity starting times, such an AL can always be constructed.…”

Section: Rcpsp Scheduling Stepmentioning

confidence: 99%

The Multi-Mode Resource-Constrained Project Scheduling Problem

Coelho

Vanhoucke

2014

Handbook on Project Management and Scheduling Vol.1

View full text Add to dashboard Cite

This chapter reports on a new solution approach for the multi-mode resource-constrained project scheduling problem (MRCPSP, MPS|prec|C max ). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource-feasible project schedule with a minimal makespan. The problem type is known to be N P-hard and has been solved using various exact as well as (meta-)heuristic procedures. The new algorithm splits the problem type into a mode assignment and a single mode project scheduling step. The mode assignment step is solved by a satisfiability (SAT) problem solver and returns a feasible mode selection to the project scheduling step. The project scheduling step is solved using an efficient meta-heuristic procedure from literature to solve the resourceconstrained project scheduling problem (RCPSP). However, unlike many traditional meta-heuristic methods in literature to solve the MRCPSP, the new approach executes these two steps in one run, relying on a single priority list. Straightforward adaptations to the pure SAT solver by using pseudo boolean non-renewable resource constraints has led to a high quality solution approach in a reasonable computational time. Computational results show that the procedure can report similar or sometimes even better solutions than found by other procedures in literature, although it often requires a higher CPU time.

show abstract

“…Usually, generating a single solution by means of the proposed heuristics requires less than 0.1 s for large problem instances with 600 tests and 25 variants of experimental vehicles. Thus, it is advisable to make use of a so called multi-pass heuristic (Valls et al 2001), where the priority-rule method is applied repeatedly, each time using different priority values .i/. However, since the number of adequate priority-rules is limited, we make use of compound priority rules and values.…”

Section: Multi-start Proceduresmentioning

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

Resource-constrained project scheduling: A critical activity reordering heuristic

Cited by 94 publications

References 21 publications

Capital- and resource-constrained project scheduling with net present value optimization

Capital- and resource-constrained project scheduling with net present value optimization

The Multi-Mode Resource-Constrained Project Scheduling Problem

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

Contact Info

Product

Resources

About