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

Genetic algorithms to solve a single machine multiple orders per job scheduling problem

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Sobeyko, O. ; Dept. of Math. & Comput. Sci., Univ. of Hagen, Hagen, Germany ; Monch, L.

This research is motivated by a scheduling problem found in 300-mm semiconductor wafer fabrication facilities (wafer fabs). Front opening unified pods (FOUPs) are used to transfer wafers in wafer fabs. The number of FOUPs is kept limited because of the potential overload of the automated material handling system (AMHS). Different orders are grouped into one FOUP because orders of an individual customer very often fill only a portion of a FOUP. We study the case of lot processing and single item processing. The total weighted completion time objective is considered. In this paper, we propose a grouping genetic algorithm (GGA) to form the content of the FOUPs and sequence them. The GGA is hybridized with local search. Furthermore, we also study a random key genetic algorithm (RKGA) to sequence the orders and assign the orders to FOUPs by a heuristic. We compare the performance of the two GAs based on randomly generated problem instances with simple heuristics and other GAs from the literature. It turns out that GGA only slightly outperforms the previous genetic GAs but it is faster when a lot processing environment is considered. The RKGA behaves similar to the best performing GAs described in the literature with respect to solution quality and computing time.

Published in:

Simulation Conference (WSC), Proceedings of the 2010 Winter

Date of Conference:

5-8 Dec. 2010

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.