IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v58y2021i3d10.1007_s12597-020-00489-y.html
   My bibliography  Save this article

Solving a bi-objective mixed-model assembly-line sequencing using metaheuristic algorithms considering ergonomic factors, customer behavior, and periodic maintenance

Author

Listed:
  • Masoud Rabbani

    (University of Tehran)

  • Mahdi Mokhtarzadeh

    (University of Tehran)

  • Neda Manavizadeh

    (KHATAM University)

  • Azadeh Farsi

    (University of Tehran)

Abstract

In today’s competitive world, companies must maintain their customers and attract new ones. Hence, they paid a great attention paid to mixed model assembly lines (MMAL). In this study, a two-step framework was developed to investigate and optimize customer relationships and the sequence of orders in an MMAL. First, based on customers past behavior, they were grouped into three clusters with high, normal, and low priority. Then, an optimal sequence was defined using a mathematical model. The objectives of the sequence were maximizing, first, the satisfaction of customers with high priority and, second, profits. Moreover, orders for low priority customers could be rejected. A multi-objective tabu search algorithm was proposed to solve the sequencing problem and then compared with non-dominated sorting genetic algorithm II and multi objective simulated annealing. The results indicated that this new algorithm is superior to others. We also developed an algorithm for the integration of periodic maintenance with sequencing of orders. The results suggested that the lack of this integration causes non-optimal sequences.

Suggested Citation

  • Masoud Rabbani & Mahdi Mokhtarzadeh & Neda Manavizadeh & Azadeh Farsi, 2021. "Solving a bi-objective mixed-model assembly-line sequencing using metaheuristic algorithms considering ergonomic factors, customer behavior, and periodic maintenance," OPSEARCH, Springer;Operational Research Society of India, vol. 58(3), pages 513-539, September.
    • Handle: RePEc:spr:opsear:v:58:y:2021:i:3:d:10.1007_s12597-020-00489-y
    DOI: 10.1007/s12597-020-00489-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-020-00489-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-020-00489-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pâmela M.C. Cortez & Alysson M. Costa, 2015. "Sequencing mixed-model assembly lines operating with a heterogeneous workforce," International Journal of Production Research, Taylor & Francis Journals, vol. 53(11), pages 3419-3432, June.
    2. Baoxi Wang & Zailin Guan & Saif Ullah & Xianhao Xu & Zongdong He, 2017. "Simultaneous order scheduling and mixed-model sequencing in assemble-to-order production environment: a multi-objective hybrid artificial bee colony algorithm," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 419-436, February.
    3. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    4. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    5. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    6. Akyildiz, Burcu & Kadaifci, Cigdem & Topcu, Ilker, 2015. "A decision framework proposal for customer order prioritization: A case study for a structural steel company," International Journal of Production Economics, Elsevier, vol. 169(C), pages 21-30.
    7. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    8. Parames Chutima & Sathaporn Olarnviwatchai, 2018. "A multi-objective car sequencing problem on two-sided assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1617-1636, October.
    9. Ivan Kristianto Singgih & Onyu Yu & Byung-In Kim & Jeongin Koo & Seungdoe Lee, 2020. "Production scheduling problem in a factory of automobile component primer painting," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1483-1496, August.
    10. H. Mosadegh & S.M.T. Fatemi Ghomi & G.A. Süer, 2017. "Heuristic approaches for mixed-model sequencing problem with stochastic processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2857-2880, May.
    11. Xiaoyi Deng, 2013. "An Efficient Hybrid Artificial Bee Colony Algorithm for Customer Segmentation in Mobile E-commerce," Journal of Electronic Commerce in Organizations (JECO), IGI Global, vol. 11(2), pages 53-63, April.
    12. Rezaei, Jafar, 2015. "Best-worst multi-criteria decision-making method," Omega, Elsevier, vol. 53(C), pages 49-57.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    2. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    3. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    4. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    5. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    6. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    7. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    8. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    9. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    10. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    11. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    12. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    13. Daniel O’Malley & Velimir V Vesselinov & Boian S Alexandrov & Ludmil B Alexandrov, 2018. "Nonnegative/Binary matrix factorization with a D-Wave quantum annealer," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-12, December.
    14. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    15. C-H Lan & C-C Chen, 2007. "Optimal purchase of two-itemized drugs for a disease," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 309-316, March.
    16. G Lulli & U Pietropaoli & N Ricciardi, 2011. "Service network design for freight railway transportation: the Italian case," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2107-2119, December.
    17. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
    18. Ouzineb, Mohamed & Nourelfath, Mustapha & Gendreau, Michel, 2008. "Tabu search for the redundancy allocation problem of homogenous series–parallel multi-state systems," Reliability Engineering and System Safety, Elsevier, vol. 93(8), pages 1257-1272.
    19. İlker Küçükoğlu & Nursel Öztürk, 2019. "A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking," Journal of Intelligent Manufacturing, Springer, vol. 30(8), pages 2927-2943, December.
    20. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:58:y:2021:i:3:d:10.1007_s12597-020-00489-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.