QQ客服 官方微博 反馈留言

	A novel heuristic approach for job shop scheduling problem (EI收录)
	Wang, Yong-Ming[1,3]; Xiao, Nan-Feng[1]; Yin, Hong-Li[2]; Hu, En-Liang[4]
会议名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议日期	August 1, 2007 - August 3, 2007
会议地点	Lanzhou, China
关键词	Computational complexity Optimal control systems Problem solving Scheduling
URL标识	查看原文
内容类型	会议论文
URI标识	http://www.corc.org.cn/handle/1471x/2102149
专题	华南理工大学
作者单位	1.[1] School of Computer Science and Engineering, South China University of Technology, Guangzhou 510640, China 2.[2] School of Computer Science and Information Technology, Yunnan Normal University, Kunming 650092, China 3.[3] Department of Computer Science, Qujing Normal University, Qujing 655011, China 4.[4] School of Mathematics, Yunnan Normal University, Kunming 650092, China
推荐引用方式 GB/T 7714	Wang, Yong-Ming[1,3],Xiao, Nan-Feng[1],Yin, Hong-Li[2],等. A novel heuristic approach for job shop scheduling problem (EI收录)[C]. 见:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lanzhou, China. August 1, 2007 - August 3, 2007.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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