Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
From MaRDI portal
(Redirected from Publication:882647)
Recommendations
- Energetic reasoning revisited: Application to parallel machine scheduling
- Lower bounds for scheduling on identical parallel machines with heads and tails
- Lower bounds for parallel machine scheduling problems
- Tight bounds for the identical parallel machine scheduling problem
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Cites work
- A tight lower bound for optimal bin packing
- Computing redundant resources for the resource constrained project scheduling problem
- Fast lifting procedures for the bin packing problem
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- scientific article; zbMATH DE number 279273 (Why is no real title available?)
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Lower bounds and reduction procedures for the bin packing problem
- Minimizing makespan on parallel machines subject to release dates and delivery times
- New classes of fast lower bounds for bin packing problems
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- Ranking lower bounds for the bin-packing problem
- 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
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(4)- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- Comparison of three classical lower bounds for the parallel machines scheduling problem
- Energetic reasoning revisited: Application to parallel machine scheduling
This page was built for publication: Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q882647)
