Referenced Items are not available for this document.
Algorithms for scheduling a class of systems in which all the tasks execute on different processors in turn in the same order are described. This end-to-end scheduling problem is known as the flow-shop problem. Two cases in which the problem is tractable are presented, and a heuristic for the NP-hard general case is evaluated. The traditional flow-shop model is generalized in two directions. First, an algorithm for scheduling flow shops in which tasks can be serviced more than once by some processors is presented. Second, a heuristic algorithm for scheduling flow shops with periodic tasks is described. Scheduling systems with more than one flow shop are considered
Published in:
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Date of Conference: 9-12 Jun 1992
- Page(s):
- 452 - 459
- Meeting Date :
- 09 Jun 1992-12 Jun 1992
- Print ISBN:
- 0-8186-2865-0
- INSPEC Accession Number:
- 4468202
- Conference Location :
- Yokohama
- Digital Object Identifier :
- 10.1109/ICDCS.1992.235009
- Product Type:
- Conference Publications
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.
