The scheduling problem of a multi-processor system with incompatible jobs

The scheduling problem of a multi-processor system with incompatible jobs

0.00 Avg rating0 Votes
Article ID: iaor20013933
Country: China
Volume: 20
Issue: 1
Start Page Number: 102
End Page Number: 105
Publication Date: Jan 2000
Journal: Systems Engineering Theory & Practice
Authors: ,
Keywords: heuristics
Abstract:

In this paper, we present a heuristic scheduling algorithm for MPS (Multi-Processor System) with incompatible jobs, and the performance analysis of this algorithm. Some scheduling problem can be solved based on the heuristic method in polynomial time complexity when the job graphs have some special structures such as bipartite graph, tree and so on.

Reviews

Required fields are marked *. Your email address will not be published.