Tv
T.G. van der Ven
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
1 records found
1
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. ...
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. ...
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.
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.