Abstract
Multi layer multiprocessor systems are generally employed in real-time applications such as robotics and computer vision. In this paper, we developed three efficient heuristic scheduling algorithms for such systems. In our model, we considered to schedule multiprocessor tasks with arbitrary processing times and arbitrary processor requirements in a two-stage hybrid flow-shop to minimize makespan. We also derived an effective lower bound for the problem. Then, we analyzed the average performance of the heuristic algorithms by computing the average percentage deviation of each heuristic solution from the lower bound. The results of the computational experiment to test the average performance of the proposed heuristic algorithms on a set of randomly generated problems showed that the proposed heuristic algorithms perform well.
Original language | English |
---|---|
Pages | 1347-1350 |
Number of pages | 4 |
Publication status | Published - Oct 1997 |
Event | Proceedings of the 1997 IEEE International Conference on Intelligent Processing Systems, ICIPS'97. Part 1 (of 2) - Beijing, China Duration: 28 Oct 1997 → 31 Oct 1997 |
Conference
Conference | Proceedings of the 1997 IEEE International Conference on Intelligent Processing Systems, ICIPS'97. Part 1 (of 2) |
---|---|
City | Beijing, China |
Period | 28/10/97 → 31/10/97 |
ASJC Scopus subject areas
- General Computer Science
- General Engineering