Tabu search for minimizing total tardiness in a job shop
| Autor: | Vinícius Amaral Armentano, Cintia Rigão Scrich |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Economics and Econometrics
Mathematical optimization Job shop scheduling Computer science Heuristic (computer science) Job shop Heuristic Tardiness Flow shop scheduling Management Science and Operations Research General Business Management and Accounting Industrial and Manufacturing Engineering Tabu search Scheduling (computing) Heuristics |
| Zdroj: | International Journal of Production Economics. 63:131-140 |
| ISSN: | 0925-5273 |
| DOI: | 10.1016/s0925-5273(99)00014-6 |
| Popis: | This paper presents a tabu search approach to minimize total tardiness for the job shop scheduling problem. The method uses dispatching rules to obtain an initial solution and searches for new solutions in a neighborhood based on the critical paths of the jobs. Diversification and intensification strategies are suggested. For small problems the solutions’ quality is evaluated against optimal solution values and for large problems the tabu search performance is compared with two heuristics proposed in the literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect