A note on scheduling equal-length jobs to maximize throughput (Q880531): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on scheduling equal-length jobs to maximize throughput / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank | |||
Normal rank | |||
Revision as of 18:08, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on scheduling equal-length jobs to maximize throughput |
scientific article |
Statements
A note on scheduling equal-length jobs to maximize throughput (English)
0 references
15 May 2007
0 references
