A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the geometry, preemptions and complexity of multiprocessor and shop scheduling / rank | |||
Normal rank | |||
Latest revision as of 23:14, 4 July 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
