Operating theatre scheduling under constraints

被引：10
作者：
Dekhici L. [1 ]
Belkadi K. [1 ]
机构：
[1] LAMOSI Laboratory, Department of Computer Science, Faculty of Sciences, University of Sciences and Technology, Oran USTO, Oran M'Naouer 31000
来源：
Journal of Applied Sciences | 2010年 / 10卷 / 14期
关键词：
Constraints satisfaction; Hybrid flowshop; Local search; Precedence constraint; Surgeries; Tabu search;
D O I：
10.3923/jas.2010.1380.1388
中图分类号：
学科分类号：
摘要：
We present in this study some manufacturing systems scheduling constraints that we adapt to the operating theatre scheduling. The scheduling that should comply with all operating constraints, related to quality, to patients and numerous resources information can be considered as a two-stage hybrid flow shop problem without buffer. We confirmed the existence of the constraints after a large study with operating theatre managers at several hospitals. For resolution, we use two methods: Local search for constraint satisfaction in the initial feasible solution and Tabu search with restricted neighborhood system for Makespan Optimization. In one hand, we use yearly data from an existing multidisciplinary which has 3 operating rooms and 9 beds and releases 10 surgeries per day. In the other hand, we schedule others examples with different variables. The amelioration rates of both makespan and constraints conflict were interessting according to program execution time. © 2010 Asian Network for Scientific Information.
引用
收藏
页码：1380 / 1388
页数：8
相关论文
共 40 条
  • [1] Abadi I.N.K., Hall G.N., Sriskandarajah C., Minimizing cycle time in a blocking flowshop, Operat Res, 48, pp. 177-180, (2000)
  • [2] Alem-Tabriz A., Zandieh M., Vaziri Z., A novel simulated annealing algorithm to hybrid flow shops scheduling with sequence-dependent setup times, J. Applied Sci, 10, pp. 1943-1949, (2009)
  • [3] Baker K.R., Introduction to Sequencing and Scheduling, (1974)
  • [4] Baptiste P., Le Pape C., Nuijten W., Constraint-Based Scheduling Problems, (2001)
  • [5] Belkadi K., Gourgand M., Benyettou M., Resolution of scheduling problem of the production systems by sequential and parallel tabu search, J. Applied Sci, 6, pp. 1534-1539, (2006)
  • [6] Botta-Genoulaz V., Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness, Int. J. Prod. Econ, 64, pp. 101-111, (2000)
  • [7] Buten R.E., Shen V.Y., A scheduling model for computer systems with two classes of processors, Proceedings of 1973 Sagamore Computer Conference Parallel Processing, pp. 130-138, (1973)
  • [8] Cardoen B., Demeulemeester E., Belien J., Sequencing surgical cases in a day-care environment: An exact branch-and-price approach, Comput. Operations Res, 36, pp. 2660-2669, (2009)
  • [9] Cardoen B., Demeulemeester E., Belien J., Optimizing a multiple objective surgical case sequencing problem, Int. J. Prod. Econ, 119, pp. 354-366, (2009)
  • [10] Cardoen B., Demeulemeester E., Belien J., Operating room planning and scheduling: A literature review, Eur. J. Operational Res, 201, pp. 921-932, (2010)
1234