Scheduling equal processing time jobs
| Autor(en): | Baptiste, P. Brucker, P. |
Erscheinungsdatum: | 2004 | Herausgeber: | CRC Press | Journal: | Handbook of Scheduling: Algorithms, Models, and Performance Analysis | Startseite: | 14--1--14--38 | Zusammenfassung: | Due to the monotonicity of the functions fj the jobs should be scheduled as early as possible. The n earliest time slots tj for scheduling all n jobs may be calculated using the following algorithm, in which we assume that the jobs are enumerated such that r1 ≤ r2 ≤ · · · ≤ rn Algorithm Time Slots. © 2004 by CRC Press LLC. |
ISBN: | 9780203489802 9781584883975 |
Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016796160&partnerID=40&md5=6bb1a6126eb78b0f5c889562927f1bd7 |
Zur Langanzeige
