{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T01:21:17Z","timestamp":1776216077743,"version":"3.50.1"},"reference-count":21,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T00:00:00Z","timestamp":1431302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5,11]]},"abstract":"<jats:sec>\n               <jats:title content-type=\"abstract-heading\">Purpose<\/jats:title>\n               <jats:p> \u2013 The purpose of this paper is to maximize the expected revenue of the outpatient department considering patient preferences and choices. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title>\n               <jats:p> \u2013 Patient preference refers to the preferred physician and time slot that patients hold before asking for appointments. Patient choice is the appointment decision the patient made after receiving a set of options from the scheduler. The relationship between patient choices and preferences is explored. A dynamic programming (DP) model is formulated to optimize appointment scheduling with patient preferences and choices. The DP model is transformed to an equivalent linear programming (LP) model. A decomposition method is proposed to eliminate the number of variables. A column generation algorithm is used to resolve computation problem of the resulting LP model. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Findings<\/jats:title>\n               <jats:p> \u2013 Numerical studies show the benefit of multiple options provided, and that the proposed algorithm is efficient and accurate. The effects of the booking horizon and arrival rates are studies. A policy about how to make use of the information of patient preferences is compared to other naive polices. Experiments show that more revenue can be expected if patient preferences and choices are considered. <\/jats:p>\n            <\/jats:sec>\n            <jats:sec>\n               <jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title>\n               <jats:p> \u2013 This paper proposes a framework for appointment scheduling problem in outpatient departments. It is concluded that more revenue can be achieved if more choices are provided for patients to choose from and patient preferences are considered. Additionally, an appointment decision can be made timely after receiving patient preference information. Therefore, the proposed model and policies are convenient tools applicable to an outpatient department.<\/jats:p>\n            <\/jats:sec>","DOI":"10.1108\/imds-12-2014-0372","type":"journal-article","created":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T04:01:26Z","timestamp":1431489686000},"page":"700-717","source":"Crossref","is-referenced-by-count":22,"title":["Dynamic appointment scheduling with patient preferences and choices"],"prefix":"10.1108","volume":"115","author":[{"given":"Jin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Richard Y.K.","family":"Fung","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2020122404273882700_b1","unstructured":"Ben-Akiva, M.E.\n                and \n                  Lerman, S.R.\n                (1985), \n                  Discrete Choice Analysis: Theory and Application to Travel Demand\n               , MIT Press, Cambridge MA."},{"key":"key2020122404273882700_b2","doi-asserted-by":"crossref","unstructured":"Feldman, J.\n               , \n                  Liu, N.\n               , \n                  Topaloglu, H.\n                and \n                  Ziya, S.\n                (2014), \u201cAppointment scheduling under patient preference and no-show behavior\u201d, \n                  Operations Research\n               , Vol. 62 No. 4, pp. 794-811.","DOI":"10.1287\/opre.2014.1286"},{"key":"key2020122404273882700_b3","doi-asserted-by":"crossref","unstructured":"Gosavii, A.\n               , \n                  Bandla, N.\n                and \n                  Tapas, K.\n                (2002), \u201cA reinforcement learning approach to a single leg airline revenue management problem with multiple fare classes and overbooking\u201d, \n                  IIE Transactions\n               , Vol. 34 No. 9, pp. 729-742.","DOI":"10.1080\/07408170208928908"},{"key":"key2020122404273882700_b4","doi-asserted-by":"crossref","unstructured":"Gupta, D.\n                and \n                  Denton, B.\n                (2008), \u201cAppointment scheduling in health care: challenges and opportunities\u201d, \n                  IIE Transactions\n               , Vol. 40 No. 9, pp. 800-819.","DOI":"10.1080\/07408170802165880"},{"key":"key2020122404273882700_b5","doi-asserted-by":"crossref","unstructured":"Gupta, D.\n                and \n                  Wang, L.\n                (2008), \u201cRevenue management for a primary-care clinic in the presence of patient choice\u201d, \n                  Operations Research\n               , Vol 56 No. 3, pp. 576-592.","DOI":"10.1287\/opre.1080.0542"},{"key":"key2020122404273882700_b6","doi-asserted-by":"crossref","unstructured":"He, M.\n               , \n                  Zhao, L.\n                and \n                  Powell, W.B.\n                (2012), \u201cApproximate dynamic programming algorithms for optimal dosage decisions in controlled ovarian hyperstimulation\u201d, \n                  European Journal of Operational Research\n               , Vol. 222 No. 2, pp. 328-340.","DOI":"10.1016\/j.ejor.2012.03.049"},{"key":"key2020122404273882700_b7","doi-asserted-by":"crossref","unstructured":"Klassen, K.J.\n                and \n                  Rohleder, T.R.\n                (1996), \u201cScheduling outpatient appointments in a dynamic environment\u201d, \n                  Journal of Operations Management\n               , Vol. 14 No. 2, pp. 83-101.","DOI":"10.1016\/0272-6963(95)00044-5"},{"key":"key2020122404273882700_b8","doi-asserted-by":"crossref","unstructured":"Klassen, K.J.\n                and \n                  Yoogalingam, R.\n                (2013), \u201cAppointment system design with interruptions and physician lateness\u201d, \n                  International Journal of Operations & Production Management\n               , Vol. 33 No. 4, pp. 394-414.","DOI":"10.1108\/01443571311307253"},{"key":"key2020122404273882700_b9","doi-asserted-by":"crossref","unstructured":"Lin, J.\n               , \n                  Muthuraman, K.\n                and \n                  Lawley, M.\n                (2011), \u201cOptimal and approximate algorithms for sequential clinical scheduling with no-shows\u201d, \n                  IIE Transactions on Healthcare Systems Engineering\n               , Vol. 1 No. 1, pp. 20-36.","DOI":"10.1080\/19488300.2010.549927"},{"key":"key2020122404273882700_b10","doi-asserted-by":"crossref","unstructured":"Liu, N.\n                and \n                  Ziya, S.\n                (2014), \u201cPanel size and overbooking decisions for appointment-based services under patient no-shows\u201d, \n                  Production and Operations Management\n               , Vol. 23 No. 12, pp. 2209-2223.","DOI":"10.1111\/poms.12200"},{"key":"key2020122404273882700_b11","doi-asserted-by":"crossref","unstructured":"Liu, Q.\n                and \n                  van Ryzin, G.\n                (2008), \u201cOn the choice-based linear programming model for network revenue management\u201d, \n                  Manufacturing & Service Operations Management\n               , Vol. 10 No. 2, pp. 288-310.","DOI":"10.1287\/msom.1070.0169"},{"key":"key2020122404273882700_b12","doi-asserted-by":"crossref","unstructured":"Meissner, J.\n                and \n                  Strauss, A.\n                (2012), \u201cNetwork revenue management with inventory-sensitive bid prices and customer choice\u201d, \n                  European Journal of Operational Research\n               , Vol. 216 No. 2, pp. 459-468.","DOI":"10.1016\/j.ejor.2011.06.033"},{"key":"key2020122404273882700_b13","doi-asserted-by":"crossref","unstructured":"Powell, W.B.\n                (2011), \n                  Approximate Dynamic Programming: Solving the curses of Dimensionality\n               , 2nd ed., John Wiley \n\t\t\t\t\t&\n\t\t\t\t Sons, Hoboken, NJ.","DOI":"10.1002\/9781118029176"},{"key":"key2020122404273882700_b14","doi-asserted-by":"crossref","unstructured":"Qu, X.\n                and \n                  Shi, J.\n                (2011), \u201cModeling the effect of patient choice on the performance of open access scheduling\u201d, \n                  International Journal of Production Economics\n               , Vol. 129 No. 2, pp. 314-327.","DOI":"10.1016\/j.ijpe.2010.11.006"},{"key":"key2020122404273882700_b15","doi-asserted-by":"crossref","unstructured":"Robinson, L.W.\n                and \n                  Chen, R.R.\n                (2003), \u201cScheduling doctors\u2019 appointments: optimal and empirically-based heuristic policies\u201d, \n                  IIE Transactions\n               , Vol. 35 No. 3, pp. 295-307.","DOI":"10.1080\/07408170304367"},{"key":"key2020122404273882700_b16","doi-asserted-by":"crossref","unstructured":"Sch\u00fctz, H.-J.\n                and \n                  Kolisch, R.\n                (2012), \u201cApproximate dynamic programming for capacity allocation in the service industry\u201d, \n                  European Journal of Operational Research\n               , Vol. 218 No. 1, pp. 239-250.","DOI":"10.1016\/j.ejor.2011.09.007"},{"key":"key2020122404273882700_b116","unstructured":"Sheng, L.\n               , et al. (2013), \n                  China Statistical Yearbook\n               , China Statistics Press, Beijing."},{"key":"key2020122404273882700_b17","doi-asserted-by":"crossref","unstructured":"Talluri, K.\n                and \n                  Van Ryzin, G.\n                (2004), \u201cRevenue management under a general discrete choice model of consumer behavior\u201d, \n                  Management Science\n               , Vol. 50 No. 1, pp. 15-33.","DOI":"10.1287\/mnsc.1030.0147"},{"key":"key2020122404273882700_b18","doi-asserted-by":"crossref","unstructured":"Vermeulen, I.\n               , \n                  Bohte, S.\n               , \n                  Bosman, P.\n               , \n                  Elkhuizen, S.\n               , \n                  Bakker, P.\n                and \n                  La Poutr\u00e9, J.\n                (2009), \u201cOptimization of online patient scheduling with urgencies and preferences\u201d, in \n                  Combi, C.\n               , \n                  Shahar, Y.\n                and \n                  Abu-Hanna, A.\n                (Eds), \n                  Artificial Intelligence in Medicine\n               , Springer \n               Berlin and Heidelberg, pp. 71-80.","DOI":"10.1007\/978-3-642-02976-9_9"},{"key":"key2020122404273882700_b19","doi-asserted-by":"crossref","unstructured":"Wang, W.-Y.\n                and \n                  Gupta, D.\n                (2011), \u201cAdaptive appointment systems with patient preferences\u201d, \n                  Manufacturing & Service Operations Management\n               , Vol 13 No. 3, pp. 373-389.","DOI":"10.1287\/msom.1110.0332"},{"key":"key2020122404273882700_b20","doi-asserted-by":"crossref","unstructured":"Zhang, D.\n                and \n                  Adelman, D.\n                (2009), \u201cAn approximate dynamic programming approach to network revenue management with customer choice\u201d, \n                  Transportation Science\n               , Vol 43 No. 3, pp. 381-394.","DOI":"10.1287\/trsc.1090.0262"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IMDS-12-2014-0372","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-12-2014-0372\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-12-2014-0372\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:54:14Z","timestamp":1753394054000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/115\/4\/700-717\/178537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,11]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5,11]]}},"alternative-id":["10.1108\/IMDS-12-2014-0372"],"URL":"https:\/\/doi.org\/10.1108\/imds-12-2014-0372","relation":{},"ISSN":["0263-5577"],"issn-type":[{"value":"0263-5577","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5,11]]}}}