Java程序辅导

C C++ Java Python Processing编程在线培训 程序编写 软件开发 视频讲解

客服在线QQ:2653320439 微信:ittutor Email:itutor@qq.com
wx: cjtutor
QQ: 2653320439
Assigning Classes To Teachers In Universities Via Mathematical Modelling: Using Beam Search Method And Simulation In Java - CORE CORE Services Services overviewExplore all CORE services Access to raw data API Dataset FastSync Content discovery Recommender Discovery Managing content Repository dashboard Packages Repository edition About About us Our mission Team Blog FAQs Contact us Assigning Classes To Teachers In Universities Via Mathematical Modelling: Using Beam Search Method And Simulation In Java Authors De Azevedo A.T. Ohata A.F.S.M. Amorim J.A. Gustavsson P.M. Publication date November 26, 2015 Publisher Abstract In universities, before the beginning of each school year, it is held the distribution of classes among the available teachers. For such task, different constraints must be fulfilled like preventing a teacher to teach in two different places at the same time and avoid solutions in which some teachers have more class hours than others. This process, if performed manually, is time consuming and does not allow viewing other combinations of assignment of classes to teachers. In addition, it is subject to error. This study aims to develop a decision support tool for the problem of assigning teachers to classes in universities. The project includes the development of a computer program using the concepts of object orientation as a way to implement a search algorithm called Beam Search which explores the combinatorial nature of the problem. The programming language used is Java and the program has a graphical interface for insertion and manipulation of the relevant data. © 2013 DIME UNIVERSITÀ DI GENOVA.577586Al-Yakoob, S.M., Sherali, H.D., A column generation mathematical programming approach for a classfaculty assignment problem with preferences (2013) Computational Management Science, pp. 1-22. , to appear inAl-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-46Azevedo, 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) ICORES, pp. 132-141Deitel, H.M., Deitel, P.J., (2006) Java: How to Programm, , 6. ed. BookmanDella Croce, F., T'kindt, 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-1280Gunawan, 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= rep1&type=pdf, Available in: Access: 21 jun. 2013Sun Microsystems, Platform, , http://java.sun.com/javase/6/docs/api/, Standard Edition 6 API Specification. Available in: . Access: 20 jan. 2012Michael, W.C., Laporte, G., Recent developments in practical course timetabling (1998) Selected Papers from the Second International Conference on Practice and Theory of Automated Timetabling II, pp. 3-19. , Springer- Verlag, London, UKSabuncuoglu, I., Bayiz, M., Job shop scheduling with beam search (1999) European Journal of Operational Research, 118, pp. 390-412Ow, P.S., Morton, T.E., Filtered beam search in scheduling (1988) International Journal of Production Research, 26, pp. 35-62Ribeiro, C.M., Azevedo, A.T., Teixeira, R.F., Problem of assignment cells to switches in a cellular mobile network via beam search method (2009) WSEAS Transactions on Communications, 9 (1), pp. 11-21Schaerf, A., (1999) A Survey of Automated Timetabling, , http://www.diegm.uniud.it/satt/papers/Scha99.pdf, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Available in: Access: 16 jun. 2011Valente, 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-375Willenmen, R.J., School timetable construction: Algorithms and complexity (2002) Technische Universiteit Eindhoven, , http://alexandria.tue.nl/extra2/200211248.pdf, Available in: Access: 10 jul.201 Artigo de evento Similar works Full text Repositorio da Producao Cientifica e Intelectual da UnicampFull text is not available oai:repositorio.unicamp.br:REPOSIP/88897 Last time updated on 4/10/2020 This paper was published in Repositorio da Producao Cientifica e Intelectual da Unicamp. Having an issue? Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request. Report CORE is not-for-profit service delivered by the Open University and Jisc. Product Services Data providers Communities Terms Organisation About us Mission Team Blog Support FAQs Contact us Writing about CORE? Discover our research outputs and cite our work. COREAccessabilityCookiesPrivacy