Parallel-machine scheduling with load-balancing and sequence-dependent setups

dc.contributor.advisor	Yildirim, Mehmet Bayram	en_US
dc.contributor.author	Senniappan, Karthikeyan
dc.date.accessioned	2007-08-20T01:32:25Z
dc.date.available	2007-08-20T01:32:25Z
dc.date.issued	2006-12
dc.identifier.other	t06093
dc.identifier.uri	http://hdl.handle.net/10057/679
dc.description	Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering	en
dc.description	"December 2006."	en
dc.description.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.	en
dc.format.extent	266848 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en_US	en
dc.rights	Copyright Karthikeyan Senniappan, 2006. All rights reserved.	en
dc.subject.lcsh	Electronic dissertations	en
dc.title	Parallel-machine scheduling with load-balancing and sequence-dependent setups	en
dc.type	Thesis	en

Files in this item

Name: t06093.pdf

Size: 260.5Kb

Format: application/ pdf

Description: Thesis

Master's Theses [823]
This collection includes Master's theses completed at the Wichita State University Graduate School (Fall 2005 --)
CE Theses and Dissertations [481]
IME Theses and Dissertations [78]