The endoscopy scheduling problem: A case study with two specialised operating rooms

被引：21

作者：

Fei, Hongying ^{[1
]}

Meskens, Nadine ^{[1
]}

Combes, Catherine ^{[2
]}

Chu, Chengbin ^{[3
]}

机构：

[1] Catholic Univ Mons, Louvain Sch Management, B-7000 Mons, Belgium

[2] Univ St Etienne, Univ Lyon, Hubert Curien Lab, CNRS,UMR 5516, F-42023 St Etienne 2, France

[3] Ecole Cent Paris, Lab Genie Ind, F-92295 Chatenay Malabry, France

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2009年 / 120卷 / 02期

关键词：

Endoscopy centre; Planning; Scheduling; Column-generation; Open shop; PARALLEL MACHINES; ALGORITHM; TIME;

D O I：

10.1016/j.ijpe.2007.09.016

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This research aims to build a feasible and efficient operating program for an endoscopy centre composed of two specialised operating rooms for one week, with the objective of both maximising the utilisation of the operating room and minimising the cost of overtime. First, a tactical planning model was built and solved by a column-generation-based heuristic (CGBH) procedure. Then, a daily scheduling problem is solved by the Gonzalez-Sahni algorithm in order to schedule the surgical cases assigned at the planning stage. Experimental data are randomly generated according to parameters derived from the Croix-Rousse tertiary hospital centre in Lyon, France. (C) 2009 Elsevier B.V. All rights reserved.

引用

页码：452 / 462

页数：11

共 21 条

[1] Scheduling identical parallel machines to minimize total tardiness [J].

Biskup, Dirk ;

Herrmann, Jan ;

Gupta, Jatinder N. D. .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 115 (01) :134-142

[2] Two-machine open shop scheduling with an availability constraint [J].

Breit, J ;

Schmidt, G ;

Strusevich, VA .

OPERATIONS RESEARCH LETTERS, 2001, 29 (02) :65-77

[3] Using a KDD process to forecast the duration of surgery [J].

Combes, C. ;

Meskens, N. ;

Rivat, C. ;

Vandamme, J. -P. .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (01) :279-293

[4]

COMBES C, 2004, DEMARCHE METHODOLOGI

[5] DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].

DANTZIG, GB ;

WOLFE, P .

OPERATIONS RESEARCH, 1960, 8 (01) :101-111

[6]

De Carvalho J. M. V., 1998, International Transactions in Operational Research, V5, P35, DOI 10.1016/S0969-6016(97)00044-0

[7] Which algorithm for scheduling add-on elective cases maximizes operating room utilization? Use of bin packing algorithms and fuzzy constraints in operating room management [J].

Dexter, F ;

Macario, A ;

Traub, RD .

ANESTHESIOLOGY, 1999, 91 (05) :1491-1500

[8] How to schedule elective surgical cases into specific operating rooms to maximize the efficiency of use of operating room time [J].

Dexter, F ;

Traub, RD .

ANESTHESIA AND ANALGESIA, 2002, 94 (04) :933-942

[9]

Dexter Franklin, 2005, J Perianesth Nurs, V20, P92

[10] Solving surgical cases assignment problem by a branch-and-price approach [J].

Fei, H. ;

Chu, C. ;

Meskens, N. ;

Artiba, A. .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (01) :96-108

← 1 2 3 →