Multiobjective job shop scheduling using rule-coded genetic local search

Tsung Che Chiang; Li Chen Fu

Multiobjective job shop scheduling using rule-coded genetic local search

Tsung Che Chiang, Li Chen Fu

Department of Computer science & Information Engineering

Research output: Contribution to conference › Paper

2 Citations (Scopus)

Abstract

The multiobjective job shop scheduling problem with mean tardiness and the maximum tardiness as the objectives is addressed. A genetic local search algorithm is proposed with several features. First, it uses a dispatching rule-based genome encoding scheme, and the encoded dispatching rules are chosen carefully. Second, its mating selection mechanism combines the advantages of two representative ones in the literature. Third, it enhances a recently proposed population-based local search procedure. The benefits of the proposed idea are verified through experiments on a public benchmark problem set. In the experiments, the proposed algorithm is also shown to significantly outperform a recent algorithm specific to the multiobjective job shop scheduling problem.

Original language	English
Pages	1764-1775
Number of pages	12
Publication status	Published - 2006 Dec 1
Event	36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan Duration: 2006 Jun 20 → 2006 Jun 23

Other

Other	36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
Country	Taiwan
City	Taipei
Period	06/6/20 → 06/6/23

Keywords

Dispatching rules
Job shop scheduling
Multiobjective evolutionary algorithms

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

Access to Document

Fingerprint Dive into the research topics of 'Multiobjective job shop scheduling using rule-coded genetic local search'. Together they form a unique fingerprint.

Cite this

Chiang, T. C., & Fu, L. C. (2006). Multiobjective job shop scheduling using rule-coded genetic local search. 1764-1775. Paper presented at 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Taipei, Taiwan.

@conference{b327715d6e5b4c8385121b6be48a5cde,

title = "Multiobjective job shop scheduling using rule-coded genetic local search",

abstract = "The multiobjective job shop scheduling problem with mean tardiness and the maximum tardiness as the objectives is addressed. A genetic local search algorithm is proposed with several features. First, it uses a dispatching rule-based genome encoding scheme, and the encoded dispatching rules are chosen carefully. Second, its mating selection mechanism combines the advantages of two representative ones in the literature. Third, it enhances a recently proposed population-based local search procedure. The benefits of the proposed idea are verified through experiments on a public benchmark problem set. In the experiments, the proposed algorithm is also shown to significantly outperform a recent algorithm specific to the multiobjective job shop scheduling problem.",

keywords = "Dispatching rules, Job shop scheduling, Multiobjective evolutionary algorithms",

author = "Chiang, {Tsung Che} and Fu, {Li Chen}",

year = "2006",

month = dec,

day = "1",

language = "English",

pages = "1764--1775",

note = "36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 ; Conference date: 20-06-2006 Through 23-06-2006",

}

TY - CONF

T1 - Multiobjective job shop scheduling using rule-coded genetic local search

AU - Chiang, Tsung Che

AU - Fu, Li Chen

PY - 2006/12/1

Y1 - 2006/12/1

N2 - The multiobjective job shop scheduling problem with mean tardiness and the maximum tardiness as the objectives is addressed. A genetic local search algorithm is proposed with several features. First, it uses a dispatching rule-based genome encoding scheme, and the encoded dispatching rules are chosen carefully. Second, its mating selection mechanism combines the advantages of two representative ones in the literature. Third, it enhances a recently proposed population-based local search procedure. The benefits of the proposed idea are verified through experiments on a public benchmark problem set. In the experiments, the proposed algorithm is also shown to significantly outperform a recent algorithm specific to the multiobjective job shop scheduling problem.

AB - The multiobjective job shop scheduling problem with mean tardiness and the maximum tardiness as the objectives is addressed. A genetic local search algorithm is proposed with several features. First, it uses a dispatching rule-based genome encoding scheme, and the encoded dispatching rules are chosen carefully. Second, its mating selection mechanism combines the advantages of two representative ones in the literature. Third, it enhances a recently proposed population-based local search procedure. The benefits of the proposed idea are verified through experiments on a public benchmark problem set. In the experiments, the proposed algorithm is also shown to significantly outperform a recent algorithm specific to the multiobjective job shop scheduling problem.

KW - Dispatching rules

KW - Job shop scheduling

KW - Multiobjective evolutionary algorithms

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

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

M3 - Paper

AN - SCOPUS:55749095208

SP - 1764

EP - 1775

T2 - 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006

Y2 - 20 June 2006 through 23 June 2006

ER -