Scheduling preparation of doses for a chemotherapy service

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.

[1]  Safia Kedad-Sidhoum,et al.  The One-Machine Problem with Earliness and Tardiness Penalties , 2003, J. Sched..

[2]  Pierre Lopez,et al.  CONSISTENCY ENFORCING IN SCHEDULING: A GENERAL FORMULATION BASED ON ENERGETIC REASONING , 1996 .

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  L. Gelders,et al.  Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..

[5]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[6]  Jean-Charles Billaut,et al.  Scheduling activities in a chemotherapy service , 2007 .

[7]  Yakov Zinder An iterative algorithm for scheduling UET tasks with due dates and release times , 2003, Eur. J. Oper. Res..

[8]  Paul R. Harper,et al.  OR in Health , 2008, Eur. J. Oper. Res..

[9]  Francis Sourd,et al.  Search tree based approaches for parallel machine scheduling , 2008, Comput. Oper. Res..

[10]  Emmanuel Néron,et al.  Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines , 2004, Oper. Res. Lett..

[11]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[12]  Stephan Olariu,et al.  An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..

[13]  Mike Rowson,et al.  Editorial: Where is health? , 2002 .