IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v47y2017i2p163-174.html
   My bibliography  Save this article

Optimizing Student Team and Job Assignments for the Holy Family Academy

Author

Listed:
  • Sharan Srinivas

    (The Pennsylvania State University, University Park, Pennsylvania 16802)

  • Mohammadmahdi Alizadeh

    (The Pennsylvania State University, University Park, Pennsylvania 16802)

  • Nathaniel D.Bastian

    (The Pennsylvania State University, University Park, Pennsylvania 16802)

Abstract

Holy Family Academy (HFA) is a private Catholic high school in which funding for students is provided largely by organizations, many of whom sponsor work-study positions for students. Each student must work one day per week. HFA seeks to group its students into teams based on the day of work-study and then assign students to specific jobs. We develop weighted mixed-integer linear goal-programming models as a means of decision support for HFA to assign students to teams for each school year, and to assign each student on each team to a job. The models increase the transparency of student assignments for HFA administrators, while effectively determining well-balanced, diversified student team and job assignments. The decision support tool provides tremendous value to HFA in terms of time and reproducibility, requiring only minutes to solve, rather than weeks. This enables HFA to conduct quick what-if analyses, such as varying the number of students assigned to each team, a task that was impossible to perform manually.

Suggested Citation

  • Sharan Srinivas & Mohammadmahdi Alizadeh & Nathaniel D.Bastian, 2017. "Optimizing Student Team and Job Assignments for the Holy Family Academy," Interfaces, INFORMS, vol. 47(2), pages 163-174, April.
    • Handle: RePEc:inm:orinte:v:47:y:2017:i:2:p:163-174
    DOI: 10.1287/inte.2016.0868
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/inte.2016.0868
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2016.0868?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. K R Baker & S G Powell, 2002. "Methods for assigning students to groups: a study of alternative objective functions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(4), pages 397-404, April.
    2. E. S. Bres & D. Burns & A. Charnes & W. W. Cooper, 1980. "A Goal Programming Model for Planning Officer Accessions," Management Science, INFORMS, vol. 26(8), pages 773-783, August.
    3. Armacost, Andrew P. & Lowe, James K., 2005. "Decision support for the career field selection process at the US Air Force Academy," European Journal of Operational Research, Elsevier, vol. 160(3), pages 839-850, February.
    4. Dan Shrimpton & Alexandra M. Newman, 2005. "The US Army Uses a Network Optimization Model to Designate Career Fields for Officers," Interfaces, INFORMS, vol. 35(3), pages 230-237, June.
    5. Silverman, Joe & Steuer, Ralph E. & Whisman, Alan W., 1988. "A multi-period, multiple criteria optimization system for manpower planning," European Journal of Operational Research, Elsevier, vol. 34(2), pages 160-170, March.
    6. Gary R. Reeves & Edgar P. Hickman, 1992. "Assigning MBA Students to Field Study Project Teams: A Multicriteria Approach," Interfaces, INFORMS, vol. 22(5), pages 52-58, October.
    7. Lawrence Bodin & Aaron Panken, 2003. "High Tech for a Higher Authority: The Placement of Graduating Rabbis from Hebrew Union College—Jewish Institute of Religion," Interfaces, INFORMS, vol. 33(3), pages 1-11, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schulz, Arne, 2021. "The balanced maximally diverse grouping problem with block constraints," European Journal of Operational Research, Elsevier, vol. 294(1), pages 42-53.

    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. Nathaniel D. Bastian & Pat McMurry & Lawrence V. Fulton & Paul M. Griffin & Shisheng Cui & Thor Hanson & Sharan Srinivas, 2015. "The AMEDD Uses Goal Programming to Optimize Workforce Planning Decisions," Interfaces, INFORMS, vol. 45(4), pages 305-324, August.
    2. Yongjian Li & Jian Chen & Xiaoqiang Cai, 2007. "An integrated staff-sizing approach considering feasibility of scheduling decision," Annals of Operations Research, Springer, vol. 155(1), pages 361-390, November.
    3. Akkan, Can & Erdem Külünk, M. & Koçaş, Cenk, 2016. "Finding robust timetables for project presentations of student teams," European Journal of Operational Research, Elsevier, vol. 249(2), pages 560-576.
    4. Stephen Mahar & Wayne Winston & P. Daniel Wright, 2013. "Eli Lilly and Company Uses Integer Programming to Form Volunteer Teams in Impoverished Countries," Interfaces, INFORMS, vol. 43(3), pages 268-284, May-June.
    5. Oussama Mazari-Abdessameud & Filip Van Utterbeeck & Guy Van Acker & Marie-Anne Guerry, 2020. "Multidimensional military manpower planning based on a career path approach," Operations Management Research, Springer, vol. 13(3), pages 249-263, December.
    6. Dan Shrimpton & Alexandra M. Newman, 2005. "The US Army Uses a Network Optimization Model to Designate Career Fields for Officers," Interfaces, INFORMS, vol. 35(3), pages 230-237, June.
    7. Theresa M. Roeder & Robert M. Saltzman, 2014. "Schedule-Based Group Assignment Using Constraint Programming," INFORMS Transactions on Education, INFORMS, vol. 14(2), pages 63-72, February.
    8. Kayse Lee Maass & Vera Mann Hey Lo & Anna Weiss & Mark S. Daskin, 2015. "Maximizing Diversity in the Engineering Global Leadership Cultural Families," Interfaces, INFORMS, vol. 45(4), pages 293-304, August.
    9. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Boston College Working Papers in Economics 639, Boston College Department of Economics.
    10. José Fernández & Boglárka Tóth, 2009. "Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods," Computational Optimization and Applications, Springer, vol. 42(3), pages 393-419, April.
    11. Sutton, Warren & Dimitrov, Stanko, 2013. "The U.S. Navy explores detailing cost reduction via Data Envelopment Analysis," European Journal of Operational Research, Elsevier, vol. 227(1), pages 166-173.
    12. Kyle Greenberg & Parag A. Pathak & Tayfun Sönmez, 2021. "Redesigning the US Army’s Branching Process: A Case Study in Minimalist Market Design," NBER Working Papers 28911, National Bureau of Economic Research, Inc.
    13. Glover, Fred & Sueyoshi, Toshiyuki, 2009. "Contributions of Professor William W. Cooper in Operations Research and Management Science," European Journal of Operational Research, Elsevier, vol. 197(1), pages 1-16, August.
    14. Mohammad M. Amini & Gaylon Greer, 1993. "Determining the Minimum Bid Price for Projects Involving Analysis from Multiple Locations," Journal of Real Estate Research, American Real Estate Society, vol. 8(2), pages 265-278.
    15. Leo Lopes & Meredith Aronson & Gary Carstensen & Cole Smith, 2008. "Optimization Support for Senior Design Project Assignments," Interfaces, INFORMS, vol. 38(6), pages 448-464, December.
    16. Saber, Hussein M. & Ghosh, Jay B., 2001. "Assigning students to academic majors," Omega, Elsevier, vol. 29(6), pages 513-523, December.
    17. Shengwu Li, 2017. "Ethics and market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 705-720.
    18. Dmitry Krass & Anton Ovchinnikov, 2006. "The University of Toronto’s Rotman School of Management Uses Management Science to Create MBA Study Groups," Interfaces, INFORMS, vol. 36(2), pages 126-137, April.
    19. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    20. Michael Brusco & Hans Köhn & Douglas Steinley, 2013. "Exact and approximate methods for a one-dimensional minimax bin-packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 611-626, July.

    More about this item

    Statistics

    Access and download statistics

    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:orinte:v:47:y:2017:i:2:p:163-174. 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.