Parallel Machine Scheduling with Load Balancing and Sequence Dependent Setups

SOAR Home
→
Engineering
→
Industrial and Manufacturing Engineering
→
IME Faculty Scholarship
→
Mehmet Bayram Yildirim
→
Articles
→
View Item

dc.contributor.author	Yildirim, Mehmet Bayram
dc.contributor.author	Duman, Ekrem
dc.contributor.author	Krishnan, Krishna K.
dc.contributor.author	Senniappan, Karthikeyan
dc.date.accessioned	2011-03-22T19:14:58Z
dc.date.available	2011-03-22T19:14:58Z
dc.date.issued	2007
dc.identifier.issn	1745-7653
dc.identifier.uri	http://hdl.handle.net/10057/3437
dc.description	This is the author's version of the work. It is posted here by permission for personal use, not for redistribution. The definitive version was published in International Journal of Operations Research Vol. 4, No. 1, 1-8 (2007)
dc.description.abstract	In this paper, we study the problem of minimizing total completion time with load balancing and sequence dependent setups in a non-identical parallel machine environment. A mathematical model has been presented for the objective of minimizing total completion time with workload balancing constraint. Since this problem is an NP-Hard problem, some simple heuristics and a genetic algorithm are developed for efficient scheduling of resources. The heuristics and genetic algorithm are tested on random data.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Inderscience	en_US
dc.relation.ispartofseries	International Journal of Operations Research Vol. 4, No. 1, 1-8 (2007);
dc.subject	Load balancing	en_US
dc.subject	Sequence dependent setups	en_US
dc.subject	Parallel machine scheduling	en_US
dc.subject	Scheduling theory	en_US
dc.subject	Genetic algorithms	en_US
dc.title	Parallel Machine Scheduling with Load Balancing and Sequence Dependent Setups	en_US
dc.type	Article	en_US