Multi-plant capacitated lot sizing problem
Published: 4 August 2020| Version 1 | DOI: 10.17632/443wypfr3j.1
Contributors:
Desiree M. Carvalho, Description
The datasets for the papers "Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items", and "A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over", both submitted to the Computers & Operations Research, are available here. Please refer to the file "readme.txt" for information on how to interpret each dataset. The results reported in both papers summarize those presented in the spreadsheets given as a Related Link.
Files
Categories
Operations Research, Combinatorial Optimization, Heuristics, Lot Sizing