Scheduling ordered open shops (Q580167)
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 4016583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling ordered open shops |
scientific article; zbMATH DE number 4016583 |
Statements
Scheduling ordered open shops (English)
0 references
1987
0 references
This paper examines special cases of the open shop problem in an attempt to define the boundary between easy and apparently hard, i.e. NP- complete, problems. The top result is: the minimizing makespan in an ordered three-machine open shop is NP-complete. This implies that many other open shop problems are also NP-complete. However, the authors show that a slight change in the assumptions of the problem may render a difficult problem easy to solve.
0 references
open shop
0 references
makespan
0 references
NP-complete
0 references
0 references
0.8455893993377686
0 references
0.8354750871658325
0 references
0.834557294845581
0 references
0.8336902856826782
0 references
