Vehicle scheduling under the warehouse-on-wheels policy
From MaRDI portal
Publication:266928
DOI10.1016/j.dam.2015.11.015zbMath1339.90048OpenAlexW2220573167MaRDI QIDQ266928
Dirk Briskorn, Malte Fliedner, Nils Boysen
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.015
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture ⋮ Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
Cites Work
- Unnamed Item
- Unnamed Item
- Lower and upper bounds for the bin packing problem with fragile objects
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- New lower bounds for bin packing problems with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristic algorithms for the three-dimensional bin packing problem
- Algorithms for the variable sized bin packing problem
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- Cardinality constrained bin-packing problems
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Algorithms for the Bin Packing Problem with Conflicts
- Efficient algorithms for interval graphs and circular-arc graphs
This page was built for publication: Vehicle scheduling under the warehouse-on-wheels policy