A tabu search algorithm for scheduling pharmaceutical packaging operations
| Autor: | Luca Venditti, Dario Pacciarelli, Carlo Meloni |
|---|---|
| Přispěvatelé: | Venditti, L, Pacciarelli, Dario, C., Meloni |
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
Mathematical optimization
Information Systems and Management General Computer Science Job shop scheduling Computer science Tardiness Scheduling (production processes) Directed graph Management Science and Operations Research Industrial and Manufacturing Engineering Tabu search Scheduling (computing) Nurse scheduling problem Modeling and Simulation Pharmaceutical packaging Algorithm |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|