A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness |
scientific article |
Statements
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (English)
0 references
27 April 1999
0 references
mean flow time
0 references
NP-hardness
0 references
two-machine preemptive openshop system
0 references
different ready dates
0 references
strongly NP-complete
0 references
