Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906)
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: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. |
scientific article; zbMATH DE number 2005441
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. |
scientific article; zbMATH DE number 2005441 |
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
0 references
0 references
0 references
0 references
