Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time (Q3202129)
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 Equal Length Jobs on Two Machines to Minimize Mean Flow Time |
scientific article; zbMATH DE number 4179127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time |
scientific article; zbMATH DE number 4179127 |
Statements
Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time (English)
0 references
1990
0 references
equal-length jobs
0 references
release times
0 references
identical, parallel machines
0 references
mean flow time
0 references
nonpreemptive and preemptive scheduling
0 references
0.8848526477813721
0 references
0.869461715221405
0 references
0.8622695803642273
0 references
0.8604139685630798
0 references
