NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026)
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 1594889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of compact scheduling in simplified open and flow shops. |
scientific article; zbMATH DE number 1594889 |
Statements
NP-hardness of compact scheduling in simplified open and flow shops. (English)
0 references
2001
0 references
open shop
0 references
flow shop
0 references
compact scheduling
0 references
interval edge coloring
0 references
NP-completeness
0 references
0.9004537
0 references
0.9003066
0 references
0.8858325
0 references
0 references
0.8787217
0 references
0.8768531
0 references
0.8767619
0 references
0.8760073
0 references
