Two CP models integrate flexible job shop scheduling with zoned heterogeneous transbot routing and handoffs; a book-and-release strategy yields high-quality solutions on adapted benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scheduling and Routing in the Flexible Job Shop with Heterogeneous Transbots and Zoning: A Constraint Programming Approach
Two CP models integrate flexible job shop scheduling with zoned heterogeneous transbot routing and handoffs; a book-and-release strategy yields high-quality solutions on adapted benchmarks.