A new method for solving buffer allocation problem in large unbalanced production lines

Solving the buffer allocation problem (BAP) in long production lines is difficult because it is an NP-hard problem. In this paper, we propose a new approach to solve the BAP for long series-parallel unbalanced production lines with the objective of minimising the average work-in-process subject to a throughput rate constraint. Instead of directly optimising a long line, this method decomposes the original long line into several small decoupled subsystems and adds relation condition variables between the subsystems. After several iterations between subsystem optimisation and condition updating, this method can obtain the optimal or near-optimal solution of the original system with a significantly improved computational efficiency. Extensive numerical experiments demonstrate the accuracy and efficiency of this approach. Finally, several examples and a multi-factorial experimental analysis are provided to show the influence of the decomposition strategy, initial values, and parameters of the target systems on the performance of the proposed method.

[1]  Stanley B. Gershwin,et al.  An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking , 1987, Oper. Res..

[2]  J. MacGregor Smith,et al.  The generalized expansion method for open finite queueing networks , 1987 .

[3]  Cong Zhao,et al.  Flexible Serial Lines With Setups: Analysis, Improvement, and Application , 2017, IEEE Robotics and Automation Letters.

[4]  Ying-Chyi Chou,et al.  Buffer allocation in flow-shop-type production systems with general arrival and service patterns , 2002, Comput. Oper. Res..

[5]  Taeho Park,et al.  A two-phase heuristic algorithm for determining buffer sizes of production lines , 1993 .

[6]  Fatih Safa Erenay,et al.  Improving configuration of complex production lines via simulation-based optimization , 2017, Comput. Ind. Eng..

[7]  Guido Lemos de Souza Filho,et al.  Multi-objective performance improvements of general finite single-server queueing networks , 2018, J. Heuristics.

[8]  Deniz Türsel Eliiyi,et al.  The state of the art on buffer allocation problem: a comprehensive survey , 2014, J. Intell. Manuf..

[9]  Stanley B. Gershwin,et al.  Hewlett-Packard Uses Operations Research to Improve the Design of a Printer Production Line , 1998, Interfaces.

[10]  H. T. Papadopoulos,et al.  Optimal buffer storage allocation in balanced reliable production lines , 1998 .

[11]  S. Gershwin,et al.  An Efficient Buffer Design Algorithm for Production Line Profit Maximization , 2009 .

[12]  George Liberopoulos,et al.  Performance evaluation of a production line operated under an echelon buffer policy , 2018, ArXiv.

[13]  C. T. Papadopoulos,et al.  A classification and review of timed Markov models of manufacturing systems , 2019, Comput. Ind. Eng..

[14]  Andrea Matta,et al.  Integrated simulation–optimisation of pull control systems , 2015 .

[15]  Kut C. So Optimal buffer allocation strategy for minimizing work-in-process inventory in unpaced production lines , 1997 .

[16]  Andrea Matta,et al.  Mathematical programming formulations for approximate simulation of multistage production systems , 2012, Eur. J. Oper. Res..

[17]  Stephen G. Powell BUFFER ALLOCATION IN UNBALANCED THREE-STATION SERIAL LINES , 1994 .

[18]  Taho Yang,et al.  Lean-pull strategy in a re-entrant manufacturing environment: a pilot study for TFT-LCD array manufacturing , 2011 .

[19]  Michel Gendreau,et al.  Selecting machines and buffers in unreliable assembly/disassembly manufacturing networks , 2014 .

[20]  Anton V. Eremeev,et al.  HBBA: hybrid algorithm for buffer allocation in tandem production lines , 2007, J. Intell. Manuf..

[21]  Horst Tempelmeier,et al.  Practical considerations in the optimization of flow production systems , 2003 .

[22]  Simone Göttlich,et al.  A continuous buffer allocation model using stochastic processes , 2015, Eur. J. Oper. Res..

[23]  Chrissoleon T. Papadopoulos,et al.  A DSS for the buffer allocation of production lines based on a comparative evaluation of a set of search algorithms , 2013 .

[24]  H. T. Papadopoulos,et al.  A heuristic algorithm for the buffer allocation in unreliable unbalanced production lines , 2001 .

[25]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[26]  Chrissoleon T. Papadopoulos,et al.  A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines , 2004 .

[27]  Alexander Stepanov,et al.  Production , Manufacturing and Logistics Multi-objective evacuation routing in transportation networks , 2009 .

[28]  Zhan-tao Li,et al.  Performance analysis of open general queuing networks with blocking and feedback , 2017 .

[29]  Ihsan Sabuncuoglu,et al.  Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation , 2006 .

[30]  Arne Løkketangen,et al.  A tabu search approach for buffer allocation in production lines with unreliable machines , 2011 .

