Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 250, Issue 3, Pages 794-806Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2015.10.048
Keywords
Bin packing; Precedence constraints; Lower bounds; Dynamic programming; Branch-and-bound
Funding
- Fondo Nacional de Desarrollo Cientifico y Tecnologico of the Ministry of Education of Chile [1150306]
Ask authors/readers for more resources
The bin packing problem with precedence constraints (BPP-P) is a recently proposed variation of the classical bin packing problem (BPP), which corresponds to a basic model featuring many underlying characteristics of several scheduling and assembly line balancing problems. The formulation builds upon the BPP by incorporating precedence constraints among items, which force successor items to be packed into later bins than their predecessors. In this paper we propose a dynamic programming based heuristic, and a modified exact enumeration procedure to solve the problem. These methods make use of several new lower bounds and dominance rules tailored for the problem in hand. The results of a computational experiment show the effectiveness of the proposed methods, which are able to close all of the previous open instances from the benchmark instance set within very reduced running times. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available