An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
dc.contributor.author | Engin, Orhan | |
dc.contributor.author | Günaydın, Cengiz | |
dc.date.accessioned | 2020-03-26T18:13:43Z | |
dc.date.available | 2020-03-26T18:13:43Z | |
dc.date.issued | 2011 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | No-wait flowshop scheduling problem (NW-FSSP) with the objective to minimize the makespan is an important sequencing problem in the production plans and applications of no-wait flowshops can be found in several industries. In a NW-FSSP, jobs are not allowed to wait between two successive machines. The NW-FSSPs are addressed to minimize makespan and the NW-FSSP is known as a NP- Hard problem. In this study, Agarwal et al.'s(1) adaptive learning approach (ALA) is improvement for NW-FSSPs. Improvements in adaptive learning approach is similar to neural-network training. The improvement adaptive learning approach (IALA) is applied to all of the 192 problems. The proposed IALA method for NW-FSSP is compared with Aldowaisan and Allahverdi's(2) results by using Genetic heuristic. The results of computational experiments on randomly generated NW-FSSPs are show that the proposed adaptive learning approach performs quite well. | en_US |
dc.identifier.endpage | 529 | en_US |
dc.identifier.issn | 1875-6883 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.scopusquality | Q2 | en_US |
dc.identifier.startpage | 521 | en_US |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/26101 | |
dc.identifier.volume | 4 | en_US |
dc.identifier.wos | WOS:000297795000011 | en_US |
dc.identifier.wosquality | N/A | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | ATLANTIS PRESS | en_US |
dc.relation.ispartof | INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | No-wait flowshop | en_US |
dc.subject | Adaptive learning approach | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Makespan | en_US |
dc.title | An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan | en_US |
dc.type | Article | en_US |