Intelligent Scheduling of Medical Procedures

[1]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[2]  Ravi Sethi,et al.  Scheduling Graphs on Two Processors , 1976, SIAM J. Comput..

[3]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[4]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[5]  M Okada,et al.  Prolog-based system for nursing staff scheduling implemented on a personal computer. , 1988, Computers and biomedical research, an international journal.

[6]  I Ozkarahan,et al.  A disaggregation model of a flexible nurse scheduling support system. , 1991, Socio-economic planning sciences.

[7]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[8]  Walter H. Kohler,et al.  A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems , 1975, IEEE Transactions on Computers.

[9]  Jonathan Jingsheng Shi,et al.  EXACT ALGORITHM FOR SOLVING PROJECT SCHEDULING PROBLEMS UNDER MULTIPLE RESOURCE CONSTRAINTS , 2005 .

[10]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

[11]  Gary M. Thompson.  A simulated-annealing heuristic for shift scheduling using non-continuously available employees , 1996, Comput. Oper. Res..

[12]  Terry R. Rakes,et al.  A mathematical model for scheduling and staffing multiclinic health regions , 1989 .

[13]  Arno Sprecher,et al.  Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements , 2000 .

[14]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[15]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[16]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[17]  Uwe Aickelin,et al.  Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem , 2000, ArXiv.

[18]  Z. A. Lomnicki.  A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .

[19]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[20]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[21]  Willem Selen,et al.  A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem , 1986 .

[22]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[23]  Peter Brucker,et al.  A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..

[24]  Singiresu S. Rao.  Engineering Optimization : Theory and Practice , 2010 .

[25]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[26]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[27]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[28]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[29]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[30]  Maurice Queyranne,et al.  Dynamic Multipriority Patient Scheduling for a Diagnostic Resource , 2008, Oper. Res..

[31]  Willy Herroelen,et al.  Resource-constrained Project Scheduling — The State of the Art , 1972 .

[32]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[33]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[34]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[35]  Subhash C. Sarin,et al.  Scheduling heuristic for the n-jobm-machine flow shop , 1993 .

[36]  Michael M. Rachlis.  Public Solutions to Health Care Wait Lists , 2005 .

[37]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[38]  Y Cengiz Toklu.  Application of genetic algorithms to construction scheduling with or without resource constraints , 2002 .

[39]  Roger L. Sisson,et al.  Methods of Sequencing in Job Shops---A Review , 1959 .

[40]  Peter I. Cowling,et al.  A Memetic Approach to the Nurse Rostering Problem , 2001, Applied Intelligence.

[41]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[42]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[43]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[44]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[45]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[46]  Harvey H. Millar,et al.  Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming , 1998 .

[47]  Jouko J. Seppänen,et al.  Facilities Planning with Graph Theory , 1970 .

[48]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[49]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[50]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[51]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[52]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..

[53]  F. F. Boctor,et al.  Some efficient multi-heuristic procedures for resource-constrained project scheduling , 1990 .

[54]  Sönke Hartmann,et al.  A self‐adapting genetic algorithm for project scheduling under resource constraints , 2002 .

[55]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

[56]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[57]  Brigitte Jaumard,et al.  A generalized linear programming model for nurse scheduling , 1996, Eur. J. Oper. Res..

[58]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[59]  Francisco Ballestín,et al.  Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..

[60]  Sabah U. Randhawa,et al.  A heuristic-based computerized nurse scheduling system , 1993, Comput. Oper. Res..

[61]  Radivoj Petrovic.  Optimization of Resource Allocation in Project Planning , 1968, Oper. Res..

[62]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[63]  Rubén Ruiz,et al.  Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics , 2005, Eur. J. Oper. Res..

[64]  Robert Klein,et al.  Project scheduling with time-varying resource constraints , 2000 .

[65]  Saïd Salhi,et al.  A Tabu Search Approach for the Resource Constrained Project Scheduling Problem , 1998, J. Heuristics.

[66]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[67]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

[68]  Kenneth R. Baker,et al.  A Comparative Study of Flow-Shop Algorithms , 1975, Oper. Res..

[69]  J. W. Pocock.  PERT as an Analytical Aid for Program Planning—Its Payoff and Problems , 1962 .

[70]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[71]  Wlodzimierz Szwarc.  Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem , 1973, Oper. Res..

[72]  Czeslaw Smutnicki,et al.  Some results of the worst-case analysis for flow shop scheduling , 1998, Eur. J. Oper. Res..

[73]  Jeremy Hurst,et al.  Tackling Excessive Waiting Times for Elective Surgery: A Comparison of Policies in Twelve OECD Countries , 2003 .

[74]  Irem Ozkarahan,et al.  Allocation of surgical procedures to operating rooms , 1995, Journal of Medical Systems.

[75]  Concepción Maroto,et al.  A Robust Genetic Algorithm for Resource Allocation in Project Scheduling , 2001, Ann. Oper. Res..

[76]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

[77]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[78]  V J Rayward-Smith.  Project Scheduling: Recent Models, Algorithms and Applications , 2001, J. Oper. Res. Soc..

[79]  Richard M. Van Slyke,et al.  Letter to the Editor---Monte Carlo Methods and the PERT Problem , 1963 .

[80]  Hong-Chao Zhang,et al.  A hybrid-graph approach for automated setup planning in CAPP , 1999 .

[81]  Paul Shreve,et al.  Positron emission tomography-computed tomography patient management and workflow. , 2008, Seminars in ultrasound, CT, and MR.

[82]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[83]  Ali Jaafari.  Criticism of CPM for Project Planning Analysis , 1984 .

[84]  Krzysztof Fleszar,et al.  An evolutionary algorithm for resource-constrained project scheduling , 2002, IEEE Trans. Evol. Comput..

[85]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[86]  On the Mathematical Theory of Schedules , 1964 .

[87]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[88]  Larry W. Jacobs,et al.  Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations , 1995 .

[89]  C M Flood,et al.  The illegality of private health care in Canada. , 2001, CMAJ : Canadian Medical Association journal = journal de l'Association medicale canadienne.

[90]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[91]  Jacques A. Ferland,et al.  A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints , 1996 .

[92]  Michael M. Kostreva,et al.  Nurse scheduling on a microcomputer , 1991, Comput. Oper. Res..

[93]  Arben Asllani,et al.  Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming , 2004 .

[94]  Jatinder N. D. Gupta,et al.  An empirical analysis of integer programming formulations for the permutation flowshop , 2004 .

[95]  G. Chartrand.  Introductory Graph Theory , 1984 .

[96]  Hans J. Laue,et al.  Efficient methods for the allocation of resources in project networks , 1968, Unternehmensforschung.

[97]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[98]  Christopher Michael Clark,et al.  An adaptive niching genetic algorithm approach for generating multiple solutions of serial manipulator inverse kinematics with applications to modular robots , 2009, Robotica.

[99]  Helena Ramalhinho Dias Lourenço,et al.  Sevast'yanov's algorithm for the flow-shop scheduling problem , 1996 .

[100]  Jatinder N. D. Gupta,et al.  A review of flowshop scheduling research , 1979 .

[101]  I. Kurtulus,et al.  Multi-Project Scheduling: Categorization of Heuristic Rules Performance , 1982 .

[102]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[103]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[104]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[105]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[106]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[107]  Fan T. Tseng,et al.  Two models for a family of flowshop sequencing problems , 2002, Eur. J. Oper. Res..

[108]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .