| 关于带有传输时间的F2|perm|Cmax排序问题的一个新算法 |
| |
| 引用本文： | 项思明.关于带有传输时间的F2|perm|Cmax排序问题的一个新算法[J].系统工程理论与实践,1995,15(9):51-57. |
| |
| 作者姓名： | 项思明 |
| |
| 作者单位： | 安徽建筑工业学院基础部 |
| |
| 摘 要： | 考虑传输时间的同顺序排序问题是在机器人设计及柔性制造系统中有着广泛应用的一类排序问题。
|
| 关 键 词： | 排序 传输时间 多项式算法 |
| 收稿时间： | 1994-03-31 |
A New Algorithm for the Scheduling of Problem F_2|Perm|C_(max) With Travel Time Between Machines |
| |
| Xiang Siming.A New Algorithm for the Scheduling of Problem F_2|Perm|C_(max) With Travel Time Between Machines[J].Systems Engineering —Theory & Practice,1995,15(9):51-57. |
| |
| Authors: | Xiang Siming |
| |
| Institution: | Anhui Architectural Industry College,Hefei 230022 |
| |
| Abstract: | The flowshop scheduling problem with travel time between machines is very practical and useful in the Robotics and FMS.Our inten-tion in this paper is to provide an O(nlogn)algorithm for the problem with tWo machines involved,which is an improvement up on the O(n￣2)algorithm proposed by Panwalkar in 1991. |
| |
| Keywords: | scheduling travel time polynomial algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
