The total adjustment cost problem: applications, models, and solution algorithms
DOI10.1007/S10951-013-0344-YzbMATH Open1297.90051OpenAlexW2022987028MaRDI QIDQ398909FDOQ398909
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
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
project schedulingminimum and maximum time lagsmixed-integer linear programming formulationsresource adjustment
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Optimal resource leveling using non-serial dynamic programming
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The resource renting problem subject to temporal constraints
- Event-based MILP models for resource-constrained project scheduling problems
- Order-based neighborhoods for project scheduling with nonregular objective functions.
- An improved ant colony optimization algorithm for nonlinear resource-leveling problems
- Resource-constrained project scheduling with time windows
Cited In (7)
- MILP-Formulations for the Total Adjustment Cost Problem
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
- A genetic algorithm for the robust resource leveling problem
- Resource overload problems with tardiness penalty: structural properties and solution approaches
- Optimal project duration for resource leveling
- 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
Uses Software
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)
