The paper describes an augmented Lagrangian decomposition and coordination approach for solving single machine scheduling problems to minimize 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 perforrnance of the proposed method is compared with that of an ordinary Lagrangian relaxation.
|Number of pages||6|
|Journal||JSME International Journal, Series C: Mechanical Systems, Machine Elements and Manufacturing|
|Issue number||2 SPEC. ISS.|
|Publication status||Published - Jun 2005|
ASJC Scopus subject areas
- Mechanical Engineering
- Industrial and Manufacturing Engineering