生産能力制約のある大規模生産計画問題の解法

概要

論文の詳細を見る
A method is proposed to solve the large-scale production planning problem with setup times and limited overtime. A Lagrangean relaxation method is adopted to decompose the problem into two subproblems, and the Lagrangean dual problem is solved by the subgradient method. In our approach, however, the subgradient method is applied iteratively, and the initial value of the Lagrangean value is derived from the last value of the previous iteration. The heuristic method is also proposed to improve the solution of the uncapacitated lot-sizing problem that is one of two subproblems. This heuristic method uses only the cost of the lot-sizing problem to utilize unused regular time. In our computational study 250 feasible solutions out of 288 test problems are obtained. The test problems range from 12 periods and 100 products to 24 periods and 1000 products. The average difference between the best feasible solution and the lower bound is 3. 5%, and the performance of the method is enhanced to 1. 7% under the condition of a low-cost premium for overtime.
一般社団法人日本機械学会の論文
1994-07-25