One-dimensional bin packing with pattern-dependent processing time

In this paper the classical one-dimensional bin packing problem is integrated with scheduling elements: a due date is assigned to each item and the time required to process each bin depends on the pattern being used. The objective is to minimize a convex combination of the material waste and the del...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 322; no. 3; pp. 770 - 782
Main Authors:	Marinelli, Fabrizio, Pizzuti, Andrea, Wu, Wei, Yagiura, Mutsunori
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.05.2025
Subjects:	Batch scheduling Branch-and-price Dynamic programming Mixed integer programming Packing Mixed integer programming Branch-and-price Dynamic programming Packing Batch scheduling
ISSN:	0377-2217
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!