.png){kind=icon}
.png){kind=icon}
Return
A tabu search algorithm for scheduling pharmaceutical packaging operations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.05.038.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses a practical scheduling problem arising in the packaging department of a pharmaceutical industrial plant. The problem is modeled as a multi-purpose machine scheduling problem with setup and removal times, release and due dates and additional constraints related to the scarce availability of tools and human operators. The objective functions are minimization of makespan and maximum tardiness in lexicographic order. Representing a solution with a directed graph allows us to devise an effective tabu search algorithm to solve the problem. Computational experiments, carried on real and randomly generated instances, show the effectiveness of this approach. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Scheduling
Packaging
Tabu search
Pharmaceutical industry
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W