| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Sao Paulo, Dept Engn Prod, Escola Politecn, BR-05508070 Sao Paulo - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | Optimization Letters; v. 7, n. 4, p. 665-684, APR 2013. |
| Web of Science Citations: | 8 |
| 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. (AU) | |
| FAPESP's process: | 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |