Procedures for the bin packing problem with precedence constraints

Pereira, Jordi

Keywords: dynamic programming, lower bounds, bin packing, precedence constraints, branch-and-bound

Abstract

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.

Más información

Título de la Revista: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 250
Número: 3
Editorial: ELSEVIER SCIENCE BV
Fecha de publicación: 2016
Página de inicio: 794
Página final: 806
Idioma: English
DOI:

10.1016/j.ejor.2015.10.048

Notas: WOS Core Collection ISI SCOPUS