| 同时加工排序问题的分支定界法和启发式算法 |
| |
| 引用本文： | 刘丽丽,唐国春.同时加工排序问题的分支定界法和启发式算法[J].运筹学学报,2004,8(3):39-44. |
| |
| 作者姓名： | 刘丽丽 唐国春 |
| |
| 作者单位： | 上海第二工业大学,上海,201209 |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina(GrantNo.19771057and10371071) |
| |
| 摘 要： | 同时加工机器或者称为批加工机器是可以同时加工多个工件的机器．本文研究使带权总完工时间为最小的同时加工排序问题1|B|∑wjGj.这个问题的计算复杂性还没有解决．我们给出这个问题的精确解法——分支定界法和几个启发式算法，并且用较多实例对启发式算法的性能进行了比较．
|
| 关 键 词： | 同时加工机器 排序问题 分支定界法 启发式算法 |
A Branch and Bound Approach and Heuristic Algorithms for Scheduling a Batching Machine |
| |
| Abstract.A Branch and Bound Approach and Heuristic Algorithms for Scheduling a Batching Machine[J].OR Transactions,2004,8(3):39-44. |
| |
| Authors: | Abstract |
| |
| Abstract: | A batch machine or batching processing machine is one that can process several jobs simultaneously. We study the problem 1|B| ∑wjCj of minimizing the total weighted completion time on a batch machine. The computational complexity of this problem is open. We provide an exact solution procedure-a branch and bound approach and heuristic algorithms for it, and compare the heuristics with considerable instances. |
| |
| Keywords: | OR scheduling batching machine branch and bound heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
