References
- BeliënJExact and heuristic methodologies for scheduling in hospitals: Problems, formulations and algorithms4OR-Q J Oper Res2007515716010.1007/s10288-006-0006-4
- BeliënJDemeulemeesterEA branch-and-price approach for integrating nurse and surgery schedulingEur J Opl Res200818965266810.1016/j.ejor.2006.10.060
- BurkeEKDe CausmaeckerPVanden BergheGNovel metaheuristic approaches to nurse rostering problems in Belgian hospitalsHandbook of Scheduling: Algorithms, Models and Performance Analysis2004118
- BurkeEKDe CausmaeckerPPetrovicSVanden BergheGMetaheuristics for handling time interval coverage constraints in nurse schedulingAppl Artif Intell20062074376610.1080/08839510600903841
- CheangBLiHLimARodriguesBNurse rostering problems—a bibliographic surveyEur J Opl Res200315144746010.1016/S0377-2217(03)00021-3
- ChernCCChienPSChenSYA heuristic algorithm for the hospital health examination scheduling problemEur J Opl Res20081861137115710.1016/j.ejor.2007.02.029
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- GodartDLaborieFNuijtenWRandomized large neighborhood search for cumulative schedulingProceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS)20058189
- HansenPMladenovićNAn introduction to variable neighborhood searchMetaheuristic: Advances and Trends in Local Search Paradigms for Optimization1999433458
- HansenPMladenovićNVariable neighbourhood search: Principles and applicationsEur J Opl Res200113044946710.1016/S0377-2217(00)00100-4
- HansenPMladenovićNVariable neighborhood searchHandbook of Applied Optimization2002221234
- HansenPMladenovićNVariable neighborhood searchHandbook of Metaheuristics2003145184
- KrempelsKHPanchenkoAAn approach for automated surgery schedulingProceedings of the Sixth International Conference on the Practice and Theory of Automated Timetabling (PATAT), Brno2006209233
- MladenovićNHansenPVariable neighborhood searchComput Opl Res1997241097110010.1016/S0305-0548(97)00031-2
- MooneyELRardinRLTabu search for a class of scheduling problemsAnn Opns Res19934125327810.1007/BF02023077
- NegenmanEGLocal search algorithms for the multiprocessor flow shop scheduling problemEur J Opl Res200112814715810.1016/S0377-2217(99)00354-9
- NuijtenWLe PapeCConstraint-based job shop scheduling with ILOG SCHEDULERJ Heuristics1998327128610.1023/A:1009687210594
- OğuzCFikret ErcanMScheduling multiprocessor tasks in a two-stage flow-shop environmentComput Ind Eng19973326927210.1016/S0360-8352(97)00090-9
- SierDTobinPMcGurkCScheduling surgical proceduresJ Opl Res Soc19974888489110.1057/palgrave.jors.2600441
- SouzaMCMartinsPSkewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problemEur J Opl Res200819167769010.1016/j.ejor.2006.12.061
- Van OostrumJMVan HoudenhovenMHurinkJLHansEWWullinkGKazemierGA master surgical scheduling approach for cyclic scheduling in operating room departmentsOR Spektrum20083035537410.1007/s00291-006-0068-x
- VasilakisCSobolevBGKuramotoLLevyARA simulation study of scheduling clinic appointments in surgical care: Individual surgeon versus pooled listsJ Opl Res Soc20075820221110.1057/palgrave.jors.2602235
- Vlah S and Lukač Z (2005). A doctor–patient-treatment problem arising in hospitals. Presented at the Eighteenth Mini EURO Conference on Variable Neighbourhood Search (MECVNS), Puerto de la Cruz, Tenerife.