Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
From MaRDI portal
Publication:6581391
DOI10.1007/s10479-023-05596-9zbMath1544.90076MaRDI QIDQ6581391
Antoine Jouglet, Jacques Carlier, Abderrahim Sahli
Publication date: 30 July 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Lower bounds for scheduling on identical parallel machines with heads and tails
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- PSPLIB -- a project scheduling problem library
- Adjustment of heads and tails for the job-shop problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Horizontally elastic not-first/not-last filtering algorithm for cumulative resource constraint
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
- Using constraint programming for solving RCPSP/MAX-cal
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- Some simple scheduling algorithms
Related Items (1)
This page was built for publication: Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
