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

DOI10.1007/S10951-013-0344-YMaRDI QIDQ398909zbMATH OpenOpenAlexFDO

Authors Stefan Kreter, Julia Rieck, Jürgen Zimmermann

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

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

Recommendations

• MILP-Formulations for the Total Adjustment Cost Problem
• On the adjustment problem for linear programs
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• The demand adjustment problem via inexact restoration method
• A model for allocated versus actual costs in assignment and transportation problems
• Cost Allocation Revisited: An Optimality Result
• Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
• A contribution to the linear programming approach to joint cost allocation: methodology and application
• Conditions under which adjustability lowers the cost of a robust linear program

Cites work

• scientific article; zbMATH DE number 4135692 (Why is no real title available?)
• scientific article; zbMATH DE number 2013754 (Why is no real title available?)
• A survey of variants and extensions of the resource-constrained project scheduling problem
• An improved ant colony optimization algorithm for nonlinear resource-leveling problems
• Event-based MILP models for resource-constrained project scheduling problems
• Exact methods for the resource levelling problem
• Mixed-integer linear programming for resource leveling problems
• Network flows. Theory, algorithms, and applications.
• Optimal resource leveling using non-serial dynamic programming
• Order-based neighborhoods for project scheduling with nonregular objective functions.
• Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
• Project scheduling. A research handbook.
• Resource levelling for projects with schedule-dependent time windows
• Resource-constrained project scheduling with time windows
• The resource renting problem subject to temporal constraints

Cited in

(11)

• MILP-Formulations for the Total Adjustment Cost Problem
• A cost optimization model for multiresource leveling problem without project duration constraint
• Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
• A genetic algorithm for the robust resource leveling problem
• Multiobjective model for solving resource-leveling problem with discounted cash flows
• Resource overload problems with tardiness penalty: structural properties and solution approaches
• Optimal project duration for resource leveling
• Mixed-integer linear programming for resource leveling problems
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration
• A metaheuristic solution approach for the time-constrained project scheduling problem
• Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The total adjustment cost problem: applications, models, and solution algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398909)