Cart (Loading....) | Create Account
Close category search window
 

Multi-Objective Semiconductor Manufacturing Scheduling: A Random Keys Implementation of NSGA-II

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Mason, S.J. ; Arkansas Univ., Fayetteville, AR ; Kurz, M.E. ; Pfund, M.E. ; Fowler, J.W.
more authors

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-II (nondominated sorting genetic algorithm) 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

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.