title: A note on the full-neighborhood search of Kaandorp and Koole (2007).
abstract: We give an efficient method for enumerating Kaandorp and Koole's (2007; Health Care Mgmt Sci 10:217-229) "full neighborhood" of candidate improvement schedules employed by their algorithm's local search for the optimal outpatient appointment schedule. A proposition is given that the first appointment interval is always used in the optimal schedule; this allows convenient indexing within our method.
authors.affiliation: Zicklin School of Business, Baruch College, One Bernard Baruch Way, Box B9-240, New York, NY, USA. william.millhiser@baruch.cuny.edu.
authors.forename: William P
authors.identifier: http://orcid.org/0000-0003-3454-9934
authors.initials: WP
authors.lastname: Millhiser
mesh_terms: D000465:Algorithms; D001071:Appointments and Schedules; D017598:Efficiency, Organizational; D006801:Humans; D015233:Models, Statistical; D010045:Outpatients
keywords: Local search; Outpatient services; Patient scheduling