Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques (Q3740552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques |
scientific article; zbMATH DE number 3974706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques |
scientific article; zbMATH DE number 3974706 |
Statements
Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques (English)
0 references
1986
0 references
preemptive scheduling
0 references
deadline scheduling
0 references
scheduling n jobs
0 references
processing time
0 references
release time
0 references
due date
0 references
parallel machines
0 references
maximum flow in a network
0 references
maximum lateness
0 references
0.8862754106521606
0 references
0.872440755367279
0 references
0.852440595626831
0 references
