Group Title: investigation of production scheduling problems motivated by semiconductor manufacturing
Title: An Investigation of production scheduling problems motivated by semiconductor manufacturing
Full Citation
Permanent Link:
 Material Information
Title: An Investigation of production scheduling problems motivated by semiconductor manufacturing
Physical Description: viii, 219 leaves : ill. ; 29 cm.
Language: English
Creator: Herrmann, Jeffrey William ( Dissertant )
Lee, Chung-Yee ( Thesis advisor )
Elzinga, Jack ( Reviewer )
Bai, Sherman ( Reviewer )
Koehler, Gary ( Reviewer )
Erengne, Seleuk
Phillips, Winfred M. ( Degree grantor )
Holbrook, Karen A. ( Degree grantor )
Publisher: University of Florida
Place of Publication: Gainesville, Fla.
Publication Date: 1993
Copyright Date: 1993
Subjects / Keywords: Semiconductor industry   ( lcsh )
Genetic algorithms   ( lcsh )
Industrial and Systems Engineering thesis Ph.D
Production scheduling -- Mathematical models   ( lcsh )
Dissertations, Academic -- Industrial and Systems Engineering -- UF
Genre: bibliography   ( marcgt )
non-fiction   ( marcgt )
theses   ( marcgt )
Abstract: Manufacturing and service organizations frequently face the challenges of making high-quality products quickly and of delivering those products to their customers on-time. Improvements in the scheduling of their operations can often contribute to their success in meeting these goals. However, as manufacturing processes become more complex, the difficulty of finding good production schedules increases. This dissertation addresses dynamic deterministic job shop scheduling, a problem that occurs in many manufacturing environments. The problem is among the most difficult scheduling problems, and few solution procedures have been implemented. The approach in this research is to consider specific subproblems that are motivated by semiconductor test operations and the develop genetic algorithms that exploit alternative search spaces. The research includes new analytical and empirical results for previously unstudied one-machine class scheduling problems and three-machine look-ahead problems. The one-machine problems include sequence-dependent setup times. In the three-machine problems, two groups of jobs are processed on separate second stage machines. Testing shows that a new type of genetic algorithm can find good schedules for the one-machine problems by adjusting the problem data while using an appropriate heuristic. An approximation algorithm for the three-machine problem is able to find near-optimal schedules. Moreover, this dissertation describes the development and application of a global job shop scheduling system for the semiconductor test area. This system uses a detailed deterministic simulation model of the shop floor, data about the current status of the shop, and a genetic algorithm to search over combinations of dispatching rules in order to create a good shift schedule. These rules include these motivated by this research into the one-machine and three-machine problems. The scheduling system is able to adapt to changing conditions each shift. The benefits of this work consist of the identification of dominance properties for the one-machine class scheduling and three-machine look-ahead problems, the development of a problem space genetic algorithm, the definition of new look-ahead heuristics, the creation of a new genetic algorithm for global scheduling, and the implementation of these results to the actual semiconductor test floor that is the motivation for this work.
Statement of Responsibility: by Jeffrey William Herrmann.
Thesis: Thesis (Ph. D.)--University of Florida, 1993.
Bibliography: Includes bibliographical references (leaves 206-218).
Additional Physical Form: Also available in electronic format.
General Note: Typescript.
General Note: Vita.
 Record Information
Bibliographic ID: UF00098464
Volume ID: VID00001
Source Institution: University of Florida
Holding Location: University of Florida
Rights Management: All rights reserved by the source institution and holding location.
Resource Identifier: alephbibnum - 001948684
oclc - 31182006
notis - AKC5081

University of Florida Home Page
© 2004 - 2010 University of Florida George A. Smathers Libraries.
All rights reserved.

Acceptable Use, Copyright, and Disclaimer Statement
Last updated October 10, 2010 - Version 2.9.9 - mvs