A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness (Q1280122)
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 1260415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness |
scientific article; zbMATH DE number 1260415 |
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
0.91199595
0 references
0.9108357
0 references
0.9080493
0 references
0.89623874
0 references
0.89187706
0 references
