Practical solutions for a dock assignment problem with trailer transportation
From MaRDI portal
Publication:319870
DOI10.1016/j.ejor.2015.05.057zbMath1346.90479OpenAlexW3121502134MaRDI QIDQ319870
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
Integer programming (90C10) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Integrated truck and workforce scheduling to accelerate the unloading of trucks ⋮ Robust spotter scheduling in trailer yards ⋮ Modeling and solving the waste valorization production and distribution scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Optimal solutions for a dock assignment problem with trailer transportation
- 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
- Truck dock assignment problem with operational time constraint within crossdocks
- Parallel machine scheduling with precedence constraints and setup times
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- 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
- Project scheduling under uncertainty: survey and research potentials
- 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
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- A multiple-criterion model for machine scheduling
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Multicriteria scheduling
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- Solving Project Scheduling Problems by Minimum Cut Computations
- Scheduling of Project Networks by Job Assignment
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Tabu Search—Part I
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- `` Strong NP-Completeness Results
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Scheduling
