Operating theatre planning

International Journal of Production Economics

Volumn 85, Issue 1, 2003, Pages 69-81

  Guinet, Alain ^a   Chaabane, Sondes ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Assignment problem; Capacity constraint production planning with fixed costs; Heuristics; Hospital planning; Network programming

Indexed keywords

CONSTRAINT THEORY; COSTS; DATA REDUCTION; HEURISTIC METHODS; HOSPITAL BEDS; OPERATING ROOMS; PATIENT TREATMENT; PROBLEM SOLVING;

ASSIGNMENT PROBLEMS; CAPACITY CONSTRAINT PRODUCTION PLANNING WITH FIXED COSTS; HOSPITAL PLANNING; NETWORK PROGRAMMING;

PLANNING;

EID: 0344717619     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(03)00087-2     Document Type: Conference Paper

References (21)

1. Beresniak, A., Duru, G., 1995. Economie de la Santé. Editions Masson, Paris.
2. Botta-Genoulaz, V., 1996. Planning and Scheduling Flow Shops Organisations with Constraints, Ph.D. Thesis (Claude Bernard-Lyon I University, Lyon 1), English version available.
3. Cheng T.C.E., Sin C.C.S. A state of art of parallel machine scheduling research. European Journal of Operational Research. 47:1990;271-292.
4. Claveranne, J.P., Lardy, C., 1999. La Santé Demain vers un Système de Santé Sans Murs, 10ème Entretiens du Centre J. Cartier, Rhône-Alpes, Editions Economica, Paris.
5. Cremadez, M., Grateau, F., 1997. Le Management Stratégique Hospitalier, Editions Masson, Paris.
6. Dexter F. A strategy to decide whether to move the last case of the day in an operating room to an other empty operating room to decrease overtime labour costs. Anaesthesia and Analgesia. 91:2000;925-928.
7. Dexter F., Macario A. Applications of information systems to operating room scheduling. Anaesthesiology. 85:1996;1232-1234.
8. Dexter F., Macario A. Decrease in case duration required to complete an additional case during regularly scheduled hours in an operating room suite. A computer simulation study Anaesthesia and Analgesia. 88:1999;72-76.
9. Garfinkel, R.S., Nemhauser, G.L., 1972. Integer Programming, Wiley, New York.
10. Gilmore P.C., Gomory R.E. Sequencing a one state variable machine. A solvable case of travelling salesman problem Operations Research. 12:1964;655-679.
11. Guinet A. Scheduling jobs on identical parallel machines to minimise completion date criteria. International Journal of Production Research. 31:1993;1579-1594.
12. Guinet, A., 2001. A linear programming approach to define the operating room opening hours, Integrated Design and Production CPI 2001, Fez (Morocco), 24-26 October, Vol. 29, pp. 1-10.
13. Hall N.G., Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research. 44:1996;510-525.
14. Kuhn H.W. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly. 2:1955;83-98.
15. Marcon E., Kharraja S., Simonnet G. The operating theatre scheduling. An approach centred on the follow-up of the risk of non-realisation of the planning, IEPM 2001 Industrial Engineering and Production Management Conference Québec in Proceedings. 1:2001;178-187.
16. Rajendran C. A no-wait flow-shop scheduling heuristic to minimise makespan. Journal of Operational Research Society. 45:1994;472-478.
17. Roth A.V., Van Dierdonck R. Hospital resource planning. Concepts, feasibility and framework Production and Operations Management. 4:1995;2-29.
18. Sriskandarajah C. Performance of scheduling algorithms for no-wait flow-shops with parallel machines. European Journal of Operational Research. 70:1993;365-378.
19. Wright I.H., Kooperberg C., Bonar B.A., Bashein G. Statistical modelling to predict elective surgery time. Anaesthesiology. 85:1996;1235-1245.
20. Wright M.B. The application of a surgical bed simulation model. European Journal of Operational Research. 32:1987;26-32.
21. Zhou J., Dexter F. Method to assist in the scheduling of add-on surgical cases, upper prediction bounds for surgical case durations based on the log-normal distribution. Anaesthesiology. 89:1998;1228-1232.