Analysis via goal programming of the minimum achievable stay in surgical waiting lists

被引:19
作者
Arenas, M
Bilbao, A
Caballero, R
Gómez, T
Rodríguez, MV
Ruiz, F
机构
[1] Univ Malaga, Dept Econ Aplicada Matemat, Malaga 29701, Spain
[2] Univ Oviedo, Oviedo, Spain
关键词
goal programming; hospitals; health service;
D O I
10.1057/palgrave.jors.2601310
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, a Goal Programming model is developed in order to study the possibility of decreasing the length of stay on the waiting list of a hospital that belongs to the Spanish Health Service. First, a problem is solved to determine the optimal planning for one year, so as to make the maximum waiting time decrease to six months (at present, some operations have a waiting list of more than a year). Afterwards, two other problems are solved in order to determine the impact that a further reduction of the waiting time (four months) would have on the requirements of extra resources for the hospital. The particular problem for the Trauma service is described in detail, but global results are shown and commented.
引用
收藏
页码:387 / 396
页数:10
相关论文
共 6 条
[1]  
[Anonymous], ADV MATH PROGRAMMING
[2]   NUCLEOTIDE-SEQUENCE OF A SINGAPORE ISOLATE OF ZUCCHINI YELLOW MOSAIC-VIRUS COAT PROTEIN GENE REVEALED AN ALTERED DAG MOTIF [J].
LEE, SC ;
WU, M ;
WONG, SM .
VIRUS GENES, 1993, 7 (04) :381-387
[3]  
MARTIN J, 2000, RECENT DEV APPL DECI, P459
[4]  
URIA MVR, 1999, QUANTITATIVE DECISIO
[5]  
URIA MVR, 1998, 9817 ICAE U COMPL
[6]  
URIA MVR, 1997, ADV MULTIOBJECTIVE G, P57