外注部品の到着時刻に制約がある組立スケジューリング問題に対する分枝限定法(機械要素,潤滑,工作,生産管理など)

概要

論文の詳細を見る
This paper considers an assembly scheduling problem for a flexible manufacturing cell (FMC), which consists of m dedicated machines and an assembly machine. There are n jobs to be processed in the FMC. Each of the dedicated machines produces a component of a job. In addition to m components, each job requires some other components purchased from outside. The assembly machine cannot start processing a job until both of all the m components produced in-house and components purchased from outside are available. The objective is to find a schedule of the n jobs that minimizes the makespan. It has been known that the scheduling problem is strogly NP-hard even when m=2. This paper proposes a branch-and-bound algorithm to the problem. The exact algorithm is examined by means of numerical experiments with up to 400 jobs, and the results are reported.
一般社団法人日本機械学会の論文
2006-02-25