Scheduling in Layout-Constrained Pallet Buffers: A Logic-Based Benders Decomposition for the BFJSPT-TW
T.G. van der Ven (TU Delft - Mechanical Engineering)
M. Wisse – Mentor (TU Delft - Robust Robot Systems)
Javier Alonso-Mora – Graduation committee member (TU Delft - Learning & Autonomous Control)
B. Atasoy – Graduation committee member (TU Delft - Transport Engineering and Logistics)
Wolfgang Möllmann – Mentor
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In this paper, we address the Blocking Flexible Job-Shop Scheduling Problem with Transportation and Time Windows (BFJSPT-TW), which combines assignment, blocking, and transport constraints under spatial feasibility.
Exact monolithic formulations rapidly become intractable as instance size increases. To overcome this, we propose a Logic-Based Benders Decomposition (LBBD) that integrates a disjunctive-graph relaxation into the master problem, providing informative lower bounds and accelerating convergence.
The subproblem is solved through Constraint Programming, ensuring temporal and blocking feasibility.
Computational experiments demonstrate that the proposed LBBD–DG achieves near-optimal solutions with up to 80 % stronger initial bounds and four times faster convergence than baseline models.
The method establishes a scalable near-exact framework for layout-aware scheduling that is capable of producing high quality schedules in minutes for very large problem instances.
Files
File under embargo until 01-12-2027