Applying Scenario Reduction Heuristics in Stochastic Programming for Phlebotomist Scheduling
Laboratory services in healthcare play a vital role in inpatient care. Studies have indicated laboratory data affect approximately 65% of the most critical decisions on admission, discharge, and medication. This research focuses on improving phlebotomist performance in laboratory facilities of large hospital systems. A two-stage stochastic integer linear programming (SILP) model is formulated to determine better weekly phlebotomist schedules and blood collection assignments. The objective of the two-stage SILP model is to balance the workload of the phlebotomists within and between shifts, as reducing workload imbalance will result in improved patient care. Due to the size of the two-stage SILP model, a scenario reduction model has been proposed as a solution approach. The scenario reduction heuristic is formulated as a linear programming model and the results indicate the scenarios with the largest likelihood of occurrence. These selected scenarios will be tested in the two-stage SILP model to determine weekly scheduling policies and blood draw assignments that will balance phlebotomist workload and improve overall performance.
 Da Rin, G. (2009). Pre-analytical workstations: A tool for reducing laboratory errors. Clinica Chimica Acta, 404(1), 68-74.
 Ahmed, S., Tawarmalani, M., & Sahinidis, N. V. (2004). A finite branch-and-bound algorithm for two-stage stochastic integer programs. Mathematical Programming, 100(2), 355-377.
 Norkin, V. I., Pflug, G. C., & Ruszczyński, A. (1998). A branch and bound method for stochastic global optimization. Mathematical Programming, 83(1-3), 425-450.
 Carøe, C. C., & Schultz, R. (1999). Dual decomposition in stochastic integer programming. Operations Research Letters, 24(1), 37-45.
 Dupačová, J., Gröwe-Kuska, N., & Römisch, W. (2003). Scenario reduction in stochastic programming. Mathematical Programming, 95(3), 493-511.
 Heitsch, H., & Römisch, W. (2003). Scenario reduction algorithms in stochastic programming. Computational Optimization and Applications, 24(2-3), 187-206.
 Dantzig, G. B. (1998). Linear programming and extensions. Princeton University Press.
 Karuppiah, R., Martín, M., & Grossmann, I. E. (2010). A simple heuristic for reducing the number of scenarios in two-stage stochastic programming. Computers & Chemical Engineering, 34(8), 1246-1255.
- There are currently no refbacks.
If you have already registered in Journal A and plan to submit article(s) to Journal B, please click the CATEGORIES, or JOURNALS A-Z on the right side of the "HOME".
We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
firstname.lastname@example.org; email@example.com; firstname.lastname@example.org
Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures
Address: 730, 77e AV, Laval, Quebec, H7V 4A8, Canada
Telephone: 1-514-558 6138