Simple algorithms for multiprocessor scheduling to meet deadlines (Q1248336): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sequencing with due-dates and early start times to minimize maximum tardiness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131656 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Real-Time Scheduling Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Tasks with Nonuniform Deadlines on Two Processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank | |||
Normal rank |
Latest revision as of 22:45, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simple algorithms for multiprocessor scheduling to meet deadlines |
scientific article |
Statements
Simple algorithms for multiprocessor scheduling to meet deadlines (English)
0 references
1977
0 references
0 references