Mixed-Integer Linear Programming Formulation and Priority-Rule Methods for a Preemptive Project Staffing and Scheduling Problem
- 8 October 2014
- book chapter
- Published by Springer Nature
- p. 603-617
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Lower bounds for a multi-skill project scheduling problemOperations Research Proceedings, 2012
- Pre-emption in resource-constrained project schedulingEuropean Journal of Operational Research, 2008
- Resource‐Constrained Project Scheduling2008
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling ProblemRAIRO - Operations Research, 2007
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode versionEuropean Journal of Operational Research, 2003
- On linear lower bounds for the resource constrained project scheduling problemEuropean Journal of Operational Research, 2003
- A new LP-based lower bound for the cumulative scheduling problemEuropean Journal of Operational Research, 2000
- Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problemsAnnals of Operations Research, 1999
- New Benchmark Results for the Resource-Constrained Project Scheduling ProblemManagement Science, 1997
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983