752
Views
34
CrossRef citations to date
0
Altmetric
Original Articles

The traveling therapist scheduling problem

, , &
Pages 683-706 | Received 01 Aug 2012, Accepted 01 Aug 2013, Published online: 28 Mar 2014

References

  • Ahuja , K. , Magnanti , T. L. and Orlin , J. B. 1993 . Network Flows: Theory, Algorithms, and Applications , Englewood Cliffs , NJ : Prentice Hall .
  • Aiken , L. H. , Clarke , S. P. , Sloane , D. M. , Sochalski , J. and Silber , J. H. 2002 . Hospital nurse staffing and patient mortality, nurse burnout, and job dissatisfaction . Journal of the American Medical Association , 288 ( 16 ) : 1987 – 1993 .
  • Baldacci , R. , Mingozzi , A. and Roberti , R. 2011 . New route relaxation and pricing strategies for the vehicle routing problem . Operations Research , 59 ( 5 ) : 1269 – 1283 .
  • Bard , J. F. and Purnomo , H. W. 2005 . Preference scheduling for nurses using column generation . European Journal of Operations Research , 164 ( 2 ) : 510 – 534 .
  • Bard , J. F. , Yu , G. and Arguello , M. F. 2001 . Optimizing aircraft routings in response to groundings and delays . IIE Transactions on Operations Engineering , 33 ( 10 ) : 931 – 947 .
  • Barnhart, , C. , Hane , A. C. and Vance , H. P . 2000 . Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems . Operations Research , 48 ( 2 ) : 318 – 326 .
  • Begur , S. V. , Miller , D. M. and Weaver , J. R. 1997 . An integrated spatial DSS for scheduling and routing home-health-care nurses . Interfaces , 27 ( 4 ) : 35 – 48 .
  • Bennett , A. R. and Erera , A. L. 2011 . Dynamic periodic fixed appointment scheduling for home health . IIE Transactions on Healthcare Systems Engineering , 1 ( 1 ) : 6 – 19 .
  • Bertels , S. and Fahle , T. 2006 . A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem . Computers & Operations Research , 33 ( 10 ) : 2866 – 2890 .
  • Bertossi , A. A. , Carraresi , P. and Gallo , G. 1987 . On some matching problems arising in vehicle scheduling models . Networks , 17 ( 3 ) : 271 – 281 .
  • Binaco , L. , Mingozzi , A. and Ricciardelli , S. 1994 . A set partitioning approach to the multiple depot vehicle scheduling problem . Optimization Methods and Software , 3 : 163 – 194 .
  • Boschetti , M. A. , Mingozzi , A. and Ricciardelli , S. 2004 . An exact algorithm for the simplified multiple depot crew scheduling problem . Annals of Operations Research , 127 : 177 – 201 .
  • Brunner , J. O. , Bard , J. F. and Kolisch , R. 2011 . Midterm physician scheduling with flexible shifts using branch-and-price . IIE Transactions on Operations Engineering & Analysis , 43 ( 2 ) : 84 – 109 .
  • Carpaneto , G. , Dell’Amico , M. , Fischetti , M. and Toth , P. 1989 . A branch and bound algorithm for the multiple vehicle scheduling problem . Networks , 19 : 531 – 548 .
  • Cheng , E. and Rich , J. L. 1998 . A home health care routing and scheduling problem , Houston , TX : Tech Report Tr. 98-04, Computational and Applied Mathematics, Rice University . Available at http://www.caam.rice.edu/tech_reports/1998.html.
  • Creemers , S. , Beliën , J. and Lambrecht , M. 2012 . The optimal allocation of server time slots over different classes of patients . European Journal of Operational Research , 219 ( 3 ) : 508 – 521 .
  • Dell’Amico , M. , Fischetti , M. and Toth , P. 1993 . Heuristic algorithms for the multiple depot vehicle scheduling problem , Bologna , , Italy : Technical report, University of Bologna .
  • Desrochers , M. , Desrosiers , J. and Solomon , M. M. 1992 . A new algorithm for the vehicle routing problem with time windows . Operations Research , 40 ( 2 ) : 342 – 355 .
  • Desrosiers , J. , Dumas , Y. , Solomon , M. M. and Soumis , F. 1995 . “ Time constrained routing and scheduling ” . In Handbooks in Operations Research and Management Science, Vol. 8, Network Routing , Edited by: Ball , M. O. , Magnanti , T. L. , Monma , C. L. and Nemhauser , G. L. 35 – 139 . Amsterdam , , The Netherlands : North-Holland .
  • Du Merle , O. , Villeneuve , D. , Desrosiers , J. and Hansen , P. 1999 . Communication stabilized column generation . Discrete Mathematics , 194 : 229 – 237 .
  • Eveborn , P. , Flisberg , P. and Rönnqvist , M. 2006 . LAPS CARE—an operational system for staff planning of home care . European Journal of Operational Research , 171 ( 3 ) : 962 – 976 .
  • Feo , T. A. and Resende , M. G.C. 1995 . Greedy randomized adaptive search procedure . Journal of Global Optimization , 2 : 1 – 27 .
  • Fischetti , M. , Lodi , A. , Martello , S. and Toth , P. 2001 . A polyhedral approach to simplified crew scheduling and vehicle scheduling problems . Management Science , 47 : 833 – 850 .
  • Garey , M. R. , Tarjan , R. E. and Wilforg , G. T. 1988 . One processor scheduling with symmetric earliness and tardiness penalties . Mathematics of Operations Research , 13 : 330 – 348 .
  • Green , L. V. and Savin , S. 2008 . Reducing delays for medical appointments: a queueing approach . Operations Research , 56 ( 6 ) : 1525 – 1538 .
  • Gupta , D. and Denton , B. 2008 . Appointment scheduling in health care: challenges and opportunities . IIE Transaction on Operations Engineering , 40 ( 9 ) : 800 – 819 .
  • Hadjar , A. , Marcotte , O. and Soumis , F. 2006 . A branch-and-cut algorithm for the multiple-depot vehicle scheduling problem . Operations Research , 54 ( 1 ) : 130 – 149 .
  • Hertz , A. and Lahrichi , N. 2009 . A patient assignment algorithm for home care services . Journal of the Operational Research Society , 60 ( 4 ) : 481 – 495 .
  • Jepsen , M. , Petersen , B. , Spoorendonk , S. and Pisinger , D. 2008 . Subset-row inequalities applied to the vehicle routing problem with time windows . Operations Research , 56 ( 2 ) : 497 – 511 .
  • Kontoravdis , G. and Bard , J. F. 1995 . A GRASP for the vehicle routing problem with time windows . ORSA Journal on Computing , 7 ( 1 ) : 10 – 23 .
  • Lenstra , J. K. and Rinnooy Kan , A. H.G. 1981 . Complexity of vehicle routing and scheduling problems . Networks , 11 : 221 – 228 .
  • Muthuraman , K. and Lawley , M. 2008 . A stochastic overbooking model for outpatient clinical scheduling with no-shows . IIE Transaction on Operations Engineering , 40 ( 9 ) : 820 – 837 .
  • Nemhauser , G. L. and Wolsey , L. A. 1988 . Integer and Combinatorial Optimization , New York , NY : John Wiley & Sons .
  • Patrick , J. , Puterman , M. L. and Queyranne , M. 2008 . Dynamic multipriority patient scheduling for a diagnostic resource . Operations Research , 56 ( 6 ) : 1507 – 1525 .
  • Purnomo , H. W. and Bard , J. F. 2007 . Cyclic preference scheduling for nurses using branch and price . Naval Research Logistics , 54 ( 2 ) : 200 – 220 .
  • Ribeiro , C. C. and Soumis , F. 1994 . A column generation approach to the multiple depot vehicle scheduling problem . Operations Research , 42 ( 1 ) : 41 – 52 .
  • Ryan , D. M. and Foster , B. A. 1981 . “ An integer programming approach to scheduling ” . In Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling , 269 – 280 . Amsterdam : North-Holland .
  • Shao , Y. 2011 . Home therapist network modeling , Austin , TX : Dissertation, Graduate Program in Operations Research & Industrial Engineering, The University of Texas .
  • Shao , Y. , Bard , J. F. and Jarrah , A. I. 2012 . The therapist routing and scheduling problem . IIE Transactions on Operations Engineering & Analysis , 44 ( 10 ) : 868 – 893 .
  • Vanderbeck , F. 2000 . On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm . Operations Research , 48 ( 1 ) : 111 – 128 .
  • Wolsey , L. A. 1998 . Integer Programming , New York , NY : John Wiley & Sons .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.