Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
From MaRDI portal
(Redirected from Publication:6581391)
Recommendations
- A new LP-based lower bound for the cumulative scheduling problem
- Redundant cumulative constraints to compute preemptive bounds
- An Approximative Criterion for the Potential of Energetic Reasoning
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- Energetic reasoning for energy-constrained scheduling with a continuous resource
Cites work
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Adjustment of heads and tails for the job-shop problem
- An O(n^2) algorithm for time-bound adjustments for the cumulative scheduling problem
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- Horizontally elastic not-first/not-last filtering algorithm for cumulative resource constraint
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Lower bounds for scheduling on identical parallel machines with heads and tails
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- PSPLIB -- a project scheduling problem library
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Some simple scheduling algorithms
- Timetable edge finding filtering algorithm for discrete cumulative resources
- Using constraint programming for solving RCPSP/MAX-cal
Cited in
(4)- Measuring the slack between lower bounds for scheduling on parallel machines
- More powerful energetic reasoning for the cumulative scheduling problem
- Comparison of three classical lower bounds for the parallel machines scheduling problem
- Improved energetic reasoning checker for cumulative constraint with profile
This page was built for publication: Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581391)
