A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116): 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.1007/s10479-011-0975-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993331643 / rank | |||
Normal rank | |||
Revision as of 19:32, 19 March 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
