The total adjustment cost problem: applications, models, and solution algorithms

DOI10.1007/s10951-013-0344-yzbMath1297.90051OpenAlexW2022987028MaRDI QIDQ398909

Jürgen Zimmermann, Stefan Kreter, Julia Rieck

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0344-y

zbMATH Keywords

project schedulingminimum and maximum time lagsmixed-integer linear programming formulationsresource adjustment

Mathematics Subject Classification ID

Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ Optimal project duration for resource leveling

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved ant colony optimization algorithm for nonlinear resource-leveling problems
• Event-based MILP models for resource-constrained project scheduling problems
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Optimal resource leveling using non-serial dynamic programming
• Order-based neighborhoods for project scheduling with nonregular objective functions.
• Project scheduling. A research handbook.
• Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
• Resource levelling for projects with schedule-dependent time windows
• Mixed-integer linear programming for resource leveling problems
• Exact methods for the resource levelling problem
• The resource renting problem subject to temporal constraints