Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II

Scott J. Mason, Mary E. Kurz, Michele E. Pfund, John Fowler, Letitia M. Pohl

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

8 Scopus citations

Abstract

We examine a complex, multi-objective semiconductor manufacturing scheduling problem involving two batch processing steps linked by a timer constraint. This constraint requires that any job completing the first processing step must be started on the succeeding second machine within some allowable time window; otherwise, the job must repeat its processing on the first step. We present a random keys implementation of NSGA-H for our problem of interest and investigate the efficacy of different batching policies in terms of the number of approximate efficient solutions that are produced by NSGA-II over a wide range of experimental problem instances. Experimental results suggest a full batch policy can produce superior solutions as compared to greedy batching policies under the experimental conditions examined.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007
Pages159-164
Number of pages6
DOIs
StatePublished - Sep 25 2007
Event2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 - Honolulu, HI, United States
Duration: Apr 1 2007Apr 5 2007

Publication series

NameProceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007

Other

Other2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007
CountryUnited States
CityHonolulu, HI
Period4/1/074/5/07

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II'. Together they form a unique fingerprint.

Cite this