Minimizing flow time on a constant number of machines with preemption (Q1779706): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:58, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing flow time on a constant number of machines with preemption |
scientific article |
Statements
Minimizing flow time on a constant number of machines with preemption (English)
0 references
1 June 2005
0 references
Flow time
0 references
Approximation schemes
0 references
Multiple machines
0 references
Preemption
0 references
Scheduling
0 references
