Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations

DOI10.1016/j.orl.2021.12.004OpenAlexW4200463422MaRDI QIDQ2670471

Lotte Berghman, Quentin Fabry, Alessandro Agnetis, Cyril Briand

Publication date: 11 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.orl.2021.12.004

zbMATH Keywords

complexitytruck schedulingcrossdockingflow time minimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations ⋮ A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach

Cites Work

• Synchronization in cross-docking networks: a research classification and framework
• Scheduling cross docking operations under full, partial and no information on inbound arrivals
• Truck scheduling at zero-inventory cross docking terminals
• Some simplified NP-complete graph problems
• Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost
• Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors
• Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
• Minimizing the makespan in a two-machine cross-docking flow shop problem

This page was built for publication: Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations