Vehicle scheduling under the warehouse-on-wheels policy
From MaRDI portal
(Redirected from Publication:266928)
Recommendations
- Scheduling in-house transport vehicles to feed parts to automotive assembly lines
- Scheduling just-in-time transport vehicles to feed parts for mixed model assembly lines
- Planning and consolidating shipments from a warehouse
- A new policy for the inventory routing problem
- Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithms for the bin packing problem with conflicts
- Algorithms for the variable sized bin packing problem
- Approximation algorithms for NP-hard problems.
- Cardinality constrained bin-packing problems
- Efficient algorithms for interval graphs and circular-arc graphs
- Heuristic algorithms for the three-dimensional bin packing problem
- Heuristics and lower bounds for the bin packing problem with conflicts
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Lower and upper bounds for the bin packing problem with fragile objects
- New lower bounds for bin packing problems with conflicts
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Symmetric binary B-trees: Data structure and maintenance algorithms
Cited in
(2)
This page was built for publication: Vehicle scheduling under the warehouse-on-wheels policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266928)