A Stochastic Model for Prioritized Outpatient Scheduling in a Radiology Center

Document Type : Original Article


1 College of Engineering, Department of Industrial Engineering, Shahed University, Tehran, Iran

2 Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran


This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority. To more compatibility to real-world conditions, we assume that the elapsed times in different stages to be uncertain that follow from the specific distribution function. The objective is to minimize outpatients’ total spent time in a radiology center. The problem is formulated as a flexible open shop scheduling problem and a stochastic programming model. By considering the specific distribution function for uncertain variables, deterministic mixed integer linear programming (MILP) is developed such that the proposed problem can be solved by a linear programming solver in small size. Besides an effective heuristic method is proposed for the moderate size problem. To indicate the applicability of the proposed model, it has been applied to a real radiology center. The results from the proposed optimization models indicate an increase in outpatients’ satisfaction, as well as the improving of the efficiency and productivity of the radiology center.


 1. Gür, Ş., Eren, T., “Application of operational research techniques
in operating room scheduling problems: literature overview”, 
Journal of Healthcare Engineering, (2018).
2. Lee, S., Yih, Y. “Reducing patient-flow delays in surgical suites
through determining start-times of surgical cases”, European
Journal of Operational Research, Vol. 238, No. 2, (2014), 620629.
3. Saadouli, H., Jerbi, B., Dammak, A., Masmoudi, L., & Bouaziz,
A., “A stochastic optimization and simulation approach for
scheduling operating rooms and recovery beds in an orthopedic
surgery department”, Computers and Industrial
Engineering, Vol. 80, (2015), 72-79. 
4. Heydari, M., Soudi, A., “Predictive/reactive planning and
scheduling of a surgical suite with emergency patient
arrival”, Journal of Medical Systems, Vol. 40, No.1, (2016), 30.
5. Jebali, A., Diabat, A., “A stochastic model for operating room
planning under capacity constraints”, International Journal of
Production Research, Vol. 53, No. 24, (2015), 7252-7270. 
6. Min, D., Yih, Y., “An elective surgery scheduling problem
considering patient priority”, Computers and Operations
Research, Vol. 37, No. 6, (2010), 1091-1099. 
7. Shahrestani, K. M., Fattahi, P., Hamedi, M., “A Heuristic Method
for Solving Bi-Objective Two-Stage Hybrid Flow Shop
Scheduling Problem”, Industrial Engineering and Management
Systems, Vol.16, No. 2, (2017), 265-270. 
8. Bai, D., Zhang, Z. H., Zhang, Q., “Flexible open shop scheduling
problem to minimize makespan”, Computers and Operations
Research, Vol. 67, (2016), 207-215. 
9. Van Riet, C., & Demeulemeester, E., “Trade-offs in operating
room planning for electives and emergencies: A review”,
Operations Research for Health Care, Vol. 7, (2015), 52-69. 
10. Kırış, Ş., Yüzügüllü, N., Ergün, N., Çevik, A. A., “A knowledgebased
scheduling system for Emergency Departments”,
Knowledge-Based Systems, Vol. 23, No. 8, (2010), 890-900. 
11. Dexter, F., Dexter, E. U., Ledolter, J., “Influence of procedure
classification on process variability and parameter uncertainty of
surgical case durations”, Anesthesia and Analgesia, Vol.110, No.
4, (2010), 1155-1163. 
12. Stepaniak, P. S., Heij, C., De Vries, G., “Modeling and prediction
of surgical procedure times”, Statistica Neerlandica, Vol. 64, No.
1, (2010), 1-18. 
13. Bowers, J., & Mould, G., “Ambulatory care and orthopaedic
capacity planning”, Health Care Management Science, Vol. 8,
No. 1, (2005), 41-47. 
14. Lamiri, M., Grimaud, F., Xie, X., “Optimization methods for a
stochastic surgery planning problem”, International Journal of
Production Economics, Vol. 120, No. 2, (2009), 400-410. 
15. Zonderland, M. E., Boucherie, R. J., Litvak, N., VleggeertLankamp,
C. L., “Planning and scheduling of semi-urgent
surgeries”, Health Care Management Science, Vol. 13, No. 3,
(2010), 256-267. 
16. Shylo, O. V., Prokopyev, O. A., Schaefer, A. J., “Stochastic
operating room scheduling for high-volume specialties under
block booking”, INFORMS Journal on Computing, Vol. 25, No.
4, (2012), 682-692. 
17. Deng, Y., Shen, S., Denton, B., “Chance-constrained surgery
planning under conditions of limited and ambiguous data”,  
INFORMS Journal on Computing, Vol. 31, No. 3 (2019): 559575.
18. Jebali, A., Diabat, A., “A chance-constrained operating room
planning with elective and emergency cases under downstream
capacity constraints”, Computers and Industrial Engineering,
Vol. 114, (2017), 329-344. 
19. Zhao, Z., & Li, X., “Scheduling elective surgeries with sequencedependent
setup times to multiple operating rooms using
constraint programming”, Operations Research for Health Care,
Vol. 3, No. 3, (2014), 160-167. 
20. Wang, B., Han, X., Zhang, X., Zhang, S., “Predictive-reactive
scheduling for single surgical suite subject to random emergency
surgery”, Journal of Combinatorial Optimization, Vol. 30, No.
4, (2015), 949-966. 
21. Deyi, M., Xiaoqian, Z., “Stochastic programming for the
optimization of transportation-inventory strategy”, Industrial
Engineering and Management Systems, Vol. 16, No. 1, (2017),
22. Seraj, O., Tavakoli, M. R., “A tabu search method for a new biobjective
open shop scheduling problem by a fuzzy multiobjective
decision making approach (research note)”,
International Journal of Engineering, Transactions B:
Applications, Vol. 22, No. 3, (2009), 269-282. 
23. Yazdanparast, S., Sadegheih, A., Fallahnezhad, M., Abooie, M.,
“Modelling and Decision-making on Deteriorating Production
Systems using Stochastic Dynamic Programming Approach”,
International Journal of Engineering, Transactions C: Aspects,
Vol. 31, No. 12, (2018), 2052-2058. 
24. Valinejad, J., Oladi, Z., Barforoshi, T., Parvania, M., “Stochastic
unit commitment in the presence of demand response program
under uncertainties”, International Journal of Engineering,
Transaction B: Applications, Vol. 30, No. 8, (2017), 1134-
25. Butterworth, J. F., Mackey, D. C., Wasnick, J. D., “Morgan &
Mikhail's clinical anesthesiology”, Vol. 15. New York: McGrawHill,
26. Campi, M. C., Garatti, S., “A sampling-and-discarding approach
to chance-constrained optimization: feasibility and optimality”,
Journal of Optimization Theory and Applications, Vol. 148, No.
2, (2011), 257-280. 
27. Wang, K., Choi, S. H. , “A holonic approach to flexible flow shop
scheduling under stochastic processing times”, Computers &
Operations Research, Vol. 43, (2014), 157-168. 
28. Azadeh, A., Rahbar, S. E., Nazari, T., “Open shop scheduling
with stochastic release dates and processing times”, International
Journal of Logistics Systems and Management, Vol.18, No. 2,
(2014), 159-169. 
29. Tang, L., Bai, D., “A new heuristic for open shop total completion
time problem”, Applied Mathematical Modelling, Vol. 34, No. 3,
(2010), 735-743. 
30. Chen, D. S., Batson, R. G., Dang, Y., “Applied integer
programming: modeling and solution”, John Wiley & Sons,
31. Liu, G. S., Zhang, B. X., Yang, H. D., Chen, X., Huang, G. Q.,
“A branch-and-bound algorithm for minimizing the energy
consumption in the PFS problem”, Mathematical Problems in
Engineering, (2013). doi.org/10.1155/2013/546810