{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:35:19Z","timestamp":1742970919644,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811912559"},{"type":"electronic","value":"9789811912566"}],"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-981-19-1256-6_22","type":"book-chapter","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T15:02:59Z","timestamp":1648047779000},"page":"294-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Overbooking Appointment Scheduling in Hospitals Using Evolutionary Markov Decision Process"],"prefix":"10.1007","author":[{"given":"Wenlong","family":"Ni","sequence":"first","affiliation":[]},{"given":"Jue","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ziyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Huaixiang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xinyu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Mingwen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"issue":"9","key":"22_CR1","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1080\/07408170008967443","volume":"32","author":"PMV Bosch","year":"2000","unstructured":"Bosch, P.M.V., Dietz, D.C.: Minimizing expected waiting in a medical appointment system. IIE Trans. 32(9), 841\u2013848 (2000)","journal-title":"IIE Trans."},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0966-6532(00)00065-2","volume":"8","author":"C De Lathouwer","year":"2000","unstructured":"De Lathouwer, C., Poullier, J.: How much ambulatory surgery in the world in 1996\u20131997 and trends? Ambul. Surg. 8(4), 191\u2013210 (2000)","journal-title":"Ambul. Surg."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1287\/ijoc.1110.0482","volume":"25","author":"SA Erdogan","year":"2013","unstructured":"Erdogan, S.A., Denton, B.: Dynamic appointment scheduling of a stochastic server with uncertain demand. INFORMS J. Comput. 25(1), 116\u2013132 (2013)","journal-title":"INFORMS J. Comput."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3, 95\u201399 (1988). https:\/\/doi.org\/10.1023\/A:1022602019183","journal-title":"Mach. Learn."},{"issue":"9","key":"22_CR5","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1080\/07408170802165880","volume":"40","author":"D Gupta","year":"2008","unstructured":"Gupta, D., Denton, B.: Appointment scheduling in health care: challenges and opportunities. IIE Trans. 40(9), 800\u2013819 (2008)","journal-title":"IIE Trans."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TWC.2006.05192","volume":"6","author":"W Li","year":"2007","unstructured":"Li, W., Chao, X.: Call admission control for an adaptive heterogeneous multimedia mobile network. IEEE Trans. Wireless Commun. 6(2), 515\u2013525 (2007). https:\/\/doi.org\/10.1109\/TWC.2006.05192","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"5","key":"22_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/07408179308964316","volume":"25","author":"CJ Liao","year":"1993","unstructured":"Liao, C.J., Pegden, C.D., Rosenshine, M.: Planning timely arrivals to a stochastic production or service system. IIE Trans. 25(5), 63\u201373 (1993)","journal-title":"IIE Trans."},{"issue":"9","key":"22_CR8","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1080\/07408170802165823","volume":"40","author":"K Muthuraman","year":"2008","unstructured":"Muthuraman, K., Lawley, M.: A stochastic overbooking model for outpatient clinical scheduling with no-shows. IIE Trans. 40(9), 820\u2013837 (2008)","journal-title":"IIE Trans."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TWC.2009.080349","volume":"8","author":"W Ni","year":"2009","unstructured":"Ni, W., Li, W., Alam, M.: Determination of optimal call admission control policy in wireless networks. IEEE Trans. Wireless Commun. 8, 1038\u20131044 (2009). https:\/\/doi.org\/10.1109\/TWC.2009.080349","journal-title":"IEEE Trans. Wireless Commun."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-04648-4_9","volume-title":"Computational Data and Social Networks","author":"W Ni","year":"2018","unstructured":"Ni, W., Li, W.W.: Optimal resource allocation for brokers in media cloud. In: Chen, X., Sen, A., Li, W.W., Thai, M.T. (eds.) CSoNet 2018. LNCS, vol. 11280, pp. 103\u2013115. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04648-4_9"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming (2005). https:\/\/doi.org\/10.1002\/9780470316887","DOI":"10.1002\/9780470316887"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves, C.R.: Genetic algorithms for the operations researcher. INFORMS J. Comput. 9(3), 231\u2013250 (1997)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1019748703353","volume":"5","author":"TR Rohleder","year":"2002","unstructured":"Rohleder, T.R., Klassen, K.J.: Rolling horizon appointment scheduling: a simulation study. Health Care Manag. Sci. 5(3), 201\u2013209 (2002)","journal-title":"Health Care Manag. Sci."},{"issue":"6","key":"22_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Genetic algorithms: a survey. Computer 27(6), 17\u201326 (1994)","journal-title":"Computer"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-1256-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T15:05:44Z","timestamp":1648047944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-1256-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811912559","9789811912566"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-1256-6_22","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":"24 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.bicta.org\/","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":"211","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":"67","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":"32% - 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","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":"4","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)"}}]}}