Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Abstract A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.

[1]  Alistair Clark,et al.  Optimization approximations for capacity constrained material requirements planning , 2003 .

[2]  Carlo Vercellis,et al.  Tactical models for hierarchical capacitated lot-sizing problems with setups and changeovers , 2000 .

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

[4]  Herbert Meyr,et al.  Simultaneous lotsizing and scheduling by combining local search with dual reoptimization , 2000, Eur. J. Oper. Res..

[5]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[6]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[7]  Rakesh Nagi,et al.  Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs , 2005, Comput. Oper. Res..

[8]  M. Pirlot,et al.  Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem , 1995 .

[9]  Hartmut Stadtler,et al.  The Capacitated Lot-Sizing Problem with Linked Lot Sizes , 2003, Manag. Sci..

[10]  Laurence A. Wolsey,et al.  Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation , 2002, Manag. Sci..

[11]  Laurence A. Wolsey,et al.  Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs , 2001, Manag. Sci..

[12]  Herbert Meyr,et al.  Simultaneous lotsizing and scheduling on parallel machines , 2002, Eur. J. Oper. Res..

[13]  Alistair Clark,et al.  Rolling horizon heuristics for production and setup planning with backlogs and error-prone demand forecasts , 2005 .

[14]  Alf Kimms,et al.  Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling O , 2000 .

[15]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

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

[17]  Larry P. Ritzman,et al.  A model for lot sizing and sequencing in process industries , 1988 .

[18]  A. Clark.  Rolling horizon heuristics for production planning and set-up scheduling with backlogs and error-prone demand forecasts , 2005 .

[19]  Andrea Sianesi,et al.  A heuristic algorithm for master production schedule generation with finite capacity and sequence dependent setups , 1993 .

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

[21]  Patrizia Beraldi,et al.  Scenario-based planning for lot-sizing and scheduling with uncertain processing times , 2006 .

[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]  Hartmut Stadtler,et al.  Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows , 2003, Oper. Res..

[24]  G. Nemhauser,et al.  Integer Programming , 2020 .

[25]  Wu Zhang,et al.  On practical resource allocation for production planning and scheduling with period overlapping setups , 1994 .

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

[27]  Herbert Meyr,et al.  The general lotsizing and scheduling problem , 1997 .

[28]  Alistair R. Clark,et al.  Hybrid heuristics for planning lot setups and sizes , 2003, Comput. Ind. Eng..

[29]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

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

[31]  Marc Salomon,et al.  LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .

[32]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[33]  John L. Mann,et al.  Flowsheet decomposition heuristic for scheduling: a relax-and-fix method , 2004, Comput. Chem. Eng..

[34]  Dwight E. Smith-Daniels,et al.  A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries , 1986 .

[35]  Alistair Clark.  Hybrid heuristics for planning lot sizes and setups , 2003 .