Continuous filling and emptying of storage systems in constraint-based scheduling
From MaRDI portal
Publication:1772852
DOI10.1016/j.ejor.2004.04.019zbMath1066.90041OpenAlexW2060596432MaRDI QIDQ1772852
Publication date: 21 April 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.019
Related Items (4)
Optimal operation of pumped-hydro storage plants with continuous time-varying power prices ⋮ On the integration of diverging material flows into resource-constrained project scheduling ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ Complexity of single machine scheduling subject to nonnegative inventory constraints
Uses Software
Cites Work
- Scheduling and constraint propagation
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- A new approach to integrating mixed integer programming and constraint logic programming
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
- Optimal timing of a sequence of tasks with general completion costs
- Project scheduling with inventory constraints
This page was built for publication: Continuous filling and emptying of storage systems in constraint-based scheduling