961
Views
32
CrossRef citations to date
0
Altmetric
Articles

A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace

, &
Pages 643-661 | Received 14 Dec 2016, Accepted 25 Apr 2018, Published online: 13 Aug 2018

References

  • Akpinar, S., and A. Baykaso. 2014. “Modeling and Solving Mixed-Model Assembly Line Balancing Problem with Setups. Part I: A Mixed Integer Linear Programming Model.” Journal of Manufacturing Systems 33: 177–187. doi: 10.1016/j.jmsy.2013.11.004
  • Alavian, P., P. Denno, and S. M. Meerkov. 2017. “Multi-job Production Systems: Definition, Problems, and Product-mix Performance Portrait of Serial Lines.” International Journal of Production Research 55: 7276–7301. doi: 10.1080/00207543.2017.1338779
  • Andrés, C., C. Miralles, and R. Pastor. 2008. “Balancing and Scheduling Tasks in Assembly Lines with Sequence-Dependent Setup Times.” European Journal of Operational Research 187: 1212–1223. doi: 10.1016/j.ejor.2006.07.044
  • Arslan, O., and O. E. Karaşan. 2016. “A Benders Decomposition Approach for the Charging Station Location Problem with Plug-in Hybrid Electric Vehicles.” Transportation Research Part B: Methodological 93: 670–695. doi: 10.1016/j.trb.2016.09.001
  • Battaïa, O., X. Delorme, A. Dolgui, S. Malyutin, A. Horlemann, and S. Kovalev. 2015. “Workforce Minimization for a Mixed-model Assembly Line in the Automotive Industry.” International Journal of Production Economics 170: 489–500. doi: 10.1016/j.ijpe.2015.05.038
  • Baybars, I. 1986. “A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem.” Management Science 32: 909–932. doi: 10.1287/mnsc.32.8.909
  • Benders, J. F. 1962. “Partitioning Procedures for Solving Mixed-variables Programming Problems.” Numerische Mathematik 4 (1): 238–252. doi: 10.1007/BF01386316
  • Bortolini, M., M. Faccio, M. Gamberi, and F. Pilati. 2017. “Multi-objective Assembly Line Balancing Considering Component Picking and Ergonomic Risk.” Computers and Industrial Engineering 112: 348–367. doi: 10.1016/j.cie.2017.08.029
  • Bowman, E. H. 1960. “Assembly Line Balancing by Linear Programming.” Operations Research 8: 385–389. doi: 10.1287/opre.8.3.385
  • Calleja, G., A. Corominas, A. García-Villoria, and R. Pastor. 2013. “A MILP Model for the Accessibility Windows Assembly Line Balancing Problem (AWALBP).” International Journal of Production Research 51: 3549–3560. doi: 10.1080/00207543.2012.751514
  • Calleja, G., A. Corominas, A. García-Villoria, and R. Pastor. 2014. “Combining Metaheuristics and MILP to Solve the Accessibility Windows Assembly Line Balancing Problem Level 2 (AWALBP-L2).” Computers and Operations Research 48: 113–123. doi: 10.1016/j.cor.2014.03.009
  • Capacho, L., and R. Pastor. 2008. “ASALBP: the Alternative Subgraphs Assembly Line Balancing Problem.” International Journal of Production Research 46 (13): 3503–3516. doi: 10.1080/00207540701197010
  • Chen, J. C., C. C. Chen, L. H. Su, H. B. Wu, and C. J. Sun. 2012. “Assembly Line Balancing in Garment Industry.” Expert Systems with Applications 39 (11): 10073–10081. doi: 10.1016/j.eswa.2012.02.055
  • Corominas, A., R. Pastor, and J. Plans. 2008. “Balancing Assembly Line with Skilled and Unskilled Workers.” OMEGA The International Journal of Management Science 36: 1126–1132. doi: 10.1016/j.omega.2006.03.003
  • Delorme, M., M. Iori, and S. Martello. 2017. “Logic Based Benders’ Decomposition for Orthogonal Stock Cutting Problems.” Computers and Operations Research 78: 290–298. doi: 10.1016/j.cor.2016.09.009
  • Dimitriadis, S. G. 2006. “Assembly Line Balancing and Group Working: A Heuristic Procedure for Workers” Groups Operating on the Same Product and Workstation.” Computers and Operations Research 33: 2757–2774. doi: 10.1016/j.cor.2005.02.027
  • Dolgui, A., S. Kovalev, M. Y. Kovalyov, S. Malyutin, and A. Soukhal. 2018. “Optimal Workforce Assignment to Operations of a Paced Assembly Line.” European Journal of Operational Research 264: 200–211. doi: 10.1016/j.ejor.2017.06.017
  • Esmaeilbeigi, R., B. Naderi, and P. Charkhgard. 2015. “The Type e Simple Assembly Line Balancing Problem: A Mixed Integer Linear Programming Formulation.” Computers and Operations Research 64: 168–177. doi: 10.1016/j.cor.2015.05.017
  • Faccio, M., M. Gamberi, F. Pilati, and M. Bortolini. 2015. “Packaging Strategy Definition for Sales Kits Within an Assembly System.” International Journal of Production Research 53 (11): 3288–3305. doi: 10.1080/00207543.2014.975862
  • Fakhri, A., and M. Ghatee. 2016. “Application of Benders Decomposition Method in Solution of a Fixed-Charge Multicommodity Network Design Problem Avoiding Congestion.” Applied Mathematical Modelling 40: 6468–6476. doi: 10.1016/j.apm.2016.01.057
  • Fattahi, P., A. Roshani, and A. Roshani. 2011. “A Mathematical Model and ant Colony Algorithm for Multi-Manned Assembly Line Balancing Problem.” International Journal of Advanced Manufacturing Technology 53: 363–378. doi: 10.1007/s00170-010-2832-y
  • Fredriksson, A., C. Wänström, M. I. Johansson, and L. Medbo. 2015. “A Structured Procedure for Materials Planning During Production Transfer.” Production Planning and Control 26 (9): 738–752. doi: 10.1080/09537287.2014.971534
  • Gokcen, H., K. Agpak, and R. Benzer. 2006. “Balancing of Parallel Assembly Lines.” International Journal of Production Economics 103: 600–609. doi: 10.1016/j.ijpe.2005.12.001
  • Gokcen, H., and E. Erel. 1997. “Binary Integer Formulation for Mixed-Model Assembly Line Balancing Problem.” Computers and Industrial Engineering 34 (2): 451–461. doi: 10.1016/S0360-8352(97)00142-3
  • Gutjahr, A. L., and G. L. Nemhauser. 1964. “An Algorithm for the Line Balancing Problem.” Management Science 11: 308–315. doi: 10.1287/mnsc.11.2.308
  • Hanson, R., and L. Medbo. 2016. “Aspects Influencing Man-Hour Efficiency of kit Preparation for Mixed-Model Assembly.” Procedia CIRP 44: 353–358. doi: 10.1016/j.procir.2016.02.064
  • Jackson, J. R. 1956. “A Computing Procedure for a Line Balancing Problem.” Management Science 2: 261–272. doi: 10.1287/mnsc.2.3.261
  • Kellegöz, T. 2016. “Assembly Line Balancing Problems with Multi-Manned Stations: A New Mathematical Formulation and Gantt Based Heuristic Method.” Annals of Operations Research. doi:10.1007/s10479-016-2156-x.
  • Keyvanshokooh, E., S. M. Ryan, and E. Kabir. 2016. Hybrid Robust and Stochastic Optimization for Closed-Loop Supply Chain Network Design Using Accelerated Benders’ Decomposition.” European Journal of Operational Research 249: 76–92. doi: 10.1016/j.ejor.2015.08.028
  • Kim, Y. K., W. S. Song, and J. H. Kim. 2009. “A Mathematical Model and a Genetic Algorithm for Two-sided Assembly Line Balancing.” Computers and Operations Research 36: 853–865. doi: 10.1016/j.cor.2007.11.003
  • Lapierre, S. D., and A. B. Ruiz. 2004. “Balancing Assembly Lines: An Industrial Case Study.” The Journal of the Operational Research Society 55 (6): 589–597. doi: 10.1057/palgrave.jors.2601708
  • Makui, A., M. Heydari, A. Aazami, and E. Dehghani. 2016. “Accelerating Benders Decomposition Approach for Robust Aggregate Production Planning of Products with a Very Limited Expiration Date.” Computers and Industrial Engineering 100: 34–51. doi: 10.1016/j.cie.2016.08.005
  • Moreira, M. C. O., R. Pastor, A. M. Costa, and C. Miralles. 2017. “The Multi-Objective Assembly Line Worker Integration and Balancing Problem of Type-2.” Computers and Operations Research 82: 114–125. doi: 10.1016/j.cor.2017.01.003
  • Moussavi, S. E., M. Mahdjoub, and O. Grunder. 2017. “Productivity Improvement Through a Sequencing Generalised Assignment in an Assembly Line System.” International Journal of Production Research 55: 7509–7523. doi: 10.1080/00207543.2017.1378828
  • Nakade, K. 2017. “Effect of Worker Sequence on Cycle Time in a U-Shaped Line with Chase Mode.” International Journal of Production Research 55: 2752–2763. doi: 10.1080/00207543.2016.1190472
  • Pastor, R., C. Andrés, A. Durán, and M. Pérez. 2002. “Tabu Search Algorithms for an Industrial Multi-product and Multi-objective Assembly Line Balancing Problem, with Reduction of the Task Dispersion.” Journal of the Operational Research Society 53: 1317–1323. doi: 10.1057/palgrave.jors.2601457
  • Pastor, R., and L. Ferrer. 2009. “An Improved Mathematical Program to Solve the Simple Assembly Line Balancing Problem.” International Journal of Production Research 47 (11): 2943–2959. doi: 10.1080/00207540701713832
  • Pastor, R., A. García-Villoria, and A. Corominas. 2011. “Comparing Ways of Breaking Symmetries in Mathematical Models for SALBP-1.” Assembly Automation 31: 385–387. doi: 10.1108/01445151111172970
  • Patterson, J. H., and J. J. Albracht. 1975. “Assembly Line Balancing: Zero-one Programming with Fibonacci Search.” Operations Research 23: 166–172. doi: 10.1287/opre.23.1.166
  • Pitakaso, R., and K. Sethanan. 2016. “Modified Differential Evolution Algorithm for Simple Assembly Line Balancing with a Limit on the Number of Machine Types.” Engineering Optimization 48 (2): 253–271. doi: 10.1080/0305215X.2015.1005082
  • Polat, O., C. B. Kalayci, Ö. Mutlu, and S. M. Gupta. 2016. “A Two-phase Variable Neighbourhood Search Algorithm for Assembly Line Worker Assignment and Balancing Problem Type-II: An Industrial Case Study.” International Journal of Production Research 54 (3): 722–741. doi: 10.1080/00207543.2015.1055344
  • Rahmanian, R., T. G. Crainic, M. Gendreau, and W. Rei. 2017. “The Benders’ Decomposition Algorithm: A Literature Review.” European Journal of Operational Research 259 (3): 801–817. doi: 10.1016/j.ejor.2016.12.005
  • Riise, A., C. Mannino, and L. Lamorgese. 2016. “Recursive Logic Based Benders’ Decomposition for Multi-mode Outpatient Scheduling.” European Journal of Operational Research 255 (3): 719–728. doi: 10.1016/j.ejor.2016.06.015
  • Roshanaei, V., C. Loung, D. M. Aleman, and D. Urbach. 2016. “Propagating Logic-based Benders” Decomposition Approaches for Distributed Operating Room Scheduling.” European Journal of Operational Research. doi:10.1016/j.ejor.2016.08.024.
  • Saharidis, G. K., M. Boile, and S. Theofanis. 2011. “Initialization of the Benders Master Problem Using Valid Inequalities Applied to Fixed Charge Network Problems.” Expert Systems with Applications 38 (6): 6627–6636. doi: 10.1016/j.eswa.2010.11.075
  • Saharidis, G. K., and M. G. Ierapetritou. 2010. “Improving Benders” Decomposition Using Maximum Feasible Subsystem (MFS) Cut Generation Strategy.” Computers and Chemical Engineering 44: 29–51.
  • Salveson, M. E. 1955. “The Assembly Line Balancing Problem.” Journal of Industrial Engineering 6: 18–25.
  • Sternatz, J. 2014. “Enhanced Multi-Hoffmann Heuristic for Efficiently Solving Real-world Assembly Line Balancing Problems in Automotive Industry.” European Journal of Operational Research 235: 740–754. doi: 10.1016/j.ejor.2013.11.005
  • Talbot, F. B., and J. H. Patterson. 1984. “An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem.” Management Science 30: 85–99. doi: 10.1287/mnsc.30.1.85
  • Tang, L., W. Jiang, and G. K. D. Saharidis. 2013. “An Improved Benders Decomposition Algorithm for the Logistics Facility Location Problem with Capacity Expansions.” Annals of Operations Research 210: 165–190. doi: 10.1007/s10479-011-1050-9
  • Thangavelu, S. R., and C. M. Shetty. 1971. “Assembly Line Balancing by Zero-one Integer Programming.” AIIE Transactions 3: 61–68. doi: 10.1080/05695557108974787
  • White, W. W. 1961. “Comments on a Paper by Bowman.” Operations Research 9: 274–276. doi: 10.1287/opre.9.2.274
  • Wolsey, L. A. 1999. Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience Publication. http://www.nlb.gov.sg/biblio/9034021.
  • Ying, K. C., and Y. J. Tsai. 2017. “Minimising Total Cost for Training and Assigning Multi Skilled Workers in Seru Production Systems.” International Journal of Production Research 55: 2978–2989. doi: 10.1080/00207543.2016.1277594

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.