Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
From MaRDI portal
Publication:1754108
DOI10.1016/j.ejor.2017.10.014zbMath1403.90525OpenAlexW2765507185MaRDI QIDQ1754108
Stefan Kreter, Jürgen Zimmermann, Peter J. Stuckey, Andreas Schutt
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.10.014
project schedulingmixed-integer linear programminglazy clause generationgeneral temporal constraints and calendarsresource availability cost problem
Related Items (4)
Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-price-and-cut algorithm for multi-mode resource leveling
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
- Explaining the \texttt{cumulative} propagator
- Optimal speedup of Las Vegas algorithms
- A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty
- Robust optimization models for project scheduling with resource availability cost
- An exact algorithm for minimizing resource availability costs in project scheduling
- PSPLIB -- a project scheduling problem library
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Order-based neighborhoods for project scheduling with nonregular objective functions.
- Active and stable project scheduling
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Multi-mode resource availability cost problem with recruitment and release dates for resources
- Using constraint programming for solving RCPSP/MAX-cal
- Resource levelling for projects with schedule-dependent time windows
- Scheduling of resource-constrained projects
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Mixed-integer linear programming for resource leveling problems
- Propagation via lazy clause generation
- Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
- Solving RCPSP/max by lazy clause generation
- Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
- Calendarization of time planning in MPM networks
- Optimization guided lower and upper bounds for the resource investment problem
- A new heuristic for the multi-mode resource investment problem
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- Minimizing Resource Availability Costs in Time-Limited Project Networks
- Project scheduling with calendars
This page was built for publication: Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
