A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates

Sergey Polyakovskiy and M’Hallah, Rym

European Journal of Operational Research, 2018, vol. 266, issue 3, 819-839

Abstract: The two-dimensional non-oriented bin packing problem with due dates packs a set of rectangular items, which may be rotated by 90°, into identical rectangular bins. The bins have equal processing times. An item’s lateness is the difference between its due date and the completion time of its bin. The problem packs all items without overlap as to minimize maximum lateness Lmax.

Keywords: Cutting; Two-dimensional bin packing; Batch scheduling; Packing heuristic; Lookahead search (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717309591
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:266:y:2018:i:3:p:819-839

DOI: 10.1016/j.ejor.2017.10.046

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().