Minimizing makespan in distributed mixed no-idle flowshops

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/122975

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/122975

题名:	Minimizing makespan in distributed mixed no-idle flowshops
作者:	Chen, Chen-Yang;Ying, Kuo-Ching;Chen, Hsia-Hsiang;Lu, Hsiao-Shan
关键词:	scheduling;makespan;metaheuristics;distributed mixed no-idle flowshop;cloud theory-based iterated greedy algorithm
日期:	2018-04-04
上传时间:	2023-04-28 16:33:19 (UTC+8)
出版者:	Taylor & Francis
摘要:	The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the best of the authors’ knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms.
關聯:	International Journal of Production Research 57(1), p. 48-60
DOI:	10.1080/00207543.2018.1457812
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	48	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章