【摘要】 以一个刀具移动的柔性制造系统为背景 ,研究了在刀具购买资金预算下如何规划任务所需刀具中每种规格的刀具数量问题 ,其目标就是最小化任务的在制时间。我们利用已有文献的结论简化实际问题 ,给出了求解在制时间和刀具等待时间的递归算法 ,然后通过增加关键机床上的关键刀具数量来修改中央刀具库中的初始刀具配置 ,所谓关键刀具就是指“刀具的等待时间之和 /刀具成本”最大的刀具 ,以上过程不断重复直到超过购买刀具资金的限制。最后 ,我们通过随机产生的问题进行了结果比较 ,数据结果表明所介绍的算法能给出较优的解。更多还原

【Abstract】 Based on a tool movement FMS, this paper considers the problem of determining the number of copies of each tool type for a limited budget of tool purchasing with the objective of minimizing makespan. We simplify the original problem by use of some published conclusions, then propose a recursive algorithm to calculate the makespan and the tool wait delay, which further directs a greedy algorithm to modifying the configuration of the center tool storage through increasing the critical tool type by one. The critical tool type is the one that has the maximal ratio of the sum of wait delay to purchase cost in the critical machine. Finally, we give some experimental tests based on the problems of the random data and the numerical results show that the heuristic algorithm in this paper has the better solutions to TRPP than others.更多还原