A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems

Abstract The batch production smoothing problem (BPSP) aims at finding appropriate batch sizes for a variety of products and sequencing the batches in such a way that their appearances are uniformly dispersed over the planning horizon. Extending the previous research work on the BPSP, this paper introduces a bounded dynamic programming (BDP) approach. Computational experiments prove that the BDP approach reduces the computational time needed to solve the problem significantly and allows larger-size problems to be solved within practical times.

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

[2]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[3]  S. Sethi,et al.  A Note on "Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems" , 1991 .

[4]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[5]  A. Chakravarty,et al.  Balancing Mixed Model Lines with In-Process Inventories , 1985 .

[6]  L. V. Wassenhove,et al.  Some extensions of the discrete lotsizing and scheduling problem , 1991 .

[7]  Nick T. Thomopoulos,et al.  Mixed Model Line Balancing with Smoothed Station Assignments , 1970 .

[8]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[9]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[10]  Patrick R. McMullen,et al.  A Kohonen self-organizing map approach to addressing a multiple objective, mixed-model JIT sequencing problem , 2001 .

[11]  Mike Wright,et al.  Experiments with a strategic oscillation algorithm for the pallet loading problem , 2001 .

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

[13]  George Steiner,et al.  A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems , 1990 .

[14]  James P. Kelly,et al.  Large-scale controlled rounding using tabu search with strategic oscillation , 1993, Ann. Oper. Res..

[15]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[16]  Patrick R. McMullen,et al.  A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line , 2000 .

[17]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[18]  Patrick R. McMullen,et al.  An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics , 2001 .

[19]  Patrick R. McMullen,et al.  Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups , 2000 .

[20]  Liping Cheng,et al.  A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems , 1993, Oper. Res. Lett..

[21]  J. Miltenberg,et al.  Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .

[22]  J. L. C. Macaskill,et al.  Production-Line Balances for Mixed-Model Lines , 1972 .

[23]  Uday S. Karmarkar,et al.  The Deterministic Dynamic Product Cycling Problem , 1985, Oper. Res..

[24]  José Luis González Velarde,et al.  Computing Tools for Modeling, Optimization and Simulation , 2000 .

[25]  Patrick R. McMullen,et al.  JIT sequencing for mixed-model assembly lines with setups using Tabu Search , 1998 .

[26]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[27]  Nick T. Thomopoulos,et al.  Line Balancing-Sequencing for Mixed-Model Assembly , 1967 .

[28]  Ezey M. Dar-El,et al.  Assembly line sequencing for model mix , 1975 .

[29]  Patrick R. McMullen,et al.  An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives , 2001, Artif. Intell. Eng..

[30]  A. Drexl,et al.  Proportional lotsizing and scheduling , 1995 .

[31]  Ezey M. Dar-El,et al.  Optimal planning and scheduling of assembly lines , 1988 .

[32]  P. McMullen,et al.  A beam search heuristic method for mixed-model scheduling with setups , 2005 .