2機械自動生産システムの最適スケジューリング

概要

論文の詳細を見る
This paper discusses a scheduling problem of minimizing the maximum completion time for an automated manufacturing system such as FMS and FMC that consists of two automated machining cells such as machining centers, an AGV (automated guided vehicle) and loading and unloading stations. This paper develops a branch-and-bound algorithm and an approximation algorithm for this problem. Computer simulations implemented show that the branch-and-bound algorithm can solve most of the examples tested up to 200 jobs in a widd range of the problem, and the approximation algorithm can yield schedules with relative errors smaller than 1(%) at worst. It is also shown that under optimal schedules the machine efficiency is not affected by the transportation times of the AGV unless it is critical for the system efficiency, but is affected by variances of job processing times on machines, and that buffers for work-in-process can improve the machine efficiency, compared with a system without buffer.
一般社団法人日本機械学会の論文
1991-05-25