Lower bounds for the event scheduling problem with consumption and production of resources
From MaRDI portal
Publication:1686062
DOI10.1016/j.dam.2016.05.021zbMath1382.90032OpenAlexW2474901069MaRDI QIDQ1686062
Jacques Carlier, Aziz Moukrim, Abderrahim Sahli
Publication date: 20 December 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.021
Related Items (3)
On the integration of diverging material flows into resource-constrained project scheduling ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm
- Scheduling subject to nonrenewable-resource constraints
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- PSPLIB -- a project scheduling problem library
- On linear lower bounds for the resource constrained project scheduling problem.
- Project scheduling with inventory constraints
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
This page was built for publication: Lower bounds for the event scheduling problem with consumption and production of resources
