An Algorithm for the Open-Shop Problem (Q4744043): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113239980, #quickstatements; #temporary_batch_1711015421434 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.8.1.100 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.8.1.100 / rank | |||
Normal rank | |||
Latest revision as of 15:10, 30 December 2024
scientific article; zbMATH DE number 3799381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for the Open-Shop Problem |
scientific article; zbMATH DE number 3799381 |
Statements
An Algorithm for the Open-Shop Problem (English)
0 references
1983
0 references
open-shop problem
0 references
integer-making techniques
0 references
NP-completeness
0 references
special problem class
0 references
execution time condition
0 references
polynomial algorithms
0 references
