Scheduling dispensing and counting in secondary pharmaceutical manufacturing

In this article, we describe a general methodology for operations scheduling in dispensing and counting departments of pharmaceutical manufacturing plants. The departments are modeled as a multiobjective parallel machines scheduling problem under a number of both standard and realistic constraints, such as release times, due dates and deadlines, particular sequence-dependent setup times, machine unavailabilities, and maximum campaign size. Main characteristics of the methodology are the modularity of the solution algorithms, the adaptability to different objectives and constraints to fulfill production requirements, the easiness of implementation, and the ability of incorporating human experience in the scheduling algorithms. Computational experience carried out on two case studies from a real pharmaceutical plant shows the effectiveness of this approach. © 2009 American Institute of Chemical Engineers AIChE J, 2009

[1]  Pierre Hansen,et al.  A Tutorial on Variable Neighborhood Search , 2003 .

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

[3]  Nicola Secomandi,et al.  Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications , 2003, J. Heuristics.

[4]  Krishna R. Pattipati,et al.  Rollout strategies for sequential fault diagnosis , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[5]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC , 2005, Eur. J. Control.

[6]  Dario Pacciarelli,et al.  A tabu search algorithm for scheduling pharmaceutical packaging operations , 2010, Eur. J. Oper. Res..

[7]  Dario Pacciarelli,et al.  A Rollout Metaheuristic for Job Shop Scheduling Problems , 2004, Ann. Oper. Res..

[8]  Nilay Shah,et al.  Pharmaceutical supply chains: key issues and strategies for optimisation , 2004, Comput. Chem. Eng..

[9]  S. Voss,et al.  The pilot method; a strategie of heuristic repetition with application to the Steiner problem in graphs , 1996 .

[10]  Cees Duin,et al.  Looking Ahead with the Pilot Method , 2005, Ann. Oper. Res..

[11]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[12]  Hlynur Stefansson,et al.  Multiscale planning and scheduling in the secondary pharmaceutical industry , 2006 .

[13]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[14]  Christopher S. Tang Scheduling batches on parallel machines with major and minor set-ups , 1990 .

[15]  Jay H. Lee,et al.  Approximate dynamic programming: Application to process supply chain management , 2006 .

[16]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[17]  John N. Tsitsiklis,et al.  Rollout Algorithms for Combinatorial Optimization , 1997, J. Heuristics.