QQ客服 官方微博 反馈留言

	A hybrid local-search algorithm for robust job-shop scheduling under scenarios
	Wang, Bing[1]; Wang, Xiaozhi[2]; Lan, Fengming[3]; Pan, Quanke[4]
刊名	APPLIED SOFT COMPUTING
	2018
卷号	62页码:259-271
关键词	Robust job-shop scheduling Scenario Hybrid local-search algorithm Simulated annealing Tabu search
ISSN号	1568-4946
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2180641
专题	上海大学
作者单位	1.[1]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China. 2.[2]East China Normal Univ, Sch Informat Sci Technol, Shanghai 200241, Peoples R China. 3.[3]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China. 4.[4]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China.
推荐引用方式 GB/T 7714	Wang, Bing[1],Wang, Xiaozhi[2],Lan, Fengming[3],et al. A hybrid local-search algorithm for robust job-shop scheduling under scenarios[J]. APPLIED SOFT COMPUTING,2018,62:259-271.
APA	Wang, Bing[1],Wang, Xiaozhi[2],Lan, Fengming[3],&Pan, Quanke[4].(2018).A hybrid local-search algorithm for robust job-shop scheduling under scenarios.APPLIED SOFT COMPUTING,62,259-271.
MLA	Wang, Bing[1],et al."A hybrid local-search algorithm for robust job-shop scheduling under scenarios".APPLIED SOFT COMPUTING 62(2018):259-271.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。