Routing Open Shop and Flow Shop Scheduling Problems

摘要：

　　We consider a generalization of the classical open shop and flow shop scheduling problems where the jobs are located at the vertices of an undirected graph and the machines, initially located at the same vertex, have to travel along the graph to process the jobs.

关键词： Scheduling Routing Open Shop Flow Shop Complexity Approximation Algorithm

作者: Wei Yu Zhaohui Liu Leiyang Wang

作者单位: Department of Mathematics,East China University of Science and Technology, Shanghai 200237, China

会议类型: 国际会议

会议名称: 第8届国际最优化方法及应用大会

会议地点: 上海

会议语种:英文

页码: 250-250

在线出版日期: 2010-12-10（万方平台首次上网日期，不代表论文的发表时间）