Minimizing flow time on a constant number of machines with preemption (Q1779706): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.07.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2147877827 / rank | |||
Normal rank | |||
Revision as of 20:28, 19 March 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
