Optimal solutions for a dock assignment problem with trailer transportation
From MaRDI portal
Publication:744629
DOI10.1007/s10479-011-0971-7zbMath1296.90068OpenAlexW2562134167MaRDI QIDQ744629
Roel Leus, Frits C. R. Spieksma, Lotte Berghman
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/266692
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items
Scheduling evacuation operations ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Robust spotter scheduling in trailer yards ⋮ Managing customer arrivals with time windows: a case of truck arrivals at a congested container terminal ⋮ A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-objective and prioritized berth allocation in container ports
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Mathematical programming formulations for machine scheduling: A survey
- Optimal scheduling of a two-stage hybrid flow shop
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A state-of-the-art review of parallel-machine scheduling research
- Truck dock assignment problem with operational time constraint within crossdocks
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- A time indexed formulation of non-preemptive single machine scheduling problems
- Manufacturing flow line systems: A review of models and analytical results
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- 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 with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Scheduling jobs of equal length: Complexity, facets and computational results
- Scheduling inbound and outbound trucks at cross docking terminals
- 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
- The crane scheduling problem: models and solution approaches
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Operations research at container terminals: a literature update
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Dispatching vehicles in a mega container terminal
- Analysis of a new vehicle scheduling and location problem
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
