Show simple item record

dc.contributor.advisorYildirim, Mehmet Bayramen_US
dc.contributor.authorSenniappan, Karthikeyan
dc.date.accessioned2007-08-20T01:32:25Z
dc.date.available2007-08-20T01:32:25Z
dc.date.issued2006-12
dc.identifier.othert06093
dc.identifier.urihttp://hdl.handle.net/10057/679
dc.descriptionThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineeringen
dc.description"December 2006."en
dc.description.abstractIn 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.en
dc.format.extent266848 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.rightsCopyright Karthikeyan Senniappan, 2006. All rights reserved.en
dc.subject.lcshElectronic dissertationsen
dc.titleParallel-machine scheduling with load-balancing and sequence-dependent setupsen
dc.typeThesisen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record