A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6013357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the proof of the complexity of the little-preemptive open-shop problem |
scientific article; zbMATH DE number 6013357 |
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
0.831743061542511
0 references
0.826524555683136
0 references
0.8257830739021301
0 references
0.8210679292678833
0 references
0.8158295750617981
0 references
