首页|期刊导航|自动化学报（英文版）|Collision-free Scheduling of Multi-bridge Machining Systems: A Colored Traveling Salesman Problem-based Approach

Collision-free Scheduling of Multi-bridge Machining Systems: A Colored Traveling Salesman Problem-based Approach

Jun Li Xianghu Meng Xing Dai

自动化学报（英文版）2018，Vol.5Issue(1)：139-147,9.

自动化学报（英文版）2018，Vol.5Issue(1)：139-147,9.DOI:10.1109/JAS.2017.7510415

Collision-free Scheduling of Multi-bridge Machining Systems: A Colored Traveling Salesman Problem-based Approach

Jun Li ¹Xianghu Meng ¹Xing Dai¹

作者信息

1. Ministry of Education Key Laboratory of Measurement and Control, School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
折叠

摘要

关键词

Collision resolution/greedy algorithm/modeling/multiple traveling salesman problem/scheduling

Key words

Collision resolution/greedy algorithm/modeling/multiple traveling salesman problem/scheduling

引用本文复制引用

Jun Li,Xianghu Meng,Xing Dai..Collision-free Scheduling of Multi-bridge Machining Systems: A Colored Traveling Salesman Problem-based Approach[J].自动化学报（英文版）,2018,5(1):139-147,9.

基金项目

This work was supported in part by the National Natural Science Foundation of China (61773115,61374069,61374148) and the Natural Science Foundation of Jiangsu Province (BK20161427). （61773115,61374069,61374148）

自动化学报（英文版）

OACSCDEI

ISSN：2329-9266

访问量0

下载量0

段落导航