.png){kind=icon}
Return
Multi-objective no-wait flowshop scheduling problems: models and algorithms
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2010.543937.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article studies multi-objective no-wait flowshop scheduling problems to minimise both makespan and total tardiness. This problem is commonly denoted by F/nwt/TT, C-max. This article mathematically formulates the problem using two effective multi-objective mixed integer linear programming models. The multi-objective mathematical models are then solved by a multiple criteria decision making approach, called Fuzzy programming method. Moreover, the article proposes a novel multi-objective iterated local search algorithm incorporating three types of local search engine: greedy, moderate and curtailed fashions. The algorithm is carefully evaluated for its performance against two available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.
Keywords:
no-wait flowshop scheduling
multi-objective iterated local search algorithm
mixed integer linear programming model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveMultiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more