| Article ID: | iaor2009990 |
| Country: | United Kingdom |
| Volume: | 40 |
| Issue: | 4 |
| Start Page Number: | 331 |
| End Page Number: | 346 |
| Publication Date: | Apr 2008 |
| Journal: | Engineering Optimization |
| Authors: | Rabbani M., Tavakkoli-Moghaddam R., Rahimi-Vahed A.R., Javadi B. |
| Keywords: | heuristics, heuristics: genetic algorithms, heuristics: tabu search, programming: multiple criteria |
The flow shop problem as a typical manufacturing challenge has gained wide attention in academic fields. This article considers a bi-criteria no-wait flow shop scheduling problem (FSSP) in which weighted mean completion time and weighted mean tardiness are to be minimized simultaneously, Since a FSSP has been proved to be NP-hard in a strong sense, a new multi-objective scatter search is designed for finding the locally Pareto-optimal frontier of the problem.