Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure

Hsueh Chien Cheng; Tsung Che Chiang; Li Chen Fu

doi:10.1109/SCIS.2009.4927009

Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure

Hsueh Chien Cheng, Tsung Che Chiang, Li Chen Fu

Department of Computer Science and Information Engineering

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

8 Citations (Scopus)

Abstract

In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.

Original language	English
Title of host publication	2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
Pages	15-21
Number of pages	7
DOIs	https://doi.org/10.1109/SCIS.2009.4927009
Publication status	Published - 2009
Event	2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Nashville, TN, United States Duration: 2009 Mar 30 → 2009 Apr 2

Publication series

Name	2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings

Other

Other	2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009
Country/Territory	United States
City	Nashville, TN
Period	2009/03/30 → 2009/04/02

ASJC Scopus subject areas

Artificial Intelligence
Computational Theory and Mathematics

Access to Document

10.1109/SCIS.2009.4927009

Cite this

Cheng, H. C., Chiang, T. C., & Fu, L. C. (2009). Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure. In 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings (pp. 15-21). Article 4927009 (2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings). https://doi.org/10.1109/SCIS.2009.4927009

Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure. / Cheng, Hsueh Chien; Chiang, Tsung Che; Fu, Li Chen.
2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings. 2009. p. 15-21 4927009 (2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings).

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

Cheng, HC, Chiang, TC & Fu, LC 2009, Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure. in 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings., 4927009, 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings, pp. 15-21, 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009, Nashville, TN, United States, 2009/03/30. https://doi.org/10.1109/SCIS.2009.4927009

Cheng HC, Chiang TC, Fu LC. Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure. In 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings. 2009. p. 15-21. 4927009. (2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings). doi: 10.1109/SCIS.2009.4927009

@inproceedings{129dad19828f4ecabef2c9e25a83116e,

title = "Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure",

abstract = "In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.",

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

year = "2009",

doi = "10.1109/SCIS.2009.4927009",

language = "English",

isbn = "9781424427574",

series = "2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings",

pages = "15--21",

booktitle = "2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings",

note = "2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 ; Conference date: 30-03-2009 Through 02-04-2009",

}

TY - GEN

T1 - Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure

AU - Cheng, Hsueh Chien

AU - Chiang, Tsung Che

AU - Fu, Li Chen

PY - 2009

Y1 - 2009

N2 - In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.

AB - In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.

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

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

U2 - 10.1109/SCIS.2009.4927009

DO - 10.1109/SCIS.2009.4927009

M3 - Conference contribution

AN - SCOPUS:67650482966

SN - 9781424427574

T3 - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings

SP - 15

EP - 21

BT - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings

T2 - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009

Y2 - 30 March 2009 through 2 April 2009

ER -

Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this