A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness

Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Lagrangian relaxation technique has been used for solving a wide variety of scheduling problems to obtain near optimal solutions. The approach has been successfully applied to jobshop scheduling problems by relaxing the capacity constraints on machines by using Lagrange multipliers. The relaxed problem can be decomposed into independent job-level subproblems which can be solved by dynamic programming. By extending the technique, in this paper, we propose a successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness. In the proposed method, the quality of lower bound is improved by successively solving the Lagrangian dual problem embedding cuts into the Lagrangian relaxation problem. The state space reduction for dynamic programming is also incorporated. The effectiveness of the proposed method is demonstrated from numerical experiments.

Original languageEnglish
Title of host publicationProceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
Pages875-880
Number of pages6
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 - Scottsdale, AZ, United States
Duration: Sep 22 2007Sep 25 2007

Publication series

NameProceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

Conference

Conference3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
CountryUnited States
CityScottsdale, AZ
Period9/22/079/25/07

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness'. Together they form a unique fingerprint.

Cite this