Abstract
A fast realization of drugs is an important part in the quality of service of a hospital. In this paper we propose a scheduling method for the preparation of chemotherapy doses in order to reduce the patient waiting time. Two approaches have been defined: an off-line approach and a real time approach. The off-line approach is using a linear programming model for minimizing the maximum tardiness of jobs in a production day. This method is re-used during the real-time resolution combined with a greedy algorithm. The solution obtained respects constraints on the production center and the hospital organization. Our model is currently used in software which helps the decision maker of the service and allows increasing the patient satisfaction and the productivity of the service.
Similar content being viewed by others
References
Brailsford, S., & Harper, P. (2008). Editorial. OR in health. European Journal of Operational Research, 185(3), 901–904.
Gelders, L., & Kleindorfer, P. R. (1974). Coordinating aggregate and detailed scheduling in the one-machine job shop: Part I—Theory. Operations Research, 22(1), 46–60.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
Kedad-Sidhoum, S., Rios Solis, Y., & Sourd, F. (2007). Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. European Journal of Operational Research. doi:10.1016/j.ejor.2006.05.052.
Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178(2), 331–342.
Lopez, P., & Esquirol, P. (1996). Consistency enforcing in scheduling: A general formulation based on energetic reasoning. In 5th international workshop on project management and scheduling (PMS’96), Poznan, Poland.
Mazier, A., Billaut, J.-C., & Tournamille, J.-F. (2007). Scheduling activities in a chemotherapy service. In International conference on industrial engineering and systems management (IESM’07). Beijing (China), May 2007.
Néron, E., Tercinet, F., & Sourd, F. (2008). Search tree based approaches for parallel machine scheduling. Computers & Operations Research, 35(4), 1127–1137.
Olariu, S. (1991). An optimal greedy heuristic to color interval graphs. Information Processing Letters, 37, 21–25.
Sourd, F., & Kedad-Sidhoum, S. (2003). The one machine scheduling with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533–549.
Tercinet, F., Lenté, C., & Néron, E. (2004). Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. Operations Research Letters, 32(4), 326–330.
Zinder, Y. (2003). An iterative algorithm for scheduling UET tasks with due dates and release times. European Journal of Operational Research, 149(2), 404–416.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mazier, A., Billaut, JC. & Tournamille, JF. Scheduling preparation of doses for a chemotherapy service. Ann Oper Res 178, 145–154 (2010). https://doi.org/10.1007/s10479-009-0624-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0624-2