Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment
From MaRDI portal
Publication:744657
DOI10.1007/S10479-012-1277-0zbMATH Open1296.90060OpenAlexW2077029377MaRDI QIDQ744657FDOQ744657
Erik Demeulemeester, Wendi Tian
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1277-0
Recommendations
- The interaction between critical chain sequencing, buffer sizing, and reactive actions in a CC/BM framework
- An investigation of buffer sizing techniques in critical chain scheduling
- A critical chain method project scheduling based model and its GA solution
- Exact and flexible solution approach to a critical chain project management problem
- A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
Cites Work
- PSPLIB -- a project scheduling problem library
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- A survey of variants and extensions of the resource-constrained project scheduling problem
- A priority-rule method for project scheduling with work-content constraints
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The construction of stable project baseline schedules
- Proactive heuristic procedures for robust project scheduling: An experimental analysis
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
- Local search methods for the discrete time/resource trade-off problem in project networks
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
- On the fallacy of averages in project risk management
- An investigation of buffer sizing techniques in critical chain scheduling
- Parkinson's Law and Its Implications for Project Management
Cited In (6)
- Non-indexability of the stochastic appointment scheduling problem
- Shortening the project schedule: solving multimode chance-constrained critical chain buffer management using reinforcement learning
- Project scheduling under the threat of catastrophic disruption
- Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty
- Project scheduling cost optimization based on resource transfer costs and robustness
- On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment
Uses Software
This page was built for publication: Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744657)
