A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:09, 5 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