Unrelated Machines Scheduling With Machine Eligibility Restrictions

QSpace/Manakin Repository

Unrelated Machines Scheduling With Machine Eligibility Restrictions

Show simple item record


dc.contributor.author Al Salem, Ameer en_US
dc.date.accessioned 2009-11-25T13:07:13Z
dc.date.available 2009-11-25T13:07:13Z
dc.date.issued 2002 en_US
dc.identifier.citation Engineering Journal of Qatar University, 2002, Vol. 15, Pages 193-210. en_US
dc.identifier.uri http://hdl.handle.net/10576/8020
dc.description.abstract In this paper we present a new heuristic algorithm to minimize the makespan for scheduling jobs on unrelated parallel machines with machine eligibility restrictions ( R^ I M .1 C^^). To the best of our knowledge, the problem has not been addressed previously in the literature. The multi-phase heuristic algorithm incorporates new concepts from the multi-depot vehicle routing in the constructive heuristic. A computational study includes problems with two or four machines, up to 105 jobs, and three levels of a machine selection parameter. The heuristic algorithm solution values are compared to optimal solution values. The results show that the heuristic algorithm can yield solutions within a few percent of the optimal solutions with performance improving as the number of jobs to be scheduled increases. en_US
dc.language.iso en en_US
dc.publisher Qatar University en_US
dc.subject Engineering: Mechanical Engineering en_US
dc.title Unrelated Machines Scheduling With Machine Eligibility Restrictions en_US
dc.type Article en_US
dc.identifier.pagination 193-210 en_US
dc.identifier.volume 15 en_US

Files in this item

Files Size Format View
abstract.pdf 1.991Kb PDF View/Open
abstract.doc 20.5Kb Microsoft Word View/Open
06-02-15-0012-fulltext.pdf 611.7Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search QSpace


Advanced Search

Browse

My Account