Comparison of multiple objective genetic algorithms for parallel machine scheduling problems

W. Matthew Carlyle, Bosun Kim, John Fowler, Esma Gel

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

3 Citations (Scopus)

Abstract

Many multiple objective genetic algorithms have been developed to approximate the efficient frontier of solutions for multiple objective optimization problems. However, only a limited number of comparison studies have been performed on practical problems. One of the reasons for this may be the lack of commonly accepted measures to compare the solution quality of sets of approximately optimal solutions. In this paper, we perform an extensive set of experiments to quantitatively compare the solutions of two competing algorithms for a bi-criteria parallel machine-scheduling problem.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages472-485
Number of pages14
Volume1993
ISBN (Print)9783540417453
StatePublished - 2001
Event1st International Conference on Evolutionary Multi-Criterion Optimization, EMO 2001 - Zurich, Switzerland
Duration: Mar 7 2001Mar 9 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1993
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Conference on Evolutionary Multi-Criterion Optimization, EMO 2001
CountrySwitzerland
CityZurich
Period3/7/013/9/01

Fingerprint

Parallel Machine Scheduling
Multiple Objectives
Scheduling Problem
Genetic algorithms
Scheduling
Genetic Algorithm
Multiple Objective Optimization
Efficient Frontier
Bicriteria
Optimal Solution
Optimization Problem
Experiment
Experiments

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Matthew Carlyle, W., Kim, B., Fowler, J., & Gel, E. (2001). Comparison of multiple objective genetic algorithms for parallel machine scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1993, pp. 472-485). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1993). Springer Verlag.

Comparison of multiple objective genetic algorithms for parallel machine scheduling problems. / Matthew Carlyle, W.; Kim, Bosun; Fowler, John; Gel, Esma.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1993 Springer Verlag, 2001. p. 472-485 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1993).

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

Matthew Carlyle, W, Kim, B, Fowler, J & Gel, E 2001, Comparison of multiple objective genetic algorithms for parallel machine scheduling problems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1993, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1993, Springer Verlag, pp. 472-485, 1st International Conference on Evolutionary Multi-Criterion Optimization, EMO 2001, Zurich, Switzerland, 3/7/01.
Matthew Carlyle W, Kim B, Fowler J, Gel E. Comparison of multiple objective genetic algorithms for parallel machine scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1993. Springer Verlag. 2001. p. 472-485. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Matthew Carlyle, W. ; Kim, Bosun ; Fowler, John ; Gel, Esma. / Comparison of multiple objective genetic algorithms for parallel machine scheduling problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1993 Springer Verlag, 2001. pp. 472-485 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4f6f1740ee83420c99574c0a3d2ea3c9,
title = "Comparison of multiple objective genetic algorithms for parallel machine scheduling problems",
abstract = "Many multiple objective genetic algorithms have been developed to approximate the efficient frontier of solutions for multiple objective optimization problems. However, only a limited number of comparison studies have been performed on practical problems. One of the reasons for this may be the lack of commonly accepted measures to compare the solution quality of sets of approximately optimal solutions. In this paper, we perform an extensive set of experiments to quantitatively compare the solutions of two competing algorithms for a bi-criteria parallel machine-scheduling problem.",
author = "{Matthew Carlyle}, W. and Bosun Kim and John Fowler and Esma Gel",
year = "2001",
language = "English (US)",
isbn = "9783540417453",
volume = "1993",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "472--485",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Comparison of multiple objective genetic algorithms for parallel machine scheduling problems

AU - Matthew Carlyle, W.

AU - Kim, Bosun

AU - Fowler, John

AU - Gel, Esma

PY - 2001

Y1 - 2001

N2 - Many multiple objective genetic algorithms have been developed to approximate the efficient frontier of solutions for multiple objective optimization problems. However, only a limited number of comparison studies have been performed on practical problems. One of the reasons for this may be the lack of commonly accepted measures to compare the solution quality of sets of approximately optimal solutions. In this paper, we perform an extensive set of experiments to quantitatively compare the solutions of two competing algorithms for a bi-criteria parallel machine-scheduling problem.

AB - Many multiple objective genetic algorithms have been developed to approximate the efficient frontier of solutions for multiple objective optimization problems. However, only a limited number of comparison studies have been performed on practical problems. One of the reasons for this may be the lack of commonly accepted measures to compare the solution quality of sets of approximately optimal solutions. In this paper, we perform an extensive set of experiments to quantitatively compare the solutions of two competing algorithms for a bi-criteria parallel machine-scheduling problem.

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

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

M3 - Conference contribution

AN - SCOPUS:84931332816

SN - 9783540417453

VL - 1993

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

SP - 472

EP - 485

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

PB - Springer Verlag

ER -