期刊
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
卷 11, 期 1, 页码 22-48出版社
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2017.081418
关键词
no-wait flowshop; group scheduling; minimisation of total completion time; sequence dependent setup time; mathematical programming; metaheuristics
In this research, the no-wait flowshop sequence dependent group scheduling problem with minimisation of total completion time, noted as F-m|nwt, fmls, S-plk|Sigma C-j is approached. A mixed integer linear mathematical model is proposed for the research problem. Due to the NP-hard nature of the proposed problem, several metaheuristic algorithms based on particle swarm optimisation and variable neighbourhood search with different neighbourhood search structures are proposed to heuristically solve the problem. Also, an efficient heuristic algorithm is proposed to generate the initial feasible solutions for the proposed algorithms. The performances of the proposed algorithms are compared with each other and the best available one in the literature by using available test problems in the literature. Based on the results, the proposed metaheuristics with structure oriented initial solutions have a better performance than the algorithms with random-generated initial solutions. [ Received 14 July 2015; Revised 22 September 2015; Accepted 30 May 2016]
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据