Scheduling ordered open shops (Q580167): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: V.Peteanu / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4016583 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
open shop | |||
| Property / zbMATH Keywords: open shop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
makespan | |||
| Property / zbMATH Keywords: makespan / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-complete | |||
| Property / zbMATH Keywords: NP-complete / rank | |||
Normal rank | |||
Revision as of 17:36, 1 July 2023
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
