Title

Iterated Local Search for Foundry Lotsizing and Scheduling Problem with Setup Costs

Journal title

Archives of Foundry Engineering

Yearbook

2017

Volume

vol. 17

Issue

No 4

Authors

Stawowy, A. ; Duda, J.

Keywords

Application of information technology to the foundry industry ; Scheduling ; Production planning ; Local search heuristics

Divisions of PAS

Nauki Techniczne

Publisher

The Katowice Branch of the Polish Academy of Sciences

Date

2017

Type

Artykuły / Articles

Identifier

DOI: 10.1515/afe-2017-0150 ; ISSN 2299-2944

Source

Archives of Foundry Engineering; 2017; vol. 17; No 4

References

Karimi (2003), The capacitated lot sizing problem a of models and algorithms Omega http dx doi org, review, 31, 365, doi.org/10.1016/S0305-0483(03)00059-8 ; Guner (2010), Jans of applications of genetic algorithms in lot sizing of http dx org, review Journal Intelligent Manufacturing, 21, 575, doi.org/10.1007/s10845-008-0205-2 ; Basiura (null), Production scheduling for the one furnace - two casting lines system of Foundry spec, Archives Engineering, 15, 2015. ; Kande (null), Multi - start Iterated Local Search for two - echelon distribution network for perishable products Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume, null, 2015. ; Araujo (2008), de Lot sizing and furnace scheduling in small foundries, Computers Operations Research, 35, 1, doi.org/10.1016/j.cor.2006.05.010 ; Stawowy (2017), Coordinated production planning problem in a foundry of Foundry, Archives Engineering, 17, 133. ; Li (2017), production planning model for make - to - order foundry flow shop with capacity constraint Problems in pages, Mathematical Engineering, 15, doi.org/10.1155/2017/6315613 ; Degraeve (2007), Jans - heuristics for dynamic lot sizing a and comparison of solution approaches, Meta review European Journal of Operational Research, 177, doi.org/10.1016/j.ejor.2005.12.008

Open Access Policy

Archives of Foundry Engineering is an open access journal with all content available with no charge in full text version.
The journal content is available under the Creative Commons Attribution 4.0 International License ( http://creativecommons.org/licenses/by/4.0/).