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. (C) 2009 American Institute of Chemical Engineers AIChE J, 55:1161-1170, 2009