Scheduling preparation of doses for a chemotherapy service

Annals of Operations Research

Volumn 178, Issue 1, 2010, Pages 145-154

  Mazier, Alexandre ^a   Billaut, Jean Charles ^a   Tournamille, Jean François ^b  

^a UNIVERSITÉ DE TOURS   (France)

^b UNIVERSITY HOSPITAL OF TOURS   (France)

Author keywords

Chemotherapy production; Health service; Linear programming; Real time solution; Scheduling

Indexed keywords

EID: 77954030344     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-009-0624-2     Document Type: Article

References (12)

1. Brailsford, S., & Harper, P. (2008). Editorial. OR in health. European Journal of Operational Research, 185(3), 901-904.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. Néron, E., Tercinet, F., & Sourd, F. (2008). Search tree based approaches for parallel machine scheduling. Computers & Operations Research, 35(4), 1127-1137.
9. Olariu, S. (1991). An optimal greedy heuristic to color interval graphs. Information Processing Letters, 37, 21-25.
10. Sourd, F., & Kedad-Sidhoum, S. (2003). The one machine scheduling with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533-549.
11. 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.
12. 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.