IDEAS home Printed from https://ideas.repec.org/a/inm/orited/v23y2023i3p179-195.html
   My bibliography  Save this article

Multiobjective Line Balancing Game: Collaboration and Peer Evaluation

Author

Listed:
  • Taher Ahmadi

    (Center for Marketing & Supply Chain Management, Nyenrode Business University, 3621 BG Breukelen, Netherlands; Department of Industrial Engineering and Innovation Sciences, Eindhoven University of Technology, 5612 AZ Eindhoven, Netherlands)

  • Bo van der Rhee

    (Center for Marketing & Supply Chain Management, Nyenrode Business University, 3621 BG Breukelen, Netherlands;)

Abstract

We introduce a spreadsheet-based game, the multiobjective line balancing (MOLB) game, to teach assembly line balancing as a common topic of discussion in operations research, operations management, supply chain management, or management science courses at the undergraduate or graduate level. The MOLB game was designed based on the triple bottom line framework, in which the economic, social, and environmental aspects of line balancing decisions are simultaneously taken into account. The MOLB game can be played in teams of three or four students. First, each team receives unique information for balancing an assembly line. Each team should find as many feasible balances as possible in a collaborative form and then send the Pareto solution set and the best found solution to a peer team. In the second round of the game, the teams assess the results of a peer team first by trying to find infeasible or non-Pareto solutions and second by attempting to improve on the provided solutions. Finally, the reviewer team presents the results of the peer-review process to the entire class.

