Multiobjective permutation flowshop scheduling by an adaptive genetic local search algorithm

Hsueh Chien Cheng*, Tsung Che Chiang, Li Chen Fu

*Corresponding author for this work

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

4 Citations (Scopus)

Abstract

The multiobjective flowshop problem with makespan and total flow time as objectives is addressed. A genetic local search algorithm is proposed with the ability to allocate the computational resources through the dynamic population size and local search intensity. The proposed method is compared with existing algorithms for flowshop scheduling with a public benchmark problem set. The experimental results show that the proposed method is capable of discovering solutions with better quality and diversity. The proposed method yields the best known nondominated solutions for the commonly studied permutation flowshop benchmarks, and the set of best known solutions is useful for the evaluation of performance of future studies.

Original languageEnglish
Title of host publication2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages1596-1602
Number of pages7
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, China
Duration: 2008 Jun 12008 Jun 6

Publication series

Name2008 IEEE Congress on Evolutionary Computation, CEC 2008

Other

Other2008 IEEE Congress on Evolutionary Computation, CEC 2008
Country/TerritoryChina
CityHong Kong
Period2008/06/012008/06/06

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Multiobjective permutation flowshop scheduling by an adaptive genetic local search algorithm'. Together they form a unique fingerprint.

Cite this