New heuristics for total tardiness minimization in a flexible flowshop |
| |
Authors: | Guilherme B Mainieri Débora P Ronconi |
| |
Institution: | 1. Departamento de Engenharia de Produ??o, Escola Politécnica, Universidade de S?o Paulo, Av. Prof. Almeida Prado, 128 Cidade Universitária, S?o Paulo, SP, 05508-070, Brazil
|
| |
Abstract: | This paper analyses the total tardiness minimization in a flowshop with multiple processors at each stage. While there is considerable research to minimize the makespan, very little work is reported on minimizing the total tardiness for this problem. This research focuses on heuristic methods that consider this environment as a series of parallel machine problems. New dispatching rules are introduced. One of the proposed rules is able to deal with jobs that will come afterwards and not only the available jobs at the decision time. Dispatching rules are also associated with classical (forward and backward) and new list scheduling algorithms. A special scheduling algorithm able to deal with idle times is proposed. Computational experiments in a set of 4,320 literature instances show that the developed heuristics are competitive and outperforms their classical counterparts. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|