{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:57:50Z","timestamp":1742986670581,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031196461"},{"type":"electronic","value":"9783031196478"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19647-8_1","type":"book-chapter","created":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T15:02:57Z","timestamp":1665759777000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Genetic Algorithm for\u00a0Scheduling Laboratory Rooms: A Case Study"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Fuenmayor","sequence":"first","affiliation":[]},{"given":"Mart\u00edn","family":"Larrea","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Moncayo","sequence":"additional","affiliation":[]},{"given":"Esteban","family":"Moya","sequence":"additional","affiliation":[]},{"given":"Sebasti\u00e1n","family":"Trujillo","sequence":"additional","affiliation":[]},{"given":"Juan-Diego","family":"Terneus","sequence":"additional","affiliation":[]},{"given":"Robinson","family":"Guachi","sequence":"additional","affiliation":[]},{"given":"Diego H.","family":"Peluffo-Ordo\u00f1ez","sequence":"additional","affiliation":[]},{"given":"Lorena","family":"Guachi-Guachi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alhuniti, O., Ghnemat, R., El-Seoud, M.S.A.: Smart university scheduling using genetic algorithms. In: Proceedings of the 2020 9th International Conference on Software and Information Engineering (ICSIE), pp. 235\u2013239 (2020)","DOI":"10.1145\/3436829.3436873"},{"issue":"01","key":"1_CR2","doi-asserted-by":"publisher","first-page":"2040009","DOI":"10.1142\/S0219649220400092","volume":"19","author":"K Alomari","year":"2020","unstructured":"Alomari, K., Almarashdi, O., Marashdh, A., Zaqaibeh, B.: A new optimization on harmony search algorithm for exam timetabling system. J. Inf. Knowl. Manage. 19(01), 2040009 (2020)","journal-title":"J. Inf. Knowl. Manage."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Amindoust, A., Asadpour, M., Shirmohammadi, S.: A hybrid genetic algorithm for nurse scheduling problem considering the fatigue factor. J. Healthcare Eng. 2021 (2021)","DOI":"10.1155\/2021\/5563651"},{"issue":"4","key":"1_CR4","first-page":"377","volume":"15","author":"M Amjad","year":"2020","unstructured":"Amjad, M., Butt, S., Anjum, N., Chaudhry, I., Faping, Z., Khan, M.: A layered genetic algorithm with iterative diversification for optimization of flexible job shop scheduling problems. Adv. Prod. Eng. Manage. 15(4), 377\u2013389 (2020)","journal-title":"Adv. Prod. Eng. Manage."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ansari, R., Saubari, N.: Application of genetic algorithm concept on course scheduling. In: IOP Conference series: Materials Science and Engineering, vol. 821, p. 012043. IOP Publishing (2020)","DOI":"10.1088\/1757-899X\/821\/1\/012043"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"26177","DOI":"10.1109\/ACCESS.2021.3057366","volume":"9","author":"M Asadujjaman","year":"2021","unstructured":"Asadujjaman, M., Rahman, H.F., Chakrabortty, R.K., Ryan, M.J.: An immune genetic algorithm for solving NPV-based resource constrained project scheduling problem. IEEE Access 9, 26177\u201326195 (2021)","journal-title":"IEEE Access"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen, R., Yang, B., Li, S., Wang, S.: A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput. Ind. Eng. 149, 106778 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.3991\/ijet.v16i01.18225","volume":"16","author":"X Chen","year":"2021","unstructured":"Chen, X., Yue, X.G., Li, R., Zhumadillayeva, A., Liu, R.: Design and application of an improved genetic algorithm to a class scheduling system. Int. J. Emerg. Technol. Learn. (iJET) 16(1), 44\u201359 (2021)","journal-title":"Int. J. Emerg. Technol. Learn. (iJET)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Do\u011fan, A., Yurtsal, A.: Developing a decision support system for exam scheduling problem using genetic algorithm. Eski\u015fehir Tech. Univ. J. Sci. Technol. A-Appl. Sci. Eng. 22(3), 274\u2013289 (2021)","DOI":"10.18038\/estubtda.890307"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Donoriyanto, D.S., Silfiana, I.Y., Pudji, W.E., Suryadi, A., Widodo, L.U.: Determination of maintenance schedule of loading and unloading pump machine using genetic algorithm method. J. Phys. Conf. Ser. 1569, 032008 (2020)","DOI":"10.1088\/1742-6596\/1569\/3\/032008"},{"issue":"12","key":"1_CR11","doi-asserted-by":"publisher","first-page":"3990","DOI":"10.3390\/s21123990","volume":"21","author":"VP Ha","year":"2021","unstructured":"Ha, V.P., Dao, T.K., Pham, N.Y., Le, M.H.: A variable-length chromosome genetic algorithm for time-based sensor network schedule optimization. Sensors 21(12), 3990 (2021)","journal-title":"Sensors"},{"key":"1_CR12","unstructured":"Herrera-Granda, I.D., Mart\u00edn-Barreiro, C., Herrera-Granda, E.P., Fern\u00e1ndez, Y., Peluffo-Ordo\u00f1ez, D.H.: Forthcoming paper icor2020-90b35-01 a hybrid genetic algorithm for optimizing urban distribution of auto-parts by a vertex routing problem"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Idroes, R., Maulana, A., Noviandy, T., Suhendra, R., Sasmita, N., Lala, A., et al.: A genetic algorithm to determine research consultation schedules in campus environment. In: IOP Conference Series: Materials Science and Engineering, vol. 796, p. 012033. IOP Publishing (2020)","DOI":"10.1088\/1757-899X\/796\/1\/012033"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Kakkar, M.K., Singla, J., Garg, N., Gupta, G., Srivastava, P., Kumar, A.: Class schedule generation using evolutionary algorithms. In: Journal of Physics: Conference Series, vol. 1950, p. 012067. IOP Publishing (2021)","DOI":"10.1088\/1742-6596\/1950\/1\/012067"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1080\/15472450.2020.1852082","volume":"26","author":"E K\u00f6ksal Ahmed","year":"2022","unstructured":"K\u00f6ksal Ahmed, E., Li, Z., Veeravalli, B., Ren, S.: Reinforcement learning-enabled genetic algorithm for school bus scheduling. J. Intell. Transp. Syst. 26(3), 269\u2013283 (2022)","journal-title":"J. Intell. Transp. Syst."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., Chen, H.: Physical therapy scheduling of inpatients based on improved genetic algorithm. In: Journal of Physics: Conference Series, vol. 1848, p. 012009. IOP Publishing (2021)","DOI":"10.1088\/1742-6596\/1848\/1\/012009"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10729-019-09481-5","volume":"23","author":"Y-K Lin","year":"2019","unstructured":"Lin, Y.-K., Chou, Y.-Y.: A hybrid genetic algorithm for operating room scheduling. Health Care Manage. Sci. 23(2), 249\u2013263 (2019). https:\/\/doi.org\/10.1007\/s10729-019-09481-5","journal-title":"Health Care Manage. Sci."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"04019055","DOI":"10.1061\/(ASCE)CP.1943-5487.0000874","volume":"34","author":"J Liu","year":"2020","unstructured":"Liu, J., Liu, Y., Shi, Y., Li, J.: Solving resource-constrained project scheduling problem via genetic algorithm. J. Comput. Civil Eng. 34(2), 04019055 (2020)","journal-title":"J. Comput. Civil Eng."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-29859-3_57","volume-title":"Hybrid Artificial Intelligent Systems","author":"LL Lorente-Leyva","year":"2019","unstructured":"Lorente-Leyva, L.L., et al.: Optimization of the master production scheduling in a textile industry using genetic algorithm. In: P\u00e9rez Garc\u00eda, H., S\u00e1nchez Gonz\u00e1lez, L., Castej\u00f3n Limas, M., Quinti\u00e1n Pardo, H., Corchado Rodr\u00edguez, E. (eds.) HAIS 2019. LNCS (LNAI), vol. 11734, pp. 674\u2013685. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29859-3_57"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.11113\/ijic.v11n2.342","volume":"11","author":"HK Mammi","year":"2021","unstructured":"Mammi, H.K., Ying, L.Y.: Timetable scheduling system using genetic algorithm for school of computing (tsuGA). Int. J. Innov. Comput. 11(2), 67\u201372 (2021)","journal-title":"Int. J. Innov. Comput."},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.33480\/jitk.v7i2.2262","volume":"7","author":"AK Nugroho","year":"2022","unstructured":"Nugroho, A.K., Permadi, I., Yasifa, A.R., et al.: Optimizing course scheduling faculty of engineering unsoed using genetic algorithms. JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer) 7(2), 91\u201398 (2022)","journal-title":"JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer)"},{"issue":"19","key":"1_CR22","doi-asserted-by":"publisher","first-page":"13075","DOI":"10.1007\/s00521-021-06002-w","volume":"33","author":"P Pirozmand","year":"2021","unstructured":"Pirozmand, P., Hosseinabadi, A.A.R., Farrokhzad, M., Sadeghilalimi, M., Mirkamali, S., Slowik, A.: Multi-objective hybrid genetic algorithm for task scheduling problem in cloud computing. Neural Comput. Appl. 33(19), 13075\u201313088 (2021). https:\/\/doi.org\/10.1007\/s00521-021-06002-w","journal-title":"Neural Comput. Appl."},{"issue":"7","key":"1_CR23","first-page":"791","volume":"15","author":"W Sardjono","year":"2021","unstructured":"Sardjono, W., Priatna, W., Nugroho, D.S., Rahmasari, A., Lusia, E.: Genetic algorithm implementation for application of shifting work scheduling system. ICIC Exp. Lett. 15(7), 791\u2013802 (2021)","journal-title":"ICIC Exp. Lett."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Shen, L., Zhang, G.: Optimization design of civil engineering construction schedule based on genetic algorithm. In: Journal of Physics: Conference Series, vol. 1852, p. 032055. IOP Publishing (2021)","DOI":"10.1088\/1742-6596\/1852\/3\/032055"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Shuai, C.J.: Design of automatic course arrangement system for electronic engineering teaching based on monte carlo genetic algorithm. Secur. Commun. Netw. 2021 (2021)","DOI":"10.1155\/2021\/3564722"},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TITS.2020.3025031","volume":"22","author":"J Tang","year":"2020","unstructured":"Tang, J., Yang, Y., Hao, W., Liu, F., Wang, Y.: A data-driven timetable optimization of urban bus line based on multi-objective genetic algorithm. IEEE Trans. Intell. Transp. Syst. 22(4), 2417\u20132429 (2020)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Tung Ngo, S., Jafreezal, J., Hoang Nguyen, G., Ngoc Bui, A.: A genetic algorithm for multi-objective optimization in complex course timetabling. In: 2021 10th International Conference on Software and Computer Applications, pp. 229\u2013237 (2021)","DOI":"10.1145\/3457784.3457821"},{"issue":"12","key":"1_CR28","doi-asserted-by":"publisher","first-page":"5531","DOI":"10.3390\/app11125531","volume":"11","author":"L Xie","year":"2021","unstructured":"Xie, L., Chen, Y., Chang, R.: Scheduling optimization of prefabricated construction projects by genetic algorithm. Appl. Sci. 11(12), 5531 (2021)","journal-title":"Appl. Sci."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"106567","DOI":"10.1016\/j.cie.2020.106567","volume":"146","author":"F Zaman","year":"2020","unstructured":"Zaman, F., Elsayed, S., Sarker, R., Essam, D.: Hybrid evolutionary algorithm for large-scale project scheduling problems. Comput. Ind. Eng. 146, 106567 (2020)","journal-title":"Comput. Ind. Eng."}],"container-title":["Communications in Computer and Information Science","Applied Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19647-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T21:37:48Z","timestamp":1669153068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19647-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031196461","9783031196478"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19647-8_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arequipa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icai22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icai.itiud.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}