| A novel heuristic approach for job shop scheduling problem (CPCI-S收录) | |
| Wang, Yong-Ming[1,3]; Xiao, Nan-Feng[1]; Yin, Hong-Li[2]; Hu, En-Liang[4] | |
| 会议名称 | FRONTIERS IN ALGORITHMICS, PROCEEDINGS |
| 关键词 | job shop scheduling Heuristic algorithm simulated annealing algorithm production scheduling |
| URL标识 | 查看原文 |
| 内容类型 | 会议论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2101505 |
| 专题 | 华南理工大学 |
| 作者单位 | 1.[1]South China Univ Technol, Sch Engn & Comp Sci, Guangzhou 510640, Peoples R China 2.[2]Yunnan Normal Univ, Sch Comp Sci & Informat Technol, Kunming 650092, Peoples R China 3.[3]Qujing Normal Univ, Dept Comp Sci, Qujing 655011, Peoples R China 4.[4]Yunnan Normal Univ, Sch Math, Kunming 650092, Peoples R 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 (CPCI-S收录)[C]. 见:FRONTIERS IN ALGORITHMICS, PROCEEDINGS. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论