One-dimensional vehicle scheduling with a front-end depot and non-crossing constraints

DOI10.1007/s00291-013-0337-4zbMath1290.90038OpenAlexW2049217727MaRDI QIDQ2454369

Simon Emde, Nils Boysen

Publication date: 13 June 2014

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-013-0337-4

zbMATH Keywords

transport logisticsvehicle schedulingnon-crossing constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Twin-crane scheduling during seaside workload peaks with a dedicated handshake area ⋮ A generalized classification scheme for crane scheduling with interference

Cites Work

• Unnamed Item
• Unnamed Item
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• A survey of literature on automated storage and retrieval systems
• Container terminal operation and operations research -- a classification and literature review
• Single hoist cyclic scheduling with multiple tanks: A material handling solution
• The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
• Feature Article—Genetic Algorithms for the Operations Researcher
• Interleaving models for the analysis of twin shuttle automated storage and retrieval systems
• 1D Vehicle Scheduling with Conflicts
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach

This page was built for publication: One-dimensional vehicle scheduling with a front-end depot and non-crossing constraints