Referenced Items are not available for this document.
In this paper we consider the following time constrained scheduling problem. Given a set of jobs J with execution times e(j)∈(0, 1] and an undirected graph G=(J, E), we consider the problem to find a schedule for the jobs such that adjacent jobs (j,j')∈E are assigned to different machines and that the total execution time for each machine is at most 1. The goal is to find a minimum number of machines to execute all jobs under this time constraint. This scheduling problem is a natural generalization of the classical bin packing problem. We propose and analyse several approximation algorithms with constant absolute worst case ratio for graphs that can be colored in polynomial time
Published in:
Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on
(Volume:2
)
Date of Conference: 19-21 Apr 1995
- Page(s):
- 670 - 679 vol.2
- Meeting Date :
- 19 Apr 1995-21 Apr 1995
- Print ISBN:
- 0-7803-2018-2
- INSPEC Accession Number:
- 5058633
- Conference Location :
- Brisbane, Qld.
- Digital Object Identifier :
- 10.1109/ICAPP.1995.472254
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
