Unrelated Machines Scheduling With Machine Eligibility Restrictions

QSpace/Manakin Repository

Unrelated Machines Scheduling With Machine Eligibility Restrictions

Show full item record


Title: Unrelated Machines Scheduling With Machine Eligibility Restrictions
Author: Al Salem, Ameer
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.
URI: http://hdl.handle.net/10576/8020
Date: 2002

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 full item record

Search QSpace


Advanced Search

Browse

My Account