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

7 Citations (Scopus)

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 - 2007
Event2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 - Honolulu, HI, United States
Duration: Apr 1 2007Apr 5 2007

Other

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

Fingerprint

Scheduling
Semiconductor materials
Processing

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Mason, S. J., Kurz, M. E., Pfund, M. E., Fowler, J., & Pohl, L. M. (2007). Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II. In Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 (pp. 159-164). [4218611] https://doi.org/10.1109/SCIS.2007.367684

Multi-objective semiconductor manufacturing scheduling : A random keys implementation of NSGA-II. / Mason, Scott J.; Kurz, Mary E.; Pfund, Michele E.; Fowler, John; Pohl, Letitia M.

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007. 2007. p. 159-164 4218611.

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

Mason, SJ, Kurz, ME, Pfund, ME, Fowler, J & Pohl, LM 2007, Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II. in Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007., 4218611, pp. 159-164, 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007, Honolulu, HI, United States, 4/1/07. https://doi.org/10.1109/SCIS.2007.367684
Mason SJ, Kurz ME, Pfund ME, Fowler J, Pohl LM. Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II. In Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007. 2007. p. 159-164. 4218611 https://doi.org/10.1109/SCIS.2007.367684
Mason, Scott J. ; Kurz, Mary E. ; Pfund, Michele E. ; Fowler, John ; Pohl, Letitia M. / Multi-objective semiconductor manufacturing scheduling : A random keys implementation of NSGA-II. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007. 2007. pp. 159-164
@inproceedings{55c308a5f25a4468912d8d3ccce77c4d,
title = "Multi-objective semiconductor manufacturing scheduling: A random keys implementation of NSGA-II",
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.",
author = "Mason, {Scott J.} and Kurz, {Mary E.} and Pfund, {Michele E.} and John Fowler and Pohl, {Letitia M.}",
year = "2007",
doi = "10.1109/SCIS.2007.367684",
language = "English (US)",
isbn = "1424407044",
pages = "159--164",
booktitle = "Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007",

}

TY - GEN

T1 - Multi-objective semiconductor manufacturing scheduling

T2 - A random keys implementation of NSGA-II

AU - Mason, Scott J.

AU - Kurz, Mary E.

AU - Pfund, Michele E.

AU - Fowler, John

AU - Pohl, Letitia M.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/SCIS.2007.367684

DO - 10.1109/SCIS.2007.367684

M3 - Conference contribution

AN - SCOPUS:34548778037

SN - 1424407044

SN - 9781424407040

SP - 159

EP - 164

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

ER -