Some no-wait shops scheduling problems: Complexity aspect (Q1079487)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some no-wait shops scheduling problems: Complexity aspect |
scientific article; zbMATH DE number 3963551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some no-wait shops scheduling problems: Complexity aspect |
scientific article; zbMATH DE number 3963551 |
Statements
Some no-wait shops scheduling problems: Complexity aspect (English)
0 references
1986
0 references
NP-hard
0 references
NP-complete
0 references
computational complexity
0 references
no-wait shops scheduling
0 references
optimal finish time schedules
0 references
polynomial time algorithm
0 references
3-machine flowshops
0 references
0 references
0.8740458488464355
0 references
0.8710773587226868
0 references
0.8670276403427124
0 references
0.8666090369224548
0 references
0.8588205575942993
0 references
