Lot sizing and furnace scheduling in small foundries

作     者：de Araujo, Silvio A. Arenales, Marcos N. Clark, Alistair R. 

作者机构：Univ W England Fac Comp Engn & Math Sci Bristol BS16 1QY Avon England Univ Sao Paulo Dept Matemat Aplicada & Estatist Inst Ciencias Matemat & Computacao BR-13560970 Sao Carlos SP Brazil Univ Estadual Paulista Dept Ciencias Computacao Inst Biociencias Letras & Ciencias Exatas BR-15054000 Sao Jose Do Rio Preto SP Brazil 

出 版 物：《COMPUTERS & OPERATIONS RESEARCH》 (计算机与运筹学研究)

年 卷 期：2008年第35卷第3期

页      面：916-932页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Research Council, NRC Conselho Nacional de Desenvolvimento Científico e Tecnológico, CNPq 

主　　题：lot sizing and scheduling meta-heuristics mixed integer programming 

摘      要：A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry s own practice. (c) 2006 Elsevier Ltd. All rights reserved.