Procedures for the bin packing problem with precedence constraints

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

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.

Original languageEnglish
Pages (from-to)794-806
Number of pages13
JournalEuropean Journal of Operational Research
Volume250
Issue number3
DOIs
StatePublished - 1 May 2016
Externally publishedYes

Keywords

  • Bin packing
  • Branch-and-bound
  • Dynamic programming
  • Lower bounds
  • Precedence constraints

Fingerprint

Dive into the research topics of 'Procedures for the bin packing problem with precedence constraints'. Together they form a unique fingerprint.

Cite this