{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:46:58Z","timestamp":1762177618566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031424298"},{"type":"electronic","value":"9783031424304"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42430-4_42","type":"book-chapter","created":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T15:03:54Z","timestamp":1695913434000},"page":"510-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Elitism-Based Genetic Algorithm Hyper-heuristic for Solving Real-Life Surgical Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Masri","family":"Ayob","sequence":"first","affiliation":[]},{"given":"Dewan Mahmuda","family":"Zaman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,29]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"128068","DOI":"10.1109\/ACCESS.2020.3009318","volume":"8","author":"M Sanchez","year":"2020","unstructured":"Sanchez, M., et al.: A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access 8, 128068\u2013128095 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3009318","journal-title":"IEEE Access"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9, 451\u2013470 (2003)","journal-title":"J. Heuristics"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64, 1695\u20131724 (2013). https:\/\/doi.org\/10.1057\/jors.2013.71","journal-title":"J. Oper. Res. Soc."},{"doi-asserted-by":"crossref","unstructured":"Sabar, N.R., et al.: A dynamic multi-armed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems (2014)","key":"42_CR4","DOI":"10.1109\/TCYB.2014.2323936"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"106264","DOI":"10.1016\/j.knosys.2020.106264","volume":"205","author":"A Turky","year":"2020","unstructured":"Turky, A., Sabar, N.R., Dunstall, S., Song, A.: Hyper-heuristic local search for combinatorial optimisation problems. Knowl.-Based Syst. 205, 106264 (2020)","journal-title":"Knowl.-Based Syst."},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.5784\/31-1-158","volume":"31","author":"R Raghavjee","year":"2015","unstructured":"Raghavjee, R., Pillay, N.: A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem. ORiON 31, 39 (2015)","journal-title":"ORiON"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-77226-2_42","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2007","author":"P Garrido","year":"2007","unstructured":"Garrido, P., Riff, M.-C.: An evolutionary hyperheuristic to solve strip-packing problems. In: Yin, H., Tino, P., Corchado, E., Byrne, W., Yao, X. (eds.) IDEAL 2007. LNCS, vol. 4881, pp. 406\u2013415. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77226-2_42"},{"doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, pp. 1185\u20131190 (2002)","key":"42_CR8","DOI":"10.1109\/CEC.2002.1004411"},{"doi-asserted-by":"crossref","unstructured":"Kheiri, A., Keedwell, E.: A sequence-based selection hyper-heuristic utilising a hidden markov model. In: GECCO 2015 \u2013 Proceedings of the 2015 Genetic Evolutionary Computation Conference, pp. 417\u2013424 (2015)","key":"42_CR9","DOI":"10.1145\/2739480.2754766"},{"doi-asserted-by":"crossref","unstructured":"Sim, K., Hart, E.: A combined generative and selective hyper-heuristic for the vehicle routing problem. In: GECCO 2016 \u2013 Proceedings of the 2016 Genetic Evolutionary Computation Conference, pp. 1093\u20131100 (2016)","key":"42_CR10","DOI":"10.1145\/2908812.2908942"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.cie.2018.10.017","volume":"126","author":"M Belkhamsa","year":"2018","unstructured":"Belkhamsa, M., Jarboui, B., Masmoudi, M.: Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints. Comput. Ind. Eng. 126, 494\u2013506 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10729-006-9005-4","volume":"10","author":"B Denton","year":"2007","unstructured":"Denton, B., Viapiano, J., Vogl, A.: Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Manag. Sci. 10, 13\u201324 (2007)","journal-title":"Health Care Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"G\u00fcr, \u015e., Eren, T.: Application of operational research techniques in operating room scheduling problems: literature overview. J. Healthc. Eng. 2018 (2018)","key":"42_CR13","DOI":"10.1155\/2018\/5341394"},{"doi-asserted-by":"crossref","unstructured":"Vancroonenburg, W., Smet, P., Vanden Berghe, G.: A two-phase heuristic approach to multi-day surgical case scheduling considering generalized resource constraints. Oper. Res. Heal. Care 7, 27\u201339 (2015)","key":"42_CR14","DOI":"10.1016\/j.orhc.2015.09.010"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10878-018-0322-6","volume":"37","author":"S Zhu","year":"2019","unstructured":"Zhu, S., Fan, W., Yang, S., Pei, J., Pardalos, P.M.: Operating room planning and surgical case scheduling: a review of literature. J. Combin. Optim. 37, 757\u2013805 (2019). https:\/\/doi.org\/10.1007\/s10878-018-0322-6","journal-title":"J. Combin. Optim."},{"key":"42_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"PATAT 2000","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44629-X_11"},{"doi-asserted-by":"crossref","unstructured":"Han, L., Kendall, G.: An \u0131nvestigation of a tabu assisted hyper-heuristic genetic algorithm, pp. 2230\u20132237 (2003)","key":"42_CR17","DOI":"10.1007\/978-3-540-24581-0_69"},{"doi-asserted-by":"crossref","unstructured":"Yan, J., Wu, X.: A genetic based hyper-heuristic algorithm for the job shop scheduling problem. In: Proceedings - 2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC 2015, vol. 1, pp. 161\u2013164 (2015)","key":"42_CR18","DOI":"10.1109\/IHMSC.2015.13"},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"3271","DOI":"10.1007\/s00500-017-2789-y","volume":"22","author":"AS Pillai","year":"2017","unstructured":"Pillai, A.S., et al.: A genetic algorithm-based method for optimizing the energy consumption and performance of multiprocessor systems. Soft Comput. 22, 3271\u20133285 (2017)","journal-title":"Soft Comput."},{"key":"42_CR20","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."},{"doi-asserted-by":"crossref","unstructured":"F\u00fcgener, A., Hans, E.W., Kolisch, R., Kortbeek, N., Vanberkel, P.T.: Master surgery scheduling with consideration of multiple downstream units (2014)","key":"42_CR21","DOI":"10.1016\/j.ejor.2014.05.009"},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.orhc.2013.12.001","volume":"3","author":"I Marques","year":"2014","unstructured":"Marques, I., Captivo, M.E., Vaz, M.: Operations research for health care scheduling elective surgeries in a Portuguese hospital using a genetic heuristic. Oper. Res. Heal. Care 3, 59\u201372 (2014)","journal-title":"Oper. Res. Heal. Care"},{"key":"42_CR23","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.ejor.2006.10.060","volume":"189","author":"J Beli\u00ebn","year":"2008","unstructured":"Beli\u00ebn, J., Demeulemeester, E.: A branch-and-price approach for integrating nurse and surgery scheduling. Eur. J. Oper. Res. 189, 652\u2013668 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"42_CR24","doi-asserted-by":"publisher","first-page":"2660","DOI":"10.1016\/j.cor.2008.11.012","volume":"36","author":"B Cardoen","year":"2009","unstructured":"Cardoen, B., Demeulemeester, E., Beli\u00ebn, J.: Sequencing surgical cases in a day-care environment: an exact branch-and-price approach. Comput. Oper. Res. 36, 2660\u20132669 (2009)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Maha, T., Achchab, S., Omar, S.: The two phases method for operating rooms planning and scheduling. In: 2020 IEEE International Conference on Technology Management, Operations and Decisions, ICTMOD 2020 (2020)","key":"42_CR25","DOI":"10.1109\/ICTMOD49425.2020.9380584"},{"key":"42_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.orhc.2015.07.004","volume":"7","author":"I Marques","year":"2015","unstructured":"Marques, I., Captivo, M.E.: Bicriteria elective surgery scheduling using an evolutionary algorithm. Oper. Res. Heal. Care 7, 14\u201326 (2015)","journal-title":"Oper. Res. Heal. Care"},{"doi-asserted-by":"crossref","unstructured":"Ansarifar, J., Tavakkoli-moghaddam, R.: Multi-objective integrated planning and scheduling model for operating rooms under uncertainty, vol. 232, pp. 930\u2013948 (2018)","key":"42_CR27","DOI":"10.1177\/0954411918794721"},{"unstructured":"Wang, R., Zhou, Z., Ishibuchi, H., Liao, T., Zhang, T.: Localized weighted sum method for many-objective optimization, vol. X, pp. 1\u201316 (2016)","key":"42_CR28"},{"key":"42_CR29","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1007\/s11831-020-09432-2","volume":"28","author":"I Rahimi","year":"2021","unstructured":"Rahimi, I., Gandomi, A.H.: A comprehensive review and analysis of operating room and surgery scheduling. Arch. Comput. Methods Eng. 28, 1667\u20131688 (2021)","journal-title":"Arch. Comput. Methods Eng."},{"doi-asserted-by":"crossref","unstructured":"Anand, S., Afreen, N., Yazdani, S.: A novel and efficient selection method in genetic algorithm, vol. 129, pp. 7\u201312 (2015)","key":"42_CR30","DOI":"10.5120\/ijca2015907067"},{"doi-asserted-by":"crossref","unstructured":"Swiercz, A., et al.: Unified encoding for hyper-heuristics with application to bioinformatics, pp. 567\u2013589 (2014)","key":"42_CR31","DOI":"10.1007\/s10100-013-0321-8"},{"key":"42_CR32","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jmsy.2021.05.012","volume":"60","author":"S Zhang","year":"2021","unstructured":"Zhang, S., Xu, Y., Zhang, W.: Multitask-oriented manufacturing service composition in an uncertain environment using a hyper-heuristic algorithm. J. Manuf. Syst. 60, 138\u2013151 (2021)","journal-title":"J. Manuf. Syst."}],"container-title":["Communications in Computer and Information Science","Recent Challenges in Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42430-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:34:19Z","timestamp":1730208859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42430-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031424298","9783031424304"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42430-4_42","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Phuket","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"224","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":"50","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":"22% - 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":"3,87","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":"2,82","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}