A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness

Yukinori Isoya; Tatsushi Nishi; Masahiro Inuiguchi

doi:10.1109/INDIN.2010.5549634

A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness

Yukinori Isoya, Tatsushi Nishi, Masahiro Inuiguchi

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

1 Citation (Scopus)

Abstract

We propose a new formulation for the column generation for solving flowshop scheduling problems to minimize the total weighted tardiness to derive tighter bounds. In the proposed method, each column represents a two-jobs schedule where the operations of two jobs do not overlap with each other. We show that the lower bound for the original problem can be strengthened by the proposed formulation without significantly increasing the total computing time. Computational experiments demonstrate that the proposed method can derive the solutions with a smaller duality gap compared with those of the conventional formulation.

Original language	English
Title of host publication	Proceedings - INDIN 2010
Subtitle of host publication	8th IEEE International Conference on Industrial Informatics
Pages	839-844
Number of pages	6
DOIs	https://doi.org/10.1109/INDIN.2010.5549634
Publication status	Published - 2010
Externally published	Yes
Event	8th IEEE International Conference on Industrial Informatics, INDIN 2010 - Osaka, Japan Duration: Jul 13 2010 → Jul 16 2010

Publication series

Name	IEEE International Conference on Industrial Informatics (INDIN)
ISSN (Print)	1935-4576

Other

Other	8th IEEE International Conference on Industrial Informatics, INDIN 2010
Country	Japan
City	Osaka
Period	7/13/10 → 7/16/10

Keywords

Column generation
Dantzig-Wolfe decomposition
Flowshop
Scheduling
Total weighted tardiness

ASJC Scopus subject areas

Computer Science Applications
Information Systems

Access to Document

10.1109/INDIN.2010.5549634

Fingerprint Dive into the research topics of 'A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness'. Together they form a unique fingerprint.

Cite this

Isoya, Y., Nishi, T., & Inuiguchi, M. (2010). A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness. In Proceedings - INDIN 2010: 8th IEEE International Conference on Industrial Informatics (pp. 839-844). [5549634] (IEEE International Conference on Industrial Informatics (INDIN)). https://doi.org/10.1109/INDIN.2010.5549634

A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness. / Isoya, Yukinori; Nishi, Tatsushi; Inuiguchi, Masahiro.

Proceedings - INDIN 2010: 8th IEEE International Conference on Industrial Informatics. 2010. p. 839-844 5549634 (IEEE International Conference on Industrial Informatics (INDIN)).

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

Isoya, Y, Nishi, T & Inuiguchi, M 2010, A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness. in Proceedings - INDIN 2010: 8th IEEE International Conference on Industrial Informatics., 5549634, IEEE International Conference on Industrial Informatics (INDIN), pp. 839-844, 8th IEEE International Conference on Industrial Informatics, INDIN 2010, Osaka, Japan, 7/13/10. https://doi.org/10.1109/INDIN.2010.5549634

@inproceedings{790fac27904644e799331a0d85c54db8,

title = "A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness",

abstract = "We propose a new formulation for the column generation for solving flowshop scheduling problems to minimize the total weighted tardiness to derive tighter bounds. In the proposed method, each column represents a two-jobs schedule where the operations of two jobs do not overlap with each other. We show that the lower bound for the original problem can be strengthened by the proposed formulation without significantly increasing the total computing time. Computational experiments demonstrate that the proposed method can derive the solutions with a smaller duality gap compared with those of the conventional formulation.",

keywords = "Column generation, Dantzig-Wolfe decomposition, Flowshop, Scheduling, Total weighted tardiness",

author = "Yukinori Isoya and Tatsushi Nishi and Masahiro Inuiguchi",

year = "2010",

doi = "10.1109/INDIN.2010.5549634",

language = "English",

isbn = "9781424473007",

series = "IEEE International Conference on Industrial Informatics (INDIN)",

pages = "839--844",

booktitle = "Proceedings - INDIN 2010",

note = "8th IEEE International Conference on Industrial Informatics, INDIN 2010 ; Conference date: 13-07-2010 Through 16-07-2010",

}

TY - GEN

T1 - A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness

AU - Isoya, Yukinori

AU - Nishi, Tatsushi

AU - Inuiguchi, Masahiro

PY - 2010

Y1 - 2010

N2 - We propose a new formulation for the column generation for solving flowshop scheduling problems to minimize the total weighted tardiness to derive tighter bounds. In the proposed method, each column represents a two-jobs schedule where the operations of two jobs do not overlap with each other. We show that the lower bound for the original problem can be strengthened by the proposed formulation without significantly increasing the total computing time. Computational experiments demonstrate that the proposed method can derive the solutions with a smaller duality gap compared with those of the conventional formulation.

AB - We propose a new formulation for the column generation for solving flowshop scheduling problems to minimize the total weighted tardiness to derive tighter bounds. In the proposed method, each column represents a two-jobs schedule where the operations of two jobs do not overlap with each other. We show that the lower bound for the original problem can be strengthened by the proposed formulation without significantly increasing the total computing time. Computational experiments demonstrate that the proposed method can derive the solutions with a smaller duality gap compared with those of the conventional formulation.

KW - Column generation

KW - Dantzig-Wolfe decomposition

KW - Flowshop

KW - Scheduling

KW - Total weighted tardiness

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

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

U2 - 10.1109/INDIN.2010.5549634

DO - 10.1109/INDIN.2010.5549634

M3 - Conference contribution

AN - SCOPUS:77956596035

SN - 9781424473007

T3 - IEEE International Conference on Industrial Informatics (INDIN)

SP - 839

EP - 844

BT - Proceedings - INDIN 2010

T2 - 8th IEEE International Conference on Industrial Informatics, INDIN 2010

Y2 - 13 July 2010 through 16 July 2010

ER -

A cut and column generation for flowshop scheduling problems to minimize the total weighted tardiness

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this