Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
From MaRDI portal
Publication:882647
DOI10.1007/S10288-006-0017-1zbMath1149.90063OpenAlexW1998571119MaRDI QIDQ882647
Fabrice Tercinet, Christophe Lenté, Emmanuel Néron
Publication date: 24 May 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-006-0017-1
Related Items (2)
Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Computing redundant resources for the resource constrained project scheduling problem
- Lower bounds and reduction procedures for the bin packing problem
- 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
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Ranking lower bounds for the bin-packing problem
- A tight lower bound for optimal bin packing
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Fast lifting procedures for the bin packing problem
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Some simple scheduling algorithms
- Optimal Scheduling of Tasks on Identical Parallel Processors
- New classes of fast lower bounds for bin packing problems
This page was built for publication: Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
