An Augmented Lagrangian Approach for Scheduling Problems : Application to Total Weighted Tardiness Problems

Access this Article

Search this Article

Author(s)

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 performance of the proposed method is compared with that of an ordinary Lagrangian relaxation.

Journal

  • JSME International Journal Series C

    JSME International Journal Series C 48(2), 299-304, 2005-06-15

    The Japan Society of Mechanical Engineers

References:  12

Codes

  • NII Article ID (NAID)
    110004820895
  • NII NACSIS-CAT ID (NCID)
    AA11179487
  • Text Lang
    ENG
  • Article Type
    ART
  • ISSN
    13447653
  • NDL Article ID
    7331280
  • NDL Source Classification
    ZN11(科学技術--機械工学・工業)
  • NDL Call No.
    Z53-Y272
  • Data Source
    CJP  NDL  NII-ELS  J-STAGE 
Page Top