Abstract
Given a set P of jobs subject to precedence constraints and m machines, all identical and acting in parallel, find a schedule that performs the jobs, subject to the precedence constraints, which is complete as quickly as possible. Each job requires unit time and must be processed by only one of the machines. In order-theoretical terms the problem is to find an extension of width at most m and minimum height of an ordered set P. The corresponding decising problem is this.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Rival, I. (1989). Scheduling. In: Rival, I. (eds) Algorithms and Order. NATO ASI Series, vol 255. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2639-4_15
Download citation
DOI: https://doi.org/10.1007/978-94-009-2639-4_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7691-3
Online ISBN: 978-94-009-2639-4
eBook Packages: Springer Book Archive