Modeling rolling batch planning as vehicle routing problem with time windows.
From MaRDI portal
Recommendations
- Model and algorithm for solving hot strip rolling batch planning problems
- Modeling and application for rolling scheduling problem based on TSP
- A two-phase algorithm for rolling batch planning based on simulated annealing
- Solve the vehicle routing problem with time windows via a genetic algorithm
- scientific article; zbMATH DE number 5829519
Cites work
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exchange Heuristic for Routeing Problems with Time Windows
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- The vehicle routing problem: An overview of exact and approximate algorithms
Cited in
(8)- Development of hybrid evolutionary algorithms for production scheduling of hot strip mill
- Modeling and application for rolling scheduling problem based on TSP
- A two-phase algorithm for rolling batch planning based on simulated annealing
- Structural and extremal properties of the hot rolling batches precedence graph
- An adaptive memory programming method for risk logistics operations
- Model and algorithm for solving hot strip rolling batch planning problems
- An economic order quantity model with completely backordering and nondecreasing demand under two-level trade credit
- Scheduling in a continuous galvanizing line
This page was built for publication: Modeling rolling batch planning as vehicle routing problem with time windows.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406729)