Resource constraints machine scheduling : A genetic algorithm approach

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)Not applicablepeer-review

12 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Title of host publication2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings
PublisherIEEE Computer Society
Pages1080-1085
Volume2
Publication statusPublished - 2003
Externally publishedYes

Publication series

Name
Volume2

Conference

Title2003 Congress on Evolutionary Computation (CEC 2003)
PlaceAustralia
CityCanberra
Period8 - 12 December 2003

Abstract

In this paper, we present a machine scheduling problem with resource constraints which is popular in manufacturing engineering. A genetic algorithm based approach is put forward and illustrated, including a special encoding and two kinds of decoding greedy schemes. Compared with both several kinds of lower bounds we present in the paper and the results from ILOG OPL software package, it is shown that our rapid genetic algorithm achieved significant results with stable and near-optimal performance. © 2003 IEEE.

Citation Format(s)

Resource constraints machine scheduling : A genetic algorithm approach. / Li, Yanzhi; Wang, Fan; Lim, Andrew.

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings. Vol. 2 IEEE Computer Society, 2003. p. 1080-1085 1299788.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)Not applicablepeer-review