Suggested Citation

  • Taher Ahmadi & Bo van der Rhee, 2023. "Multiobjective Line Balancing Game: Collaboration and Peer Evaluation," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 179-195, May.
    • Handle: RePEc:inm:orited:v:23:y:2023:i:3:p:179-195
    DOI: 10.1287/ited.2022.0277
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ited.2022.0277
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ited.2022.0277?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
    ---><---

    References listed on IDEAS

    as
    1. Pape, Tom, 2015. "Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements," European Journal of Operational Research, Elsevier, vol. 240(1), pages 32-42.
    2. Serena Finco & Daria Battini & Xavier Delorme & Alessandro Persona & Fabio Sgarbossa, 2020. "Workers’ rest allowance and smoothing of the workload in assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 58(4), pages 1255-1270, February.
    3. Howard J. Weiss, 2013. "Teaching Note ---Implementing Line Balancing Heuristics in Spreadsheets," INFORMS Transactions on Education, INFORMS, vol. 13(2), pages 114-125, January.
    4. Brent Snider & Nancy Southin & Sherry Weaver, 2017. "Student Peer Evaluated Line Balancing Competition," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 43-48, January.
    5. Nan Kong, 2019. "Active Game‐Based Learning of Dynamics Modeling and Simulation in Biomedical Systems Engineering," INFORMS Transactions on Education, INFORMS, vol. 20(1), pages 16-25, September.
    6. Cliff T. Ragsdale & Evelyn C. Brown, 2004. "On Modeling Line Balancing Problems in Spreadsheets," INFORMS Transactions on Education, INFORMS, vol. 4(2), pages 45-48, January.
    7. Maureen P. Lojo, 2016. "Improving Undergraduate Student Performance on the Littlefield Simulation," INFORMS Transactions on Education, INFORMS, vol. 16(2), pages 54-59, January.
    8. John F. Wellington & Stephen A. Lewis, 2018. "Interactive Excel-Based Procedure for Line Balancing," INFORMS Transactions on Education, INFORMS, vol. 19(1), pages 23-35, September.
    9. Tianjun Feng & L. Robin Keller & Xiaona Zheng, 2008. "Modeling Multi-Objective Multi-Stakeholder Decisions: A Case-Exercise Approach," INFORMS Transactions on Education, INFORMS, vol. 8(3), pages 103-114, May.
    10. Brent Snider & Jaydeep Balakrishnan, 2013. "Lessons Learned from Implementing Web-Based Simulations to Teach Operations Management Concepts," INFORMS Transactions on Education, INFORMS, vol. 13(3), pages 152-161, May.
    11. Zeleny, Milan, 1986. "Optimal system design with multiple criteria: De Novo programming approach," Engineering Costs and Production Economics, Elsevier, vol. 10(2), pages 89-94, June.
    12. Figueira, J.R. & Liefooghe, A. & Talbi, E.-G. & Wierzbicki, A.P., 2010. "A parallel multiple reference point approach for multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 205(2), pages 390-400, September.
    13. F. Brian Talbot & James H. Patterson & William V. Gehrlein, 1986. "A Comparative Evaluation of Heuristic Line Balancing Techniques," Management Science, INFORMS, vol. 32(4), pages 430-454, April.
    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. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    2. John F. Wellington & Stephen A. Lewis, 2018. "Interactive Excel-Based Procedure for Line Balancing," INFORMS Transactions on Education, INFORMS, vol. 19(1), pages 23-35, September.
    3. Maureen P. Lojo, 2016. "Improving Undergraduate Student Performance on the Littlefield Simulation," INFORMS Transactions on Education, INFORMS, vol. 16(2), pages 54-59, January.
    4. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    5. Diefenbach, Johannes & Stolletz, Raik, 2022. "Stochastic assembly line balancing: General bounds and reliability-based branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 302(2), pages 589-605.
    6. Cem P. Cetinkaya & Mert Can Gunacti, 2018. "Multi-Criteria Analysis of Water Allocation Scenarios in a Water Scarce Basin," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(8), pages 2867-2884, June.
    7. Troutt, Marvin D. & Tadisina, Suresh K. & Sohn, Changsoo & Brandyberry, Alan A., 2005. "Linear programming system identification," European Journal of Operational Research, Elsevier, vol. 161(3), pages 663-672, March.
    8. Steuer, Ralph E. & Utz, Sebastian, 2023. "Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing," European Journal of Operational Research, Elsevier, vol. 306(2), pages 742-753.
    9. Li, Zixiang & Kucukkoc, Ibrahim & Zhang, Zikai, 2020. "Branch, bound and remember algorithm for two-sided assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 284(3), pages 896-905.
    10. Daniel M. Frances & Daria Terekhov, 2019. "A Case-Based Undergraduate Operations Research Course," INFORMS Transactions on Education, INFORMS, vol. 19(2), pages 67-80, January.
    11. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    12. Urban, Timothy L. & Chiang, Wen-Chyuan, 2016. "Designing energy-efficient serial production lines: The unpaced synchronous line-balancing problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 789-801.
    13. Anulark Pinnoi & Wilbert E. Wilhelm, 1998. "Assembly System Design: A Branch and Cut Approach," Management Science, INFORMS, vol. 44(1), pages 103-118, January.
    14. Bai, Tian & Feng, Gengzhong & Wu, Meng & Zhu, Stuart X., 2025. "A newsvendor model with multiple reference points: Target-setting for aspirational newsvendors," European Journal of Operational Research, Elsevier, vol. 320(3), pages 655-669.
    15. Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    16. Scholl, Armin & Klein, Robert, 1999. "Balancing assembly lines effectively - A computational comparison," European Journal of Operational Research, Elsevier, vol. 114(1), pages 50-58, April.
    17. Pereira, Jordi & Álvarez-Miranda, Eduardo, 2018. "An exact approach for the robust assembly line balancing problem," Omega, Elsevier, vol. 78(C), pages 85-98.
    18. Amen, Matthias, 2001. "Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time," International Journal of Production Economics, Elsevier, vol. 69(3), pages 255-264, February.
    19. Aase, Gerald R. & Olson, John R. & Schniederjans, Marc J., 2004. "U-shaped assembly line layouts and their impact on labor productivity: An experimental study," European Journal of Operational Research, Elsevier, vol. 156(3), pages 698-711, August.
    20. Sprecher, Arno, 2000. "SALBLIB: Challenging instances for assembly line balancing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 526, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:inm:orited:v:23:y:2023:i:3:p:179-195. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.