Minimizing flow time on a constant number of machines with preemption (Q1779706): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2004.07.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2004.07.008 / rank | |||
Normal rank | |||
Latest revision as of 10:48, 11 December 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
0 references
