A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems

doi:10.1007/s10489-019-01497-2

IR > 经济管理学院

	A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems
	Zhao, Fuqing1 ; He, Xuan 1; Zhang, Yi 2; Lei, Wenchang 1; Ma, Weimin 3; Zhang, Chuck 4; Song, Houbin1
	2020-01
发表期刊	Applied Intelligence
ISSN	0924669X
卷号	50 期号:1 页码:87-100
摘要	The no-wait flow shop scheduling problem (NWFSP), as a typical NP-hard problem, has important ramifications in the modern industry. In this paper, a jigsaw puzzle inspired heuristic (JPA) is proposed for solving NWFSP with the objective of minimizing makespan. The core idea behind JPA is to find the best match for each job until all the jobs are scheduled in the set of process. In JPA, a waiting time matrix is constructed to measure the gap between two jobs. Then, a matching matrix based on the waiting time matrix is obtained. Finally, the optimal scheduling sequence is built by using the matching matrix. Experimental results on large-scale benchmark instances show that JPA is superior to the state-of-the-art heuristics. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.
关键词	Benchmarking Heuristic algorithms Machine shop practice NP-hard Scheduling Algorithm for solving Jigsaw puzzles Makespan Matching matrix Minimizing makespan No-wait flow-shop scheduling Optimal scheduling State of the art
DOI	10.1007/s10489-019-01497-2
收录类别	EI ; SCIE
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Artificial Intelligence
WOS记录号	WOS:000511764700007
出版者	Springer
EI入藏号	20192907191427
EI主题词	Job shop scheduling
EI分类号	604.2 Machining Operations - 723.1 Computer Programming - 912.2 Management - 921.5 Optimization Techniques
来源库	Compendex
分类代码	604.2 Machining Operations - 723.1 Computer Programming - 912.2 Management - 921.5 Optimization Techniques
引用统计	被引频次：12[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://ir.lut.edu.cn/handle/2XXMBERH/115516
专题	经济管理学院国际合作处（港澳台办）研究生院
通讯作者	Zhao, Fuqing
作者单位	1.Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Peoples R China; 2.Xijin Univ, Sch Mech Engn, Xian 710123, Peoples R China; 3.Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China; 4.Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
第一作者单位	兰州理工大学
通讯作者单位	兰州理工大学
第一作者的第一单位	兰州理工大学
推荐引用方式 GB/T 7714	Zhao, Fuqing,He, Xuan,Zhang, Yi,et al. A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems[J]. Applied Intelligence,2020,50(1):87-100.
APA	Zhao, Fuqing.,He, Xuan.,Zhang, Yi.,Lei, Wenchang.,Ma, Weimin.,...&Song, Houbin.(2020).A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems.Applied Intelligence,50(1),87-100.
MLA	Zhao, Fuqing,et al."A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems".Applied Intelligence 50.1(2020):87-100.