The multiple resource constrained project scheduling problem: A breadth-first approach

Nazareth, Terence; Sanjay, Verma; Bhattacharya, Subir; Bagchi, Arunabha

doi:10.1016/s0377-2217(97)00402-5

Cited by 26 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This dominance rule is a straightforward extension from the well-known left-shift dominance rule in the project scheduling field. A similar rule for the project scheduling problem with the objective of minimizing mean-flow time measure can be found in the paper by Nazareth et al (1999).…”

Section: Algorithm 3 Branch-and-bound Algorithm For Generating Non-dmentioning

confidence: 93%

Bicriteria train scheduling for high-speed passenger railroad planning applications

Zhou

Ming

2005

European Journal of Operational Research

171

View full text Add to dashboard Cite

Section: Algorithm 3 Branch-and-bound Algorithm For Generating Non-dmentioning

confidence: 93%

Bicriteria train scheduling for high-speed passenger railroad planning applications

Zhou

Ming

2005

European Journal of Operational Research

171

View full text Add to dashboard Cite

“…Similarly, Nazareth et al [132] suggest to minimize the mean flow time, which is the average of all activity completion times. Note that minimization of total completion time and minimization of average completion time is equivalent.…”

Section: Time-based Objectivesmentioning

confidence: 99%

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

Hartmann

Briskorn

2010

European Journal of Operational Research

741

356

View full text Add to dashboard Cite

“…Similarly, Nazareth et al [47] suggested minimizing the mean flow time, which is the average of all activity completion times. Vanhoucke [48] defined a set of time windows for each activity carrying out an activity within one of its time windows is desired due to quality considerations.…”

Section: Time Performance Indicatorsmentioning

confidence: 99%

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Chen¹,

Liang

Padilla

2014

Entropy

View full text Add to dashboard Cite

Abstract:Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP), a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC)-an effective and powerful meta-heuristic-to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined OPEN ACCESSEntropy 2014, 16 5033 previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every benchmark set. And, in an attempt to solve larger instances with 50 or 100 activities, we also used the MRCPSP/max benchmark sets, where the increase of the makespan is approximately 35% with respect to the best known solutions at the same time as with a 20% increase in robustness.

show abstract

The multiple resource constrained project scheduling problem: A breadth-first approach

Cited by 26 publications

References 9 publications

Bicriteria train scheduling for high-speed passenger railroad planning applications

Bicriteria train scheduling for high-speed passenger railroad planning applications

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

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Contact Info

Product

Resources

About