Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:50, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. |
scientific article |
Statements
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (English)
0 references
17 November 2003
0 references
Single machine scheduling
0 references
Lower bound
0 references
Preemption
0 references
Total completion time
0 references
