Loading...
Parallel-machine scheduling with load-balancing and sequence-dependent setups
Senniappan, Karthikeyan
Senniappan, Karthikeyan
Citations
Altmetric:
Files
Loading...
Thesis
Adobe PDF, 227.99 KB
Authors
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
2006-12
Type
Thesis
Genre
Keywords
Subjects (LCSH)
Electronic dissertations
Electronic dissertations
Electronic dissertations
Citation
Abstract
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.
Table of Contents
Description
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering
"December 2006."
"December 2006."
Publisher
Journal
Book Title
Series
Digital Collection
Finding Aid URL
Use and Reproduction
Copyright Karthikeyan Senniappan, 2006. All rights reserved.