Flexible job shop scheduling using a multiobjective memetic algorithm

Tsung Che Chiang, Hsiao Jou Lin

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

11 Citations (Scopus)

Abstract

This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used in the parts of genetic algorithm and local search, respectively. The local search procedure follows the framework of variable neighborhood descent algorithm. The proposed algorithm is compared with three benchmark algorithms using fifteen classic problem instances. Its performance is better in terms of the number and quality of the obtained solutions.

Original languageEnglish
Title of host publicationAdvanced Intelligent Computing Theories and Applications
Subtitle of host publicationWith Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011 - Revised Selected Papers
Pages49-56
Number of pages8
DOIs
Publication statusPublished - 2011 Dec 1
Event7th International Conference on Intelligent Computing, ICIC 2011 - Zhengzhou, China
Duration: 2011 Aug 112011 Aug 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6839 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Conference on Intelligent Computing, ICIC 2011
CountryChina
CityZhengzhou
Period11/8/1111/8/14

Fingerprint

Job Shop Scheduling
Memetic Algorithm
Local Search
Workload
Job Shop Scheduling Problem
Descent Algorithm
Fitness
Sequencing
Aggregation
Routing
Assignment
Genetic Algorithm
Benchmark
Agglomeration
Genetic algorithms
Job shop scheduling
Framework
Local search (optimization)

Keywords

  • Pareto optimal
  • flexible job shop scheduling
  • memetic algorithm
  • multiobjective
  • variable neighborhood descent

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chiang, T. C., & Lin, H. J. (2011). Flexible job shop scheduling using a multiobjective memetic algorithm. In Advanced Intelligent Computing Theories and Applications: With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011 - Revised Selected Papers (pp. 49-56). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6839 LNAI). https://doi.org/10.1007/978-3-642-25944-9_7

Flexible job shop scheduling using a multiobjective memetic algorithm. / Chiang, Tsung Che; Lin, Hsiao Jou.

Advanced Intelligent Computing Theories and Applications: With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011 - Revised Selected Papers. 2011. p. 49-56 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6839 LNAI).

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

Chiang, TC & Lin, HJ 2011, Flexible job shop scheduling using a multiobjective memetic algorithm. in Advanced Intelligent Computing Theories and Applications: With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011 - Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6839 LNAI, pp. 49-56, 7th International Conference on Intelligent Computing, ICIC 2011, Zhengzhou, China, 11/8/11. https://doi.org/10.1007/978-3-642-25944-9_7
Chiang TC, Lin HJ. Flexible job shop scheduling using a multiobjective memetic algorithm. In Advanced Intelligent Computing Theories and Applications: With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011 - Revised Selected Papers. 2011. p. 49-56. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-25944-9_7
Chiang, Tsung Che ; Lin, Hsiao Jou. / Flexible job shop scheduling using a multiobjective memetic algorithm. Advanced Intelligent Computing Theories and Applications: With Aspects of Artificial Intelligence - 7th International Conference, ICIC 2011 - Revised Selected Papers. 2011. pp. 49-56 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{384c9f276abd47eaa411f60eb18e1099,
title = "Flexible job shop scheduling using a multiobjective memetic algorithm",
abstract = "This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used in the parts of genetic algorithm and local search, respectively. The local search procedure follows the framework of variable neighborhood descent algorithm. The proposed algorithm is compared with three benchmark algorithms using fifteen classic problem instances. Its performance is better in terms of the number and quality of the obtained solutions.",
keywords = "Pareto optimal, flexible job shop scheduling, memetic algorithm, multiobjective, variable neighborhood descent",
author = "Chiang, {Tsung Che} and Lin, {Hsiao Jou}",
year = "2011",
month = "12",
day = "1",
doi = "10.1007/978-3-642-25944-9_7",
language = "English",
isbn = "9783642259432",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "49--56",
booktitle = "Advanced Intelligent Computing Theories and Applications",

}

TY - GEN

T1 - Flexible job shop scheduling using a multiobjective memetic algorithm

AU - Chiang, Tsung Che

AU - Lin, Hsiao Jou

PY - 2011/12/1

Y1 - 2011/12/1

N2 - This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used in the parts of genetic algorithm and local search, respectively. The local search procedure follows the framework of variable neighborhood descent algorithm. The proposed algorithm is compared with three benchmark algorithms using fifteen classic problem instances. Its performance is better in terms of the number and quality of the obtained solutions.

AB - This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used in the parts of genetic algorithm and local search, respectively. The local search procedure follows the framework of variable neighborhood descent algorithm. The proposed algorithm is compared with three benchmark algorithms using fifteen classic problem instances. Its performance is better in terms of the number and quality of the obtained solutions.

KW - Pareto optimal

KW - flexible job shop scheduling

KW - memetic algorithm

KW - multiobjective

KW - variable neighborhood descent

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

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

U2 - 10.1007/978-3-642-25944-9_7

DO - 10.1007/978-3-642-25944-9_7

M3 - Conference contribution

AN - SCOPUS:84862971816

SN - 9783642259432

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 49

EP - 56

BT - Advanced Intelligent Computing Theories and Applications

ER -