Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment

DOI10.1007/S10479-012-1277-0zbMath1296.90060OpenAlexW2077029377MaRDI QIDQ744657

Wendi Tian, Erik L. Demeulemeester

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

zbMATH Keywords

railway schedulingresource availabilityfeeding bufferpriority Listroadrunner scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty ⋮ Non-indexability of the stochastic appointment scheduling problem ⋮ Project scheduling cost optimization based on resource transfer costs and robustness ⋮ Project scheduling under the threat of catastrophic disruption ⋮ On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment

Uses Software

• PSPLIB

Cites Work

• Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
• A survey of variants and extensions of the resource-constrained project scheduling problem
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
• A priority-rule method for project scheduling with work-content constraints
• PSPLIB -- a project scheduling problem library
• Project scheduling. A research handbook.
• On the fallacy of averages in project risk management
• 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
• An investigation of buffer sizing techniques in critical chain scheduling
• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
• Parkinson's Law and Its Implications for Project Management
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• 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
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment