A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints

DOI10.1016/J.EJOR.2015.09.049zbMath1346.90492OpenAlexW2183505869MaRDI QIDQ321126

Frédéric Semet, Shahin Gelareh, Gilles Goncalves, Rahimeh Neamatian Monemi

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.049

zbMATH Keywords

facet-defining inequalitiesdimensionpolytopevalid inequalitiestruck dock assignment

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (5)

A comparison of formulations and relaxations for cross-dock door assignment problems ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints ⋮ Coordinated lab-clinics: a tactical assignment problem in healthcare ⋮ Modeling and solving the waste valorization production and distribution scheduling problem

Cites Work

• Synchronization in cross-docking networks: a research classification and framework
• Optimal solutions for a dock assignment problem with trailer transportation
• Research on warehouse operation: a comprehensive review
• Optimizing over the first Chvátal closure
• Truck dock assignment problem with operational time constraint within crossdocks
• Recognizing facet defining inequalities
• The over-constrained airport gate assignment problem
• Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
• Airport gate scheduling with time windows
• Transshipment through crossdocks with inventory and time windows
• Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks
• New heuristics for over-constrained flight to gate assignments

This page was built for publication: A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints