Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
Authors:
- 25 July 2006
- journal article
- Published by Springer Nature in 4OR
- Vol. 4 (4) , 297-317
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Minimizing makespan on parallel machines subject to release dates and delivery timesJournal of Scheduling, 2002
- New classes of fast lower bounds for bin packing problemsMathematical Programming, 2001
- Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problemsAnnals of Operations Research, 1999
- Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problemAnnals of Operations Research, 1998
- New Classes of Lower Bounds for Bin Packing ProblemsLecture Notes in Computer Science, 1998
- A tight lower bound for optimal bin packingOperations Research Letters, 1995
- Scheduling Algorithms1995
- Une méthode arborescente pour résoudre les problèmes cumulatifsRAIRO - Operations Research, 1991
- Scheduling jobs with release dates and tails on identical machines to minimize the makespanEuropean Journal of Operational Research, 1987
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974