Pages that link to "Item:Q1652605"
From MaRDI portal
The following pages link to A comparison of formulations and relaxations for cross-dock door assignment problems (Q1652605):
Displaying 10 items.
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints (Q321126) (← links)
- Comparing an approximate queuing approach with simulation for the solution of a cross-docking problem (Q670435) (← links)
- A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse (Q747012) (← links)
- Integrating dock-door assignment and vehicle routing with cross-docking (Q1651517) (← links)
- Probabilistic tabu search for the cross-docking assignment problem (Q1740539) (← links)
- A multiobjective mathematical model for truck scheduling problem in multidoor cross-docking system (Q2169336) (← links)
- Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock (Q2171093) (← links)
- Collaborative optimization of dock door assignment and vehicle scheduling in cross-docking (Q2223274) (← links)
- A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy (Q6048039) (← links)
- Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations (Q6106537) (← links)
