QQ客服 官方微博 反馈留言

	Two-stage genetic algorithm for large-size scheduling problem (CPCI-S收录)
	Wang, Yongming[1]; Xiao, Nanfeng[1]; Yin, Hongli[3]; Hu, Enliang[4]; Zhao, Chenggui[2]; Jiang, Yanrong[5]
会议名称	2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6
关键词	genetic algorithm. large-size job shop scheduling problem control parameters optimal computing budget allocation
URL标识	查看原文
内容类型	会议论文
URI标识	http://www.corc.org.cn/handle/1471x/2100747
专题	华南理工大学
作者单位	1.[1]S China Univ Technol, Sch Engn & Comp Sci, Guangzhou, Guangdong, Peoples R China 2.[2]Yunnan Univ Finance & Econ, Dept Comp Sci, Kunming, Yunnan, Peoples R China 3.[3]Yunnan Normal Univ, Sch Comp Sci & Informat Technol, Kunming, Yunnan, Peoples R China 4.[4]Yunnan Normal Univ, Sch Math, Kunming, Yunnan, Peoples R China 5.[5]Guangdong Univ Technol, Sch Comp, Guangzhou, Guangdong, Peoples R China
推荐引用方式 GB/T 7714	Wang, Yongming[1],Xiao, Nanfeng[1],Yin, Hongli[3],等. Two-stage genetic algorithm for large-size scheduling problem (CPCI-S收录)[C]. 见:2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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