Affordable Access

Lot sizing and furnace scheduling in small foundries

Authors
Publication Date
Source
Repositório Institucional UNESP
Keywords
  • Lot Sizing And Scheduling
  • Meta-Heuristics
  • Mixed Integer Programming
  • Heuristic Algorithms
  • Integer Programming
  • Metadata
  • Problem Solving
  • Tabu Search
  • Metaheuristics
  • Scheduling
External links

Abstract

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) 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. © 2006 Elsevier Ltd. All rights reserved.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments
F