Mixed-integer linear programming for resource leveling problems

DOI10.1016/j.ejor.2012.03.003zbMath1253.90116OpenAlexW1982430361MaRDI QIDQ1926816

Thorsten Gather, Julia Rieck, Jürgen Zimmermann

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.03.003

zbMATH Keywords

project schedulingcutting planeslower and upper boundsminimum and maximum time lagsresource leveling\texttt{CPLEX 12.1}

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items

Mixed integer programming formulations for the biomass truck scheduling problem, A metaheuristic solution approach for the time-constrained project scheduling problem, Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities, A genetic algorithm for the robust resource leveling problem, Energy-oriented scheduling based on evolutionary algorithms, Benders decomposition for a period-aggregated resource leveling problem with variable job duration, A common approximation framework for early work, late work, and resource leveling problems, The total adjustment cost problem: applications, models, and solution algorithms, Resource leveling in projects with flexible structures, Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space, A lexicographic approach to the robust resource-constrained project scheduling problem, A cost optimization model for multiresource leveling problem without project duration constraint, The bilevel optimisation of a multi-agent project scheduling and staffing problem, An updated survey of variants and extensions of the resource-constrained project scheduling problem, Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems, Optimal project duration for resource leveling, Simplifying activity networks under generalized precedence relations to extended CPM networks, Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

Uses Software

• PSPLIB
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the calculation of transitive reduction-closure of orders
• Event-based MILP models for resource-constrained project scheduling problems
• Optimal resource leveling using non-serial dynamic programming
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• Active and stable project scheduling
• Project scheduling. A research handbook.
• Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Exact methods for the resource levelling problem
• Perspectives in modern project scheduling.
• Critical-Path Planning and Scheduling: Mathematical Basis
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Finding All Spanning Trees of Directed and Undirected Graphs