Heuristics for solving the bin-packing problem with conflicts

Applied Mathematical Sciences

Volumn 5, Issue 33-36, 2011, Pages 1739-1752

  Maiza, Mohamed ^a   Radjef, Mohammed Said ^b  

^a ECOLE MILITAIRE POLYTECHNIQUE   (Algeria)

^b UNIVERSITY OF BEJAIA   (Algeria)

Author keywords

Bin packing; Conflicts graph; Maximal clique; Maximal stablesubset

Indexed keywords

EID: 80051588646     PISSN: None     EISSN: 1312885X     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. A. Khanafer, F. Clautiaux and E.G. Talbi, New lower bounds for bin packing problems with conflicts, European journal of operational research, 206 (2010), 281-288.
2. A.E.F. Muritiba, M. Iori, E. Malaguti and P. Toth, Algorithms for the bin packing problem with conflicts, Informs Journal on computing, 22(3) (2010), 401-415.
3. C. Basnet and J. Wilson, Heuristics for determining the number of warehouses for storing non-compatible products, International transactions in operational research, 12 (2005), 527-538.
4. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham, Worst-case performance bounds for simple one dimensional packing algorithms, SIAM Journal on Computing, 3(4) (1974), 299-325.
5. D.S. Johnson, Approximation algorithms for combinatorial problems, Joumal of Computers & System Science, 9 (1974), 256-278.
6. E. Falkenauer, A hybrid grouping genetic algorithm, Journal of Heuristics, 2 (1996), 5-30.
7. E.G. Coffman, M.R. Garey and D.S. Johnson, Approximation Algorithms for NP-Hard Problems, PWS Publishing, 1996, chapter 2, 46-93.
8. J.N.D. Gupta and J.C. Ho, A new heuristic algorithm for the onedimensional bin-packing problem, Production Planning & Control, 10(6) (1999), 598-603.
9. Jr.E.G. Coffman, M. Garey and D. Johnson, Approximation algorithms for bin-packing - an updated survey, In: Algorithm design for computer system design, Vienna-Springer, 1984.
10. K. Fleszar and K.S. Hindi, New heuristics for one dimensional bin-packing, Computers & Operations Research, 29 (2002), 821-839.
11. K. Jansen, An Approximation Scheme for Bin Packing with Conflicts, Journal of Combinatorial Optimization, 3 (1999), 363-377
12. M. Gendreau, G. Laporte and F.Semet, Heuristics and lower bounds for the bin packing problem with conflicts, Computers & Operations Research, 31 (2004), 347-358.
13. R. Kalfakakou, S. Katsavounis and K. Tsouros, Minimum number of warehouses for storing simultaneously compatible products, International Journal of Production Economics, 81-82 (2003), 559-564.
14. S. Eilon and N. Christofides, The loading problem, Management Science, 17 (1971), 259-268.
15. T.R. Hoffmann, Assembly line balancing with a precedence matrix, Management Science, 9 (1963), 551-562.