.png){kind=icon}
Return
An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2011.604051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the flexible flow shop sequence-dependent group scheduling problem (FFSDGS) with minimisation of makespan as the criterion (FFm vertical bar fmls, S-plk vertical bar C-max) is investigated. For the first time a mathematical model for the proposed research problem is developed. Since the problem is shown to be NP-hard, six metaheuristic algorithms based on tabu search (TS) are developed to efficiently solve the problem. The proposed metaheuristics are different to the only available metaheuristic algorithm in the literature based on TS. By applying randomised complete block design and using available test problems in the literature, the best of the proposed TS algorithms in this research is identified. The performance of the best developed metaheuristic algorithm is then compared with the existing algorithm in the literature by solving the test problems, also available in the literature, ranging in size from small, medium, to large. A comparison based on paired t-test at 95% confidence interval, shows that the best proposed algorithm in this research has a better performance than the existing algorithm in the literature with an average percentage deviation of around 1.0% for medium and large size problems.
Keywords:
flexible flow shop
sequence-dependent group scheduling
tabu search
mixed integer linear programming
minimisation of makespan
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more