QQ客服 官方微博 反馈留言

	Minimizing the worst-case makespan for a job-shop scheduling system with uncertain processing times
	Liu, Lijia[1]; Wang, Bing[2]; Li, Xiaoyan[3]
	2017
会议名称	2017 CHINESE AUTOMATION CONGRESS (CAC)
会议日期	2017-01-01
关键词	Job-shop scheduling Uncertain processing times Scenarios The worst-case scenario model Tabu search Simulated annealing algorithm
页码	6993-6998
URL标识	查看原文
内容类型	会议论文
URI标识	http://www.corc.org.cn/handle/1471x/2196619
专题	上海大学
作者单位	1.[1]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China. 2.[2]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China. 3.[3]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China.
推荐引用方式 GB/T 7714	Liu, Lijia[1],Wang, Bing[2],Li, Xiaoyan[3]. Minimizing the worst-case makespan for a job-shop scheduling system with uncertain processing times[C]. 见:2017 CHINESE AUTOMATION CONGRESS (CAC). 2017-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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