A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q940886 |
||
| Property / author | |||
| Property / author: Evgeny V. Shchepin / rank | |||
Revision as of 14:33, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the proof of the complexity of the little-preemptive open-shop problem |
scientific article |
Statements
A note on the proof of the complexity of the little-preemptive open-shop problem (English)
0 references
9 March 2012
0 references
open-shop scheduling
0 references
preemption
0 references
algorithm
0 references
NP-hardness
0 references
