Title

Unrelated Machines Scheduling With Machine Eligibility Restrictions

Keywords

Machine eligibility; Makespan; Scheduling; Unrelated machines

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 m / M j / C max). 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.

Publication Date

12-1-2002

Publication Title

Engineering Journal of University of Qatar

Volume

15

Number of Pages

193-210

Document Type

Article

Personal Identifier

scopus

Socpus ID

0347653632 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0347653632

This document is currently not available here.

Share

COinS