Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations

DOI10.1016/j.orl.2023.03.010zbMath1525.90053MaRDI QIDQ6106537

Gerhard J. Woeginger, Dirk Briskorn

Publication date: 3 July 2023

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexityhandover relationstruck sequencing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Cites Work

• On the approximability of average completion time scheduling under precedence constraints.
• Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations