Anzeige
Erschienen in:
1994 | OriginalPaper | Buchkapitel
Priority-Generating Functions Ordered Sets of Jobs
verfasst von : V. S. Tanaev, V. S. Gordon, Y. M. Shafransky
Erschienen in: Scheduling Theory. Single-Stage Systems
Verlag: Springer Netherlands
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
As mentioned in the previous chapters, a number of scheduling theory problems can be formulated in terms of optimizing functions over sets of permutations of the elements of a given finite set N. In particular, among such problems are those of finding optimal single-machine schedules for a finite set of jobs, provided that preemption is not allowed and that at most one job is processed at a time.