Network scheduling problem with cross-docking and loading constraints
From MaRDI portal
Publication:2668719
DOI10.1016/j.cor.2021.105271OpenAlexW3136811578MaRDI QIDQ2668719
Pedro B. Castellucci, Alysson M. Costa, Franklina Maria Bragion Toledo
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105271
Related Items (6)
An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints ⋮ The multiple container loading problem with loading docks ⋮ A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach ⋮ Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory
Cites Work
- Synchronization in cross-docking networks: a research classification and framework
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Integrating dock-door assignment and vehicle routing with cross-docking
- Vehicle routing with cross-dock selection
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock
- A survey on Benders decomposition applied to fixed-charge network design problems
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network
- The split delivery vehicle routing problem with three-dimensional loading constraints
- The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models
- Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer
- Logic-based Benders decomposition for scheduling a batching machine
- Constraints in container loading -- a state-of-the-art review
- Integrated truck and workforce scheduling to accelerate the unloading of trucks
- Multiple crossdocks with inventory and time windows
- A comparative review of 3D container loading algorithms
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Multicommodity Distribution System Design by Benders Decomposition
- Benchmarking optimization software with performance profiles.
- A model‐based heuristic to the vehicle routing and loading problem
This page was built for publication: Network scheduling problem with cross-docking and loading constraints
