Practical solutions for a dock assignment problem with trailer transportation
DOI10.1016/J.EJOR.2015.05.057zbMATH Open1346.90479OpenAlexW3121502134MaRDI QIDQ319870FDOQ319870
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/498578
Recommendations
- Optimal solutions for a dock assignment problem with trailer transportation
- Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints
- The Intermodal Trailer Assignment Problem
- Truck dock assignment problem with operational time constraint within crossdocks
- Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
- The assignment and loading transportation problem
- A truck scheduling problem arising in intermodal container transportation
- Integrating dock-door assignment and vehicle routing with cross-docking
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Tabu Search—Part I
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A multiple-criterion model for machine scheduling
- Scheduling
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- Project scheduling under uncertainty: survey and research potentials
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling of Project Networks by Job Assignment
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- `` Strong NP-Completeness Results
- Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
- Multicriteria scheduling
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Truck dock assignment problem with operational time constraint within crossdocks
- Solving Project Scheduling Problems by Minimum Cut Computations
- Optimal solutions for a dock assignment problem with trailer transportation
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Two-machine flowshop scheduling with a secondary criterion
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Title not available (Why is that?)
- Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
- Scheduling on parallel identical machines to minimize total tardiness
- Optimal scheduling of a two-stage hybrid flow shop
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Parallel machine scheduling with precedence constraints and setup times
Cited In (6)
- Modeling and solving the waste valorization production and distribution scheduling problem
- Robust spotter scheduling in trailer yards
- The dock problem revisited
- The Intermodal Trailer Assignment Problem
- Optimal solutions for a dock assignment problem with trailer transportation
- Integrated truck and workforce scheduling to accelerate the unloading of trucks
Uses Software
This page was built for publication: Practical solutions for a dock assignment problem with trailer transportation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319870)