An augmented Lagrangian approach for scheduling problems (Application to total weighted tardiness problems)

Tatsushi Nishi, Masami Konishi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)299-304
Number of pages6
JournalJSME International Journal, Series C: Mechanical Systems, Machine Elements and Manufacturing
Volume48
Issue number2 SPEC. ISS.
DOIs
Publication statusPublished - Jun 2005

ASJC Scopus subject areas

  • Mechanical Engineering
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'An augmented Lagrangian approach for scheduling problems (Application to total weighted tardiness problems)'. Together they form a unique fingerprint.

  • Cite this