A tactical operating theatre planning problem

Fei, Hongying;Chu, Chengbin;Meskens, Nadine
(2006) Applied Mathematical Programming and Modelling (APMOD) — Location: Madrid, Espagne

Files

No attached file found for this publication.

Details

Authors
  • Fei, HongyingFUCaM
    Author
  • Chu, Chengbin
    Author
  • Meskens, Nadineorcid-logoUCLouvain
    Author
Abstract
(en) The objective of this paper is to maximize the operating room utilization and minimize the overtime operating cost. To deal with this problem, we formulate it as an integer programming and then solve its linear relaxation by an explicit column generation procedure. On the basis of the optimal solution of its linear relaxation, we propose several heuristic procedures, differing from each other in the selection of basic columns (each represents a partial plan for one operating room in one day), to obtain approximate solutions. Finally, a set of examples, in which data are randomly generated, are tested in order to compare the results of the proposed heuristic procedures.
Affiliations
  • Louvain School of Management

Citations

  • APA
  • Chicago
  • FWB

Fei, H., Chu, C., & Meskens, N. (2006). A tactical operating theatre planning problem. Applied Mathematical Programming and Modelling (APMOD), Madrid, Espagne. https://hdl.handle.net/2078.5/128905