Parallel Machine Scheduling with Load Balancing and Sequence Dependent Setups
Date
2007Author
Yildirim, Mehmet Bayram
Duman, Ekrem
Krishnan, Krishna K.
Senniappan, Karthikeyan
Metadata
Show full item recordAbstract
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.
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)