The lot sizing and scheduling of sand casting operations

We describe a real world case study that involves the monthly planning and scheduling of the sand-casting department in a metal foundry. The problem can be characterised as a single-level multi-item capacitated lot-sizing model with a variety of additional process-specific constraints. The main objective is to smooth production. We present a hierarchical approach, in which we use a combination of mixed integer linear programming, shortest path algorithms, and iterative local improvement. The quality of the production schedules obtained in this way is by far superior to the quality of the schedules constructed by a very expert production planner with no other tool than a plan board. Furthermore, the planning effort is significantly reduced: the manual method requires about 2–3 days, whereas a typical planning session with a prototype decision support system takes no more than half an hour.

[1]  Mwp Martin Savelsbergh,et al.  Behind the screen: DSS from an OR point of view , 1988, Decis. Support Syst..

[2]  Mohan Gopalakrishnan,et al.  A modified framework for modelling set-up carryover in the capacitated lotsizing problem , 2000 .

[3]  C. R. Sox,et al.  The capacitated lot sizing problem with setup carry-over , 1999 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Ondřej Kafka,et al.  Lot-sizing problém , 2011 .

[6]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[7]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[8]  Marc Gravel,et al.  Scheduling jobs in an Alcan aluminium foundry using a genetic algorithm , 2000 .

[9]  Bernardo Almada-Lobo,et al.  Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups , 2010 .

[10]  Kai A. Olsen,et al.  Optimal and heuristic solutions for a scheduling problem arising in a foundry , 2005, Comput. Oper. Res..

[11]  M. G. Korgaonker.  Production Smoothing Under Piecewise Concave Costs, Capacity Constraints and Nondecreasing Requirements , 1977 .

[12]  W. Zangwill.  Production Smoothing of Economic Lot Sizes with Non-Decreasing Requirements , 1966 .

[13]  Alistair R. Clark,et al.  Lot sizing and furnace scheduling in small foundries , 2008, Comput. Oper. Res..

[14]  D. Klabjan,et al.  Single machine multi-product capacitated lot sizing with sequence-dependent setups , 2007 .

[15]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[16]  Ke Ding,et al.  A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover , 2001, Manag. Sci..

[17]  Goutam Dutta,et al.  A Survey of Mathematical Programming Applications in Integrated Steel Plants , 2001, Manuf. Serv. Oper. Manag..

[18]  Elisangela dos Santos-Meza,et al.  Production , Manufacturing and Logistics A lot-sizing problem in an automated foundry , 2002 .

[19]  Zeger Degraeve,et al.  Modeling industrial lot sizing problems: a review , 2008 .

[20]  Markku Kuula,et al.  Multiperiod production planning carrying over set-up time , 2003 .

[21]  David M. Miller,et al.  A framework for modelling setup carryover in the capacitated lot sizing problem , 1995 .

[22]  Diwakar Gupta,et al.  The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times , 2005, Comput. Oper. Res..

[23]  Lixin Tang,et al.  A review of planning and scheduling systems and methods for integrated steel production , 2001, Eur. J. Oper. Res..