Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem

4OR

Volumn 4, Issue 4, 2006, Pages 297-317

  Tercinet, Fabrice ^a   Néron, Emmanuel ^a,b   Lenté, Christophe ^a  

^a UNIVERSITÉ DE TOURS   (France)

^b Polytech'Tours ^*  (France)

Author keywords

Bin packing; Energetic reasoning; Lower bound; Parallel machine scheduling problem

Indexed keywords

EID: 33845298011     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-006-0017-1     Document Type: Article

References (27)

1. Baptiste P, Le Pape C, Nuijten W (1999) Satisfiability tests and time bound adjustments for cumulative scheduling problems. Ann Oper Res 92:305-333
2. Bourjolly JM, Rebetz V (2004) An analysis of lower bounds procedures for the bin packing problem. Eur J Oper Res (to appear)
3. Brucker P (1995) Scheduling algorithms. Springer, Berlin Heidelberg New York
4. Carlier J (1987) Scheduling jobs with release dates and tails on identical machines to minimize makespan. Eur J Oper Res 29:298-306
5. Carlier J. Latapie B (1991) Une Méthode Arborescente pour Résoudre les Problémes Cumulatifs. RAIRO-RO 25(3):311-340
6. Carlier J, Néron E (2004) Computing redundant resources for the resource constrained project scheduling problem. Eur J Oper Res (to appear)
7. max scheduling problem. Ann Oper Res 83:41-58
8. Carlier J, Pinson E (2004) Jackson pseudo preemptive schedule and cumulative scheduling problems. Ann Oper Res (to appear)
9. Chao HY, Harper MR Quong RW (1995) A tight lower bound for optimal bin packing. Oper Res Lett 18:133-138
10. Dell'Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. J Comput 7(2):181-200
11. Elhedhli S (2004) Ranking lower bounds for the bin packing problem. Eur J Operl Res (to appear)
12. Erschler J, Lopez P, Thuriot C (1991) Raisonnement Temporel sous Contraintes de Ressources et Problèmes d'Ordonnancement. Rev Intell Artif 5:7-32
13. Fekete S, Schepers J (1991) New classes of fast lower bounds for bin packing problems. Math Progr 91:11-31
14. Fekete SP, Schepers J (1998) New classes of lower bounds for bin packing problems. (Lecture Notes in Computer Science, vol 1412, pp 257-270). Springer, Berlin Heidelberg New York
15. max scheduling problem. Mémoire de DEA, Université de Tunis III
16. max scheduling problem. J Scheduling 5:329-335
17. Haouari M, Gharbi A (2004) Fast lifting procedures for the bin packing problem (submitted)
18. Hoogeven H, Hurkens C, Lenstra JK, Vandevelde A (1995) Lower bounds for the multiprocessor flow shop. In: 2nd workshop on models and algorithms for planning and scheduling, Wernigerode
19. Horn WA (1974) Some simple scheduling algorithms. Naval Res Logist Q 177-185
20. Jackson J-R (1955) Scheduling a production line to minimize maximum tardiness. Research Report 43, University of California, Los Angeles. Management Science Research Project
21. Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:299-325
22. Lahrichi A (1982) Ordonnancements: La Notion de "Parties Obligatoires" et son Application aux Problèmes Cumulatifs. R.A.I.R.O.-R.O 16:241-262
23. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys M (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH (eds) Logistics of production and inventory. Handbook in operations research and management science 4
24. Lopez P, Erschler J, Esquirol P (1992) Ordonnancement de Tâches sous Contraintes: une Approche énergétique. R.A.I.R.O.-A.P.I.I. 26:453-481
25. Martello S, Toth P (1990) Lower bounds and reduction procedure for the bin packing problem. Discret Appl Math 28:59-70
26. Néron E, Baptiste Ph, Gupta JND (2001) Solving hybrid flow-shop using energetic reasoning. Omega 29:501-511
27. Tercinet F (2004) Méthodes arborescentes pour la résolution des problèmes d'ordonnancement, conception d'un outil d'aide au développement. PhD Thesis, Université François Rabelais Tours