Scheduling ordered open shops (Q580167): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(87)90029-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040889502 / rank | |||
Normal rank | |||
Revision as of 23:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling ordered open shops |
scientific article |
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
