Actas de congresos
A Mathematical Model For Determining Timetables That Minimizes The Number Of Students With Conflicting Schedules
Registro en:
9788897999225
25th European Modeling And Simulation Symposium, Emss 2013. , v. , n. , p. 619 - 624, 2013.
2-s2.0-84886900467
Autor
De Azevedo A.T.
Kameyama A.
Amorim J.A.
Gustavsson P.M.
Institución
Resumen
With the increasing complexity of educational initiatives, several challenges arise as to appropriately allocate human and material resources or how to select alternative investments within a portfolio. Due to the complexity, solutions based on intuition are risky, which leads to a search for less intuitive and more reliable ways of solving educational problems. An engineering approach to the problem may lead to operations research mathematical modeling as a way to help on finding the solution for timetabling. In this case, a timetable is a schedule or, more precisely, a list or table of events arranged according to the time when they take place. This text features new and useful software to optimize the use of human resources. The software is based on a mathematical model for determining the timetable while minimizing the number of students with conflicting schedules. © 2013 DIME UNIVERSITÀ DI GENOVA.
619 624 Al-Yakoob, S.M., Sherali, H.D., A column generation mathematical programming approach for a class- faculty assignment problem with preferences (2013) Computational Management Science, pp. 1-22. , to appear in Al-Yakoob, S.M., Sherali, H.D., Al-Jazzaf, M., A mixed-integer mathematical modeling approach to exam timetabling (2010) Computational Management Science, 7 (1), pp. 19-46 Azevedo, A.T., Ribeiro, C.M., Sena, G.J.D., Chaves, A.A., Neto, L.L.S., Moretti, A.C., Solving the 3D container ship loading planning problem by representation by rules and beam search (2012) IC'ORES, pp. 132-141 Deitel, H.M., Deitel, P., (2006) J. Java: How to Programm, , 6. ed. Bookman Delia Croce, F., T'Kmdt, V., A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem (2002) Journal of the Operational Research Society, 54, pp. 1275-1280 Gunawan, A., Ng, K.M., Poh, K.L., Solving the teacher assignment-course scheduling problem by a hybrid algorithm Cite Seer, , http://130.203.133.150/viewdoc/download?doi=10.1.1.193.3646&rep= repl&tvpe=pdf, Available in: Access: 21 jun. 2013 Sua Microsystems, Platform, , http:.'7java.sua.comjavase/6/docs.api/, Standard Edition 6 API Specification. Available in: <, >. Access: 20 jan. 2012 Michael, W.C., Laporte, G., Recent developmeats m practical course time tabliag (1998) Selected Papers from the Second International Conference on Practice and Theory of Automated Timetabling II, pp. 3-19. , Spriager- Verlag. Loadoa. UK Ribeiro, C.M., Azev-Edo, A.T., Teixeira, R.F., Problem of assignment cells to switches la a cellular mobile network via beam search method (2009) WSEAS Traasactioas Oa Communications, 9 (1), pp. 11-21 Schaerf, A., A survey of automated timetabling (1999) Dipaitimento di Informatica E Sistemistica, , http://www.diegin.uniud.it/satt'papers.Scha99.pdf, Umversita di Roma "La Sapienza"', Available ia: Access: 16 jun"2011 Valente, J.M.S., Alves, R.A.F.S., Filtered and recovering beam search algorithm for the early/tardy scheduling problem with no idle time (2005) Computers & Industrial Engineering, 48, pp. 363-375 Willeamea, R.J., (2002) School Timetable Coastructioa: Algorithms Aad Complexity, , http://alexaadria.tue.nl/extra2/20021124S.pdf, Techaische Universiteit Eiadhovea. Available ia:, Access: 10jul.2011