Model and algorithm for solving hot strip rolling batch planning problems
From MaRDI portal
Publication:5453344
Recommendations
- scientific article; zbMATH DE number 5829519
- Prize collecting traveling saleman problem based model and algorithm for hot strip rolling unit planning
- Modeling rolling batch planning as vehicle routing problem with time windows.
- A multi-objective hot-rolling scheduling problem in the compact strip production
- The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem
Cited in
(7)- A multi-objective hot-rolling scheduling problem in the compact strip production
- scientific article; zbMATH DE number 5829519 (Why is no real title available?)
- Prize collecting traveling saleman problem based model and algorithm for hot strip rolling unit planning
- LP modelling of the finishing hot rolling programme for low carbon steel coils
- Modeling rolling batch planning as vehicle routing problem with time windows.
- A two-phase algorithm for rolling batch planning based on simulated annealing
- The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem
This page was built for publication: Model and algorithm for solving hot strip rolling batch planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453344)