A segmentation approach for solving buffer allocation problems in large production systems

International Journal of Production Research

Volumn 54, Issue 20, 2016, Pages 6121-6141

  Shi, Chuan ^a   Gershwin, Stanley B ^a  

^a USA   (United States)

Author keywords

buffer allocation; finite buffers; production line; profit rate maximisation; segmentation; unreliable machines

Indexed keywords

IMAGE SEGMENTATION; NUMERICAL METHODS; PROFITABILITY;

BUFFER ALLOCATION; FINITE BUFFER; PRODUCTION LINE; PROFIT RATE; UNRELIABLE MACHINE;

OPTIMIZATION;

EID: 84918507559     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2014.991842     Document Type: Article

References (50)

1. W.Abdul-Kader, O.Ganjavi, and F.Baki. 2011. “A Nonlinear Model for Optimizing the Performance of a Multi-product Production Line.” International Transactions in Operational Research 18:561–577.
2. A.Alfieri, and A.Matta. 2012. “Mathematical Programming Formulations for Approximate Simulation of Multistage Production Systems.” European Journal of Operational Research 219 (3):773–783.
3. A.Alfieri, and A.Matta. 2013. “Mathematical Programming Time-based Decomposition Algorithm for Discrete Event Simulation.” European Journal of Operational Research 231 (3):557–566.
4. G.Alon, D.Kroese, T.Raviv, and R.Rubinstein. 2005. “Application of the Cross-entropy Method to the Buffer Allocation Problem in a Simulation-based Environment.” Annals of Operations Research 134 (1):137–151.
5. J.F.Benders, 1962. “Partitioning Procedures for Solving Mixed-variables Programming Problems.” Numerische Mathematik 4 (1):238–252.
6. A.A.Bulgak, 2006. “Analysis and Design of Split and Merge Unpaced Assembly Systems by Metamodelling and Stochastic Search.” International Journal of Production Research 44 (18--19):4067–4080.
7. M.Colledani, M.Ekvall, T.Lundholm, P.Moriggi, A.Polato, and T.Tolio. 2010. “Analytical Methods to Support Continuous Improvements at Scania.” International Journal of Production Research 48 (7):1913–1945.
8. M.Colledani, M.Matta, T.Grasso, and T.Tolio. 2003. “A New Analytical Method for Optimal Buffer Space Allocation in Production Lines.” In 37 CIRP International Seminar on Manufacturing Systems, 231–237. Budapest.
9. M.Colledani, and T.Tolio. 2005. “An Analytical Method for Optimal Buffer Capacity Allocation in Production Systems.” In AITEM Conference. Lecce.
10. L.Demir, S.Tunali, and D.Eliiyi. 2012. “An Adaptive Tabu Search Approach for Buffer Allocation Problem in Unreliable Non-homegenous Production Lines.” Computers & Operations Research 39 (7):1477–1486.
11. L.Demir, S.Tunali, and D.Eliiyi. 2014. “The State of the Art on Buffer Allocation Problem:A Comprehensive Survey.” Journal of Intelligent Manufacturing 25 (3):371–392.
12. L.Demir, S.Tunali, and A.Lokketangen. 2011. “A Tabu Search Approach for Buffer Allocation in Production Lines with Unreliable Machines.” Engineering Optimization 43 (2):213–231.
13. A.C.Diamantidis, and C.T.Papadopoulos. 2004. “A Dynamic Programming Algorithm for the Buffer Allocation Problem in Homogeneous Asymptotically Reliable Serial Production Lines.” Mathematical Problems in Engineering 2004 (3):209–223.
14. A.Dolgui, A.Eremeev, A.Kolokolov, and V.Sigaev. 2002. “A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines.” Journal of Mathematical Modelling and Algorithms 1 (2):89–104.
15. A.Dolgui, A.Eremeev, and V.Sigaev. 2007. Journal of Intelligent Manufacturing 18 (3):411–420.
16. E.Enginarlar, J.Li, and S.M.Meerkov. 2005. “How Lean Can Lean Buffers Be?” IIE Transactions 37 (4):333–342.
17. S.B.Gershwin, 1987. “An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking.” Operations Research 35 (2):291–305.
18. S.B.Gershwin,. 1994. Manufacturing Systems Engineering. Prentice-Hall. Currently available at http://home.comcast.net/~hierarchy/MSE/mse.html. For corrections, see http://home.comcast.net/~hierarchy/MSE/mse.html.
19. S.B.Gershwin, 2011. “Case Generation for Algorithm Testing.” In VIII Conference on Stochastic Models of Manufacturing and Service Operations, 193–200. Ku\c{s}adas{\i}, Turkey.
20. S.B.Gershwin, and J.E.Schor. 2000. “Efficient Algorithms for Buffer Space Allocation.” Annals of Operations Research 93:117–144.
21. S.Helber, 2001. “Cash-flow-oriented Buffer Allocation in Stochastic Flow Lines.” International Journal of Production Research 39 (14):3061–3083.
22. M.Hillier, 2000. “Characterizing the Optimal Allocation of Storage Space in Production Line Systems with Variable Processing Times.” IIE Transactions 32 (1):1–8.
23. M.-G.Huang, P.-L.Chang, and Y.-C.Chou. 2002. “Buffer Allocation in Flow-shop-type Production Systems with General Arrival and Service Patterns.” Computer & Operations Research 29 (2):103–121.
24. R.Levantesi, A.Matta, and T.Tolio. 2001. “A New Algorithm for Buffer Allocation in Production Lines.” In The Third Aegean International Conference on Design and Analysis of Manufacturing Systems. Tinos Island, Greece.
25. J.D.C.Little, 1961. “A Proof of the Queueing Formula L = λW.” Operations Research 9:383–387.
26. C.M.Lutz, K.Roscoe Davis, and M.Sun. 1998. “Determining Buffer Location and Size in Production Lines Using Tabu Search.” European Journal of Operational Research 106 (2--3):301–316.
27. Y.Massim, F.Yalaoui, L.Amodeo, A.Yalaoui, and A.Zeblah. 2010. “Efficient Combined Immune-decomposition Algorithm for Optimal Buffer Allocation in Production Lines for Throughput and Profit Maximization.” Computers & Operations Research 37 (4):611–620.
28. A.Matta,. 2008. “Simulation Optimization with Mathematical Programming Representation of Discrete Event Systems.” In Simulation Conference, WSC 2008. Winter, December 1393–1400. Austin, TX.
29. N.Nahas, D.Ait-Kadi, and M.Nourelfath. 2009. “Selecting Machines and Buffers in Unreliable Series-parallel Production Lines.” International Journal of Production Research 47 (14):3741–3774.
30. M.Nourelfath, N.Nahas, and D.Ait-Kadi. 2005. “Optimal Design of Series Production Lines with Unreliable Machines and Finite Buffers.” Journal of Quality in Maintenance Engineering 11 (2):121–138.
31. C.Papadopoulos, M.O’Kelly, and A.Tsadiras. 2013. “A DSS for the Buffer Allocation of Production Lines Based on a Comparative Evaluation of a Set of Search Algorithms.” International Journal of Production Research 51 (14):4175–4199.
32. T.Park, 1993. “A Two-phase Heuristic Algorithm for Determining Buffer Sizes of Production Lines.” International Journal of Production Research 31 (3):613–631.
33. B.Park, E.Park, B.Choi, B.Kim, and J.Lee. 2008. “Simulation Based Planning and Scheduling System for TFT-LCD Fab.” In Simulation Conference, WSC 2008. Winter, December 2271–2276. Austin, TX.
34. M.Ribeiro, J.Silveira, and R.Qassim. 2007. “Joint Optimisation of Maintenance and Buffer Size in a Manufacturing System.” European Journal of Operational Research 176 (1):405–413.
35. I.Sabuncuoglu, E.Erel, and Y.Gocgun. 2006. “Analysis of Serial Production Lines:Characterization Study and a New Heuristic Procedure for Optimal Buffer Allocation.” International Journal of Production Research 44 (13):2499–2523.
36. J.E.Schor,. 1995. “Efficient algorithms for buffer allocation.” Master’s Thesis. Massachusetts Institute of Technology. Also available as MIT Laboratory for Manufacturing and Productivity report LMP-95-006.
37. D.Seong, S.Y.Chang, and Y.Hong. 1994. “An Algorithm for Buffer Allocation with Linear Resource Constraints in a Continuous Flow Production Line.” Technical Report IE-TR-94-05. Department of Industrial Engineering, POSTECH, Korea.
38. D.Seong, Y.Chang, and Y.Hong. 2000. “An Algorithm for Buffer Allocation with Linear Resource Constraints in a Continuous-flow Unreliable Production Line.” Asia-Pacific Journal of Operational Research 17:169–180.
39. C.Shi, and S.B.Gershwin. 2009. “An Efficient Buffer Design Algorithm for Production Line Profit Maximization.” International Journal of Production Economics 122 (2):725–740.
40. J.M.Smith, F.Cruz, and T.van Woensel. 2010. “Topological Network Design of General, Finite, Multi-server Queueing Networks.” European Journal of Operational Research 201 (2):427–441.
41. D.Spinellis, and C.Papadopoulos. 2000. “A Simulated Annealing Approach for Buffer Allocation in Reliable Production Lines.” Annals of Operations Research 93 (1--4):373–384.
42. D.Spinellis, C.Papadopoulos, and J.M.Smith. 2000. “Large Production Line Optimization Using Simulated Annealing.” International Journal of Production Research 38 (3):509–541.
43. H.Tempelmeier, 2003. “Practical Considerations in the Optimization of Flow Production Systems.” International Journal of Production Research 41 (1):149–170.
44. H.Toba,. 2005. “A Tight Flow Control for Job-shop Fabrication Lines with Finite Buffers.” IEEE Transactions on Automation Science and Engineering 2 (1):78–83.
45. T.Tolio, M.Colledani, and D.Borgh. 2009. “An Analytical Method for the Optimal Design of Buffers in Asynchronous Transfer Lines.” In VII Conference on Stochastic Models of Manufacturing and Service Operations, 225–232. Ostuni, Italy.
46. T.Van Woensel, R.Andriansyah, F.R.B.Cruz, J.M.Smith, and L.Kerbache. 2010. “Buffer and Server Allocation in General Multi-server Queueing Networks.” International Transactions in Operational Research 17:257–286.
47. S.Weiss, and R.Stolletz. 2013a. “A Benders Decomposition Approach for the Optimization of Flow Lines with Stochastic Processing Times.” https://ub-madoc.bib.uni-mannheim.de/35855/.
48. S.Weiss, and R.Stolletz. 2013b. “First Results On:A Benders Decomposition Approach for the Optimization of Flow Lines with Stochastic Processing Times.” In The 9th International Conference on Stochastic Models of Manufacturing and Service Operations, 247–254. Kloster Seeon.
49. H.Yamashita, and T.Altiok. 1998. “Buffer Capacity Allocation for a Desired Throughput in Production Lines.” IIE Transactions 30 (10):883–892.
50. T.Yang, C.-H.Hsieh, and B.-Y.Cheng. 2011. “Lean-pull Strategy in a Re-entrant Manufacturing Environment:A Pilot Study for TFT-LCD Array Manufacturing.” International Journal of Production Research 49 (6):1511–1529.