Just-in-time batch scheduling problem with two-dimensional bin packing constraints
Date
2017
Authors
Polyakovskiy, S.
Makarowsky, A.
M'Hallah, R.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 2017 Genetic and Evolutionary Computation Conference (GECCO 2017), 2017, pp.321-328
Statement of Responsibility
Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah
Conference Name
Genetic and Evolutionary Computation Conference (GECCO) (15 Jul 2017 - 19 Jul 2017 : Berlin, Germany)
Abstract
This paper introduces and approximately solves a multi-component problem where small rectangular items are produced from large rectangular bins via guillotine cuts. An item is characterized by its width, height, due date, and earliness and tardiness penalties per unit time. Each item induces a cost that is proportional to its earliness and tardiness. Items cut from the same bin form a batch, whose processing and completion times depend on its assigned items. The items of a batch have the completion time of their bin. The objective is to find a cutting plan that minimizes the weighted sum of earliness and tardiness penalties. We address this problem via a constraint programming (CP) based heuristic (CPH) and an agent based modelling heuristic (ABH). CPH is an impact-based search strategy, implemented in the general-purpose solver IBM CP Optimizer. ABH is constructive. It builds a solution through repeated negotiations between the set of agents representing the items and the set representing the bins. The agents cooperate to minimize the weighted earliness-tardiness penalties. The computational investigation shows that CPH outperforms ABH on small-sized instances while the opposite prevails for larger instances.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2017 ACM Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro t or commercial advantage and that copies bear this notice and the full citation on the rst page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permi ed. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior speci c permission and/or a fee. Request permissions from permissions@acm.org