Unrelated Machines Scheduling With Machine Eligibility Restrictions

Show simple item record

Author Al Salem, Ameer en_US
Author Armacost, Robert L. en_US
Available date 2009-11-25T13:07:13Z en_US
Publication Date 2002 en_US
Citation Engineering Journal of Qatar University, 2002, Vol. 15, Pages 193-210. en_US
URI http://hdl.handle.net/10576/8020 en_US
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
Language en en_US
Publisher Qatar University en_US
Subject Engineering: Mechanical Engineering en_US
Title Unrelated Machines Scheduling With Machine Eligibility Restrictions en_US
Type Article en_US
Pagination 193-210 en_US
Volume Number 15 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record