Advertisement

A System Development for Laboratory Assignment Problem with Rotations: A Mixed Integer Programming Approach

  • Takeshi Koide
Chapter

Abstract

Our department offers a course called pre-semi to junior students. The course plays a role as a preliminary seminar and the students are assigned to three different laboratories to experience research activities. An assignment of students to three laboratories has been conducted manually by a department faculty member in turns considering both student’s preference for laboratories and some conditions for laboratories. The author has constructed a spreadsheet-based system to execute the assignment task efficiently. The assignment task is modeled mathematically as a mixed integer programming and its optimal solution is derived by the execution of external optimization software. The system has been modified repeatedly in response to opinions from department members. This paper reports the developed system and mathematical models. Numerical results are also demonstrated to show the efficiency of the system and how to seek a suitable assignment satisfied with requests from department members.

Keywords

Laboratory assignment Mixed integer programming Operations research Optimization Spreadsheet System development 

Notes

Acknowledgments

This work was partially supported by JSPS KAKENHI Grant number 25285131 and by MEXT, Japan.

References

  1. 1.
    D. Gale, L. Shapley, College admission and the stability of marriage. Am. Math. Mon. 69, 9–15 (1962)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    A.E. Roth, M.A.O. Sotomayor, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (Cambridge University Press, Cambridge, 1990)CrossRefMATHGoogle Scholar
  3. 3.
    International Timetabling Competition (2011), http://www.utwente.nl/ctit/hstt/itc2011/welcome/
  4. 4.
    S. Abdullah, H. Turabieh, On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems. Inf. Sci. 191, 146–168 (2012)CrossRefGoogle Scholar
  5. 5.
    L.E. Agustín-Blas, S. Salcedo-Sanz, E.G. Ortiz-García, A. Portilla-Figueras, Á.M. Pérez-Bellido, A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups. Expert Syst. Appl. 36(3), 7234–7241 (2009)CrossRefGoogle Scholar
  6. 6.
    G.N. Beligiannis, C.N. Moschopoulos, G.P. Kaperonis, S.D. Likothanassis, Applying evolutionary computation to the school timetabling problem: the Greek case. Comput. Oper. Res. 35(4), 1265–1280 (2008)CrossRefMATHGoogle Scholar
  7. 7.
    T. Thepphakorn, P. Pongcharoen, C. Hicks, An ant colony based timetabling tool. Int. J. Prod. Econ. 149, 131–144 (2014)CrossRefGoogle Scholar
  8. 8.
    C.W. Fong, H. Asmuni, B. McCollum, P. McMullan, S. Omatu, A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems. Inf. Sci. 283, 1–21 (2014)CrossRefGoogle Scholar
  9. 9.
    J.A. Ferland, S. Roy, Timetabling problem for university as assignment of activities to resources. Comput. Oper. Res. 12(2), 207–218 (1985)CrossRefMATHGoogle Scholar
  10. 10.
    S. Daskalaki, T. Birbas, E. Housos, An integer programming formulation for a case study in university timetabling. Eur. J. Oper. Res. 153(1), 117–135 (2004)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    S. Daskalaki, T. Birbas, Efficient solutions for a university timetabling problem through integer programming. Eur. J. Oper. Res. 160(1), 106–120 (2005)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    M. Dimopoulou, P. Miliotis, Implementation of a university course and examination timetabling system. Eur. J. Oper. Res. 130(1), 202–213 (2001)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    J.M. Mulvey, A classroom/time assignment model. Eur. J. Oper. Res. 9(1), 64–70 (1982)CrossRefMATHGoogle Scholar
  14. 14.
  15. 15.
    T. Koide, Improvement on spreadsheet-based system for seminar assignment problem with rotations, in Proceedings of the International Multiconference of Engineering and Computer Scientists 2014, IMECS 2014, Hong Kong, 12–14 March 2014. Lecture Notes in Engineering and Computer Science, pp. 1183–1185Google Scholar
  16. 16.
    T. Koide, A spreadsheet optimization system for seminar assignment problem with rotation, in Proceedings of the 14th Asia Pacific Industrial Engineering and Management System, APIEMS 2013, Cebu, Philippines, 3–6 Dec 2013, 7 pagesGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2015

Authors and Affiliations

  1. 1.Department of Intellegence and InformaticsKonan UniversityKobeJapan

Personalised recommendations