Scheduling operating theatres: Mixed integer programming vs. constraint programming

•We model the problem with mixed integer programming and constraint programming.•The two models are presented in detail and compared on real data.•We take into account the affinity relationships between surgical team members. The daily scheduling of an operating theatre is a highly constrained probl...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 247; číslo 2; s. 401 - 413
Hlavní autori: Wang, Tao, Meskens, Nadine, Duvivier, David
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.12.2015
Elsevier Sequoia S.A
Elsevier
Predmet:
Combinatorial optimization
Computer Science
Constraints satisfaction
Integer programming
Job shops
Linear programming
Mathematical functions
Modeling and Simulation
Models comparison
OR in health services
Priorities
Resource management
Scheduling
Studies
Surgeons
Linear programming
Combinatorial optimization
Models comparison
OR in health services
Constraints satisfaction
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•We model the problem with mixed integer programming and constraint programming.•The two models are presented in detail and compared on real data.•We take into account the affinity relationships between surgical team members. The daily scheduling of an operating theatre is a highly constrained problem. In addition to standard scheduling constraints, many additional constraints on human and material resources encountered in real life should be taken into account. These constraints concern the priority of operations, the affinities between surgical team members, renewable and non-renewable resources, various sizes in the block scheduling strategy, and the surgical team's preferences/availabilities. We developed two models in our research work, using mixed-integer and constraint programming respectively. These were compared using a real-life case in order to determine which one coped better with a highly constrained problem. A cross-comparison of the experimental results shows that the mixed-integer programming model provides a better performance using the weighted sum objective function than using the makespan minimization objective function. Conversely, the constraint programming model is better suited to the makespan minimization objective function than to the weighted sum objective function. The originality of this research lies on three levels: (1) two models are presented in detail and compared using real data; (2) constraint programming is used to schedule the operating theatre; (3) some new constraints are taken into account, such as the affinities between team members in the composition of surgical teams, and the priorities of patients such as diabetics.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2015.06.008