In many practical manufacturing environments, setups consume a significant amount of industrial resources. Therefore, reducing setups in a non-identical parallel machine environment will significantly enhance a company's performance level. In this thesis, the problem of minimizing total completion time with load balancing and sequence-dependent setups in a non-identical parallel machine environment was studied. A mathematical model for minimizing total completion time with a workload-balancing constraint is presented. Since this problem is an NP-hard problem, some simple heuristics and a genetic algorithm were developed for efficient scheduling of resources. Both were tested on random data. / Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering / "December 2006."
| Identifer | oai:union.ndltd.org:WICHITA/oai:soar.wichita.edu:10057/679 |
| Date | 12 1900 |
| Creators | Senniappan, Karthikeyan |
| Contributors | Yildirim, Mehmet Bayram |
| Source Sets | Wichita State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | 266848 bytes, application/pdf |
| Rights | Copyright Karthikeyan Senniappan, 2006. All rights reserved. |
Page generated in 0.0024 seconds