Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482290 | European Journal of Operational Research | 2010 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Luca Venditti, Dario Pacciarelli, Carlo Meloni,