IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v249y2016i3p1153-1160.html
   My bibliography  Save this article

A MILP model for the teacher assignment problem considering teachers’ preferences

Author

Listed:
  • Domenech, B
  • Lusa, A

Abstract

The Teacher Assignment Problem is part of the University Timetabling Problem and involves assigning teachers to courses, taking their preferences into consideration. This is a complex problem, usually solved by means of heuristic algorithms. In this paper a Mixed Integer Linear Programing model is developed to balance teachers’ teaching load (first optimization criterion), while maximizing teachers’ preferences for courses according to their category (second optimization criterion). The model is used to solve the teachers-courses assignment in the Department of Management at the School of Industrial Engineering of Barcelona, in the Universitat Politècnica de Catalunya. Results are discussed regarding the importance given to the optimization criteria. Moreover, to test the model's performance a computational experiment is carried out using randomly generated instances based on real patterns. Results show that the model is proven to be suitable for many situations (number of teachers-courses and weight of the criteria), being useful for departments with similar requests.

Suggested Citation

  • Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    • Handle: RePEc:eee:ejores:v:249:y:2016:i:3:p:1153-1160
    DOI: 10.1016/j.ejor.2015.08.057
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715008139
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.08.057?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. 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.
    2. John J. Dinkel & John Mote & M. A. Venkataramanan, 1989. "OR Practice—An Efficient Decision Support System for Academic Course Scheduling," Operations Research, INFORMS, vol. 37(6), pages 853-864, December.
    3. Hultberg, Tim H. & Cardoso, Domingos M., 1997. "The teacher assignment problem: A special case of the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 101(3), pages 463-473, September.
    4. 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.
    5. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    6. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    7. Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
    8. Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
    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. Caselli, Giulia & Delorme, Maxence & Iori, Manuel, 2022. "Integer linear programming for the Tutor Allocation Problem : A practical case in a British University," Other publications TiSEM 983593a6-c17d-4b87-8ee1-a, Tilburg University, School of Economics and Management.
    2. Dönmez, Kadir & Demirel, Soner & Özdemir, Mustafa, 2020. "Handling the pseudo pilot assignment problem in air traffic control training by using NASA TLX," Journal of Air Transport Management, Elsevier, vol. 89(C).
    3. Nancy M. Arratia-Martinez & Paulina A. Avila-Torres & Juana C. Trujillo-Reyes, 2021. "Solving a University Course Timetabling Problem Based on AACSB Policies," Mathematics, MDPI, vol. 9(19), pages 1-19, October.
    4. Eryk Szwarc & Grzegorz Bocewicz & Paulina Golińska-Dawson & Zbigniew Banaszak, 2023. "Proactive Operations Management: Staff Allocation with Competence Maintenance Constraints," Sustainability, MDPI, vol. 15(3), pages 1-20, January.
    5. da Cunha, Joaquim J. & de Souza, Mauricio C., 2018. "A linearized model for academic staff assignment in a Brazilian university focusing on performance gain in quality indicators," International Journal of Production Economics, Elsevier, vol. 197(C), pages 43-51.

    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. 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.
    2. P. Solano Cutillas & D. Pérez-Perales & M. M. E. Alemany Díaz, 2022. "A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules," Operational Research, Springer, vol. 22(3), pages 2899-2942, July.
    3. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    4. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    5. Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
    6. 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.
    7. 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.
    8. Andrea Bettinelli & Valentina Cacchiani & Roberto Roberti & Paolo Toth, 2015. "An overview of curriculum-based course timetabling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 313-349, July.
    9. 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.
    10. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2012. "A branch-and-cut procedure for the Udine Course Timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 71-87, April.
    11. Caselli, Giulia & Delorme, Maxence & Iori, Manuel, 2022. "Integer linear programming for the Tutor Allocation Problem : A practical case in a British University," Other publications TiSEM 983593a6-c17d-4b87-8ee1-a, Tilburg University, School of Economics and Management.
    12. Gerald Lach & Marco Lübbecke, 2012. "Curriculum based course timetabling: new solutions to Udine benchmark instances," Annals of Operations Research, Springer, vol. 194(1), pages 255-272, April.
    13. van den Broek, John & Hurkens, Cor & Woeginger, Gerhard, 2009. "Timetabling problems at the TU Eindhoven," European Journal of Operational Research, Elsevier, vol. 196(3), pages 877-885, August.
    14. 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.
    15. Dönmez, Kadir & Demirel, Soner & Özdemir, Mustafa, 2020. "Handling the pseudo pilot assignment problem in air traffic control training by using NASA TLX," Journal of Air Transport Management, Elsevier, vol. 89(C).
    16. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    17. Dimopoulou, M. & Miliotis, P., 2004. "An automated university course timetabling system developed in a distributed environment: A case study," European Journal of Operational Research, Elsevier, vol. 153(1), pages 136-147, February.
    18. 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.
    19. Fabian Dunke & Stefan Nickel, 2023. "A matheuristic for customized multi-level multi-criteria university timetabling," Annals of Operations Research, Springer, vol. 328(2), pages 1313-1348, September.
    20. Raphael Medeiros Alves & Francisco Cunha & Anand Subramanian & Alisson V. Brito, 2022. "Minimizing energy consumption in a real-life classroom assignment problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1149-1175, December.

    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:eee:ejores:v:249:y:2016:i:3:p:1153-1160. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.