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

Tatsushi Nishi; Yuichiro Hiranaka; Masahiro Inuiguchi

doi:10.1109/COASE.2007.4341703

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 proceeding › Conference 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 language	English
Title of host publication	Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
Pages	875-880
Number of pages	6
DOIs	https://doi.org/10.1109/COASE.2007.4341703
Publication status	Published - 2007
Externally published	Yes
Event	3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 - Scottsdale, AZ, United States Duration: Sep 22 2007 → Sep 25 2007

Publication series

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

Conference

Conference	3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007
Country	United States
City	Scottsdale, AZ
Period	9/22/07 → 9/25/07

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/COASE.2007.4341703

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

Nishi, T., Hiranaka, Y., & Inuiguchi, M. (2007). A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness. In Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 (pp. 875-880). [4341703] (Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007). https://doi.org/10.1109/COASE.2007.4341703

A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness. / Nishi, Tatsushi; Hiranaka, Yuichiro; Inuiguchi, Masahiro.

Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. p. 875-880 4341703 (Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nishi, T, Hiranaka, Y & Inuiguchi, M 2007, A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness. in Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007., 4341703, Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007, pp. 875-880, 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007, Scottsdale, AZ, United States, 9/22/07. https://doi.org/10.1109/COASE.2007.4341703

Nishi T, Hiranaka Y, Inuiguchi M. A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness. In Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. p. 875-880. 4341703. (Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007). https://doi.org/10.1109/COASE.2007.4341703

Nishi, Tatsushi ; Hiranaka, Yuichiro ; Inuiguchi, Masahiro. / A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness. Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007. 2007. pp. 875-880 (Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007).

@inproceedings{2a24f92285a6473bbe8883ae76b16943,

title = "A successive Lagrangian relaxation method for solving flowshop scheduling problems with total weighted tardiness",

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.",

author = "Tatsushi Nishi and Yuichiro Hiranaka and Masahiro Inuiguchi",

year = "2007",

doi = "10.1109/COASE.2007.4341703",

language = "English",

isbn = "1424411548",

series = "Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007",

pages = "875--880",

booktitle = "Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007",

note = "3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007 ; Conference date: 22-09-2007 Through 25-09-2007",

}

TY - GEN

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

AU - Nishi, Tatsushi

AU - Hiranaka, Yuichiro

AU - Inuiguchi, Masahiro

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=44449126736&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44449126736&partnerID=8YFLogxK

U2 - 10.1109/COASE.2007.4341703

DO - 10.1109/COASE.2007.4341703

M3 - Conference contribution

AN - SCOPUS:44449126736

SN - 1424411548

SN - 9781424411542

T3 - Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

SP - 875

EP - 880

BT - Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

T2 - 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

Y2 - 22 September 2007 through 25 September 2007

ER -