Multiobjective job shop scheduling using memetic algorithm and shifting bottleneck procedure

Hsueh Chien Cheng, Tsung Che Chiang, Li Chen Fu

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

6 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 languageEnglish
Title of host publication2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
Pages15-21
Number of pages7
DOIs
Publication statusPublished - 2009
Event2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Nashville, TN, United States
Duration: 2009 Mar 302009 Apr 2

Other

Other2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009
CountryUnited States
CityNashville, TN
Period09/3/3009/4/2

    Fingerprint

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

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). [4927009] https://doi.org/10.1109/SCIS.2009.4927009