IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v57y2006i8d10.1057_palgrave.jors.2602070.html
   My bibliography  Save this article

A methodology to optimize foundation seminar assignments

Author

Listed:
  • K A Willoughby

    (Health Quality Council)

  • C J Zappe

    (College of Arts and Sciences, Bucknell University)

Abstract

First-year students entering the College of Arts & Sciences at Bucknell University (USA) are required to enroll in a first-year experience course called a foundation seminar during their first semester. A few months before arriving at Bucknell, students submit a prioritized list of foundation seminars of interest to them, given course descriptions of all available foundation seminar sections. Then, based on capacity and scheduling constraints, each student is assigned to a particular seminar. Currently, this assignment of students to specific seminars is carried out using both manual and heuristic methods. We propose to apply an optimization methodology to this interesting real-world problem in an attempt to determine assignments that better satisfy the highest preferences of entering first-year students.

Suggested Citation

  • K A Willoughby & C J Zappe, 2006. "A methodology to optimize foundation seminar assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 950-956, August.
    • Handle: RePEc:pal:jorsoc:v:57:y:2006:i:8:d:10.1057_palgrave.jors.2602070
    DOI: 10.1057/palgrave.jors.2602070
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602070
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602070?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. S K Mirrazavi & S J Mardle & M Tamiz, 2003. "A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1155-1166, November.
    2. M Bazargan-Lari, 2004. "Flexible versus fixed timetabling: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 123-131, February.
    3. Stefan D. Bloomfield & Michael M. McSharry, 1979. "Preferential Course Scheduling," Interfaces, INFORMS, vol. 9(4), pages 24-31, August.
    4. Roth, Alvin E, 1986. "On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets," Econometrica, Econometric Society, vol. 54(2), pages 425-427, March.
    5. Timothy R. Hinkin & Gary M. Thompson, 2002. "SchedulExpert: Scheduling Courses in the Cornell University School of Hotel Administration," Interfaces, INFORMS, vol. 32(6), pages 45-57, December.
    6. Mongell, Susan & Roth, Alvin E, 1991. "Sorority Rush as a Two-Sided Matching Mechanism," American Economic Review, American Economic Association, vol. 81(3), pages 441-464, June.
    7. Robert L. Graves & Linus Schrage & Jayaram Sankaran, 1993. "An Auction Method for Course Registration," Interfaces, INFORMS, vol. 23(5), pages 81-92, October.
    8. K Papoutsis & C Valouxis & E Housos, 2003. "A column generation approach for the timetabling problem of Greek high schools," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(3), pages 230-238, March.
    9. Jacques A. Ferland & Charles Fleurent, 1994. "SAPHIR: A Decision Support System for Course Scheduling," Interfaces, INFORMS, vol. 24(2), pages 105-115, April.
    10. Scott E. Sampson & James R. Freeland & Elliott N. Weiss, 1995. "Class Scheduling to Maximize Participant Satisfaction," Interfaces, INFORMS, vol. 25(3), pages 30-41, June.
    11. John J. Bartholdi & Kevin L. McCroan, 1990. "Scheduling Interviews for a Job Fair," Operations Research, INFORMS, vol. 38(6), pages 951-960, December.
    12. Rania M. Awad & John W. Chinneck, 1998. "Proctor Assignment at Carleton University," Interfaces, INFORMS, vol. 28(2), pages 58-71, April.
    13. A. T. Ernst & R. G. J. Mills & P. Welgama, 2003. "Scheduling Appointments at Trade Events for the Australian Tourist Commission," Interfaces, INFORMS, vol. 33(3), pages 12-23, June.
    14. Mulvey, John M., 1982. "A classroom/time assignment model," European Journal of Operational Research, Elsevier, vol. 9(1), pages 64-70, January.
    15. Thomas A. Blanco & Robert C. Hillery, 1994. "A Sea Story: Implementing the Navy's Personnel Assignment System," Operations Research, INFORMS, vol. 42(5), pages 814-822, October.
    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. Jaime Miranda, 2010. "eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile," Interfaces, INFORMS, vol. 40(3), pages 196-207, June.
    2. Braathen, Christian, 2022. "Interview Scheduling: An Integer Programming Approach," Discussion Papers 2022/10, Norwegian School of Economics, Department of Business and Management Science.
    3. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    4. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    5. Charness, Gary & Kuhn, Peter, 2011. "Lab Labor: What Can Labor Economists Learn from the Lab?," Handbook of Labor Economics, in: O. Ashenfelter & D. Card (ed.), Handbook of Labor Economics, edition 1, volume 4, chapter 3, pages 229-330, Elsevier.
    6. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    7. Rheingans-Yoo, Ross, 2024. "Large random matching markets with localized preference structures can exhibit large cores," Games and Economic Behavior, Elsevier, vol. 144(C), pages 71-83.
    8. Tayfun Sönmez, 1994. "Strategy-proofness in many-to-one matching problems," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 365-380, December.
    9. Roth, Alvin E. & Sotomayor, Marilda, 1996. "Stable Outcomes in Discrete and Continuous Models of Two-Sided Matching: a Unified Treatment," Brazilian Review of Econometrics, Sociedade Brasileira de Econometria - SBE, vol. 16(2), November.
    10. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    11. Al-Yakoob, Salem M. & Sherali, Hanif D., 2007. "A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1028-1044, August.
    12. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    13. Enrico Maria Fenoaltea & Izat B. Baybusinov & Jianyang Zhao & Lei Zhou & Yi-Cheng Zhang, 2021. "The Stable Marriage Problem: an Interdisciplinary Review from the Physicist's Perspective," Papers 2103.11458, arXiv.org.
    14. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    15. Biniyam Asmare Kassa, 2015. "Implementing a Class-Scheduling System at the College of Business and Economics of Bahir Dar University, Ethiopia," Interfaces, INFORMS, vol. 45(3), pages 203-215, June.
    16. Ruth Martínez & Jordi Massó & Alejdanro Neme & Jorge Oviedo, 2004. "On group strategy-proof mechanisms for a many-to-one matching model," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 115-128, January.
    17. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    18. Timothy R. Hinkin & Gary M. Thompson, 2002. "SchedulExpert: Scheduling Courses in the Cornell University School of Hotel Administration," Interfaces, INFORMS, vol. 32(6), pages 45-57, December.
    19. Klijn, Flip & Pais, Joana & Vorsatz, Marc, 2019. "Static versus dynamic deferred acceptance in school choice: Theory and experiment," Games and Economic Behavior, Elsevier, vol. 113(C), pages 147-163.
    20. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.

    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:pal:jorsoc:v:57:y:2006:i:8:d:10.1057_palgrave.jors.2602070. 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.palgrave-journals.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.