6B3 A NEW LAGRANGIAN DECOMPOSITION AND COORDINATION METHOD FOR SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEMS(Technical session 6B : Lagrangian decomposition)

概要

論文の詳細を見る
The paper describes a new Largangian decomposition and coordination approach for single machine scheduling problems minimizing the total weighted tardiness. The problem belongs to the class of NP-hard combinatorial optimization problem. We propose an augmented Lagrangian decomposition and coordination approach, which is commonly used for continuous optimization problems, for solving scheduling problems despite the fact that the problem is nonconvex and non-differentiable. The proposed method shows a good convergence to a feasible solution without heuristically constructing a feasible solution. The performance of the proposed method is compared with that of an ordinary Lagrangian relaxation.
一般社団法人日本機械学会の論文
2004-05-24