[31]  Sabry Shaaban,et al.  Influence of unbalanced operation time means and uneven buffer allocation on unreliable merging assembly line efficiency , 2019 .

[32]  Ozcan Kilincci,et al.  Hybrid approach for buffer allocation in open serial production lines , 2015, Comput. Oper. Res..

[33]  Jingshan Li,et al.  Performance evaluation of flow lines with non-identical and unreliable parallel machines and finite buffers , 2020, Int. J. Prod. Res..

[34]  Felix T.S. Chan,et al.  Comparative Evaluations of Buffer Allocation Strategies in a Serial Production Line , 2002 .

[35]  John O. McClain,et al.  A Comment on "Buffer Space Allocation in Automated Assembly Lines" , 1991, Oper. Res..

[36]  Andrea Matta,et al.  A parallel tabu search for solving the primal buffer allocation problem in serial production systems , 2015, Comput. Oper. Res..

[37]  Ernesto Martinez,et al.  Learning and adaptation of a policy for dynamic order acceptance in make-to-order manufacturing , 2010, Comput. Ind. Eng..

[38]  Andrea Matta,et al.  Optimization of buffer allocations in flow lines with limited supply , 2018 .

[39]  James T. Lin,et al.  A hybrid particle swarm optimization with local search for stochastic resource allocation problem , 2018, J. Intell. Manuf..

[40]  H. T. Papadopoulos,et al.  Minimizing WIP inventory in reliable production lines , 2001 .

[41]  Cecil C. Bozarth,et al.  The impact of market requirements focus and manufacturing characteristics focus on plant performance , 1997 .

[42]  Deniz Türsel Eliiyi,et al.  Capacity improvement using simulation optimization approaches: A case study in the thermotechnology industry , 2015 .

[43]  Leyuan Shi,et al.  Optimal buffer allocation in production lines , 2003 .

[44]  S. Gershwin,et al.  A segmentation approach for solving buffer allocation problems in large production systems , 2016 .

[45]  Linda Hendry,et al.  Applying world class manufacturing to make‐to‐order companies: problems and solutions , 1998 .

[46]  Diomidis Spinellis,et al.  Large production line optimization using simulated annealing , 2000 .

[47]  C. T. Papadopoulos,et al.  An artificial neural network based decision support system for solving the buffer allocation problem in reliable production lines , 2013, Comput. Ind. Eng..

[48]  Raik Stolletz,et al.  Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds , 2015, OR Spectr..

[49]  Jianping Dou,et al.  Multi-objective optimization of buffer allocation for remanufacturing system based on TS-NSGAII hybrid algorithm , 2017 .

[50]  James MacGregor Smith,et al.  M/G/c/K blocking probability models and system performance , 2003, Perform. Evaluation.

[51]  James MacGregor Smith,et al.  Buffer Space Allocation in Automated Assembly Lines , 1988, Oper. Res..

[52]  J. F. Benders Partitioning procedures for solving mixed-variables programming problems , 1962 .

[53]  Raik Stolletz,et al.  Buffer Allocation Using Exact Linear Programming Formulations and Sampling Approaches , 2013, MIM.

[54]  Diamantidis C. Alexandros,et al.  Exact analysis of a two-workstation one-buffer flow line with parallel unreliable machines , 2009 .

[55]  Frederick S. Hillier,et al.  Toward characterizing the optimal allocation of storage space in production line systems with variable processing times , 1993 .

[56]  Sooyoung Kim,et al.  Allocation of buffer capacity to minimize average work-in-process , 2001 .

[57]  Tullio Tolio,et al.  Analytical methods to support continuous improvements at Scania , 2010 .

[58]  Stefan Helber,et al.  Using linear programming to analyze and optimize stochastic flow lines , 2011, Ann. Oper. Res..

[59]  F. Cruz,et al.  The buffer allocation problem for general finite buffer queueing networks , 2005 .

[60]  Tayfur Altiok Tandem queues in bulk port operations , 2000, Ann. Oper. Res..

[61]  Stanley B. Gershwin,et al.  Efficient algorithms for buffer space allocation , 2000, Ann. Oper. Res..

[62]  Kai Du,et al.  A fast algorithm for buffer allocation problem , 2016 .

[63]  James MacGregor Smith,et al.  Simultaneous buffer and service rate allocation in open finite queueing networks , 2018 .

[64]  Jingshan Li,et al.  Continuous improvement at Toyota manufacturing plant: applications of production systems engineering methods , 2013 .

[65]  J.-T. Lim,et al.  Homogeneous, asymptotically reliable serial production lines: theory and a case study , 1990 .

[66]  Andrea Matta,et al.  Mathematical programming models for joint simulation–optimization applied to closed queueing networks , 2015, Ann. Oper. Res..

[67]  M. I. Vidalis,et al.  Exact analysis of a discrete material three-station one-buffer merge system with unreliable machines , 2004 .