Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(02)00215-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2058900090 / rank | |||
Normal rank |
Latest revision as of 10:13, 30 July 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
0 references
0 references
0 references
0 references