| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Sao Paulo, Sch Engn Sao Carlos, BR-13566590 Sao Paulo - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | JOURNAL OF MANUFACTURING SYSTEMS; v. 36, p. 224-230, JUL 2015. |
| Web of Science Citations: | 16 |
| Abstract | |
In this paper, we addressed the problem of scheduling jobs in a no-wait flow shop with sequence-dependent setup times with the objective of minimizing the total flow time. As this problem is well-known for being NP-hard, we present a new constructive heuristic, named QUARTS, in order to obtain good approximate solutions in a short CPU time. QUARTS breaks the problem in quartets in order to minimize the total flow time. The method was tested with other literature methods: BAH and BIH by Bianco et al. (1999) {[}6], TRIPS, by Brown et al. (2004) {[}7] and the metaheuristic Iterated Greedy with Local Search proposed by Ruiz and Stutzle (2007) {[}25]. The computational results showed that IG(LS) obtained the best results and QUARTS presented the best performance regarding other constructive heuristics. (C) 2014 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 09/06832-2 - Flowshop no-wait scheduling with sequence dependent setup times |
| Grantee: | Daniella Castro Araujo |
| Support Opportunities: | Scholarships in Brazil - Master |