Minimizing Makespan in a Class of Reentrant Shops (Q4393117): Difference between revisions
From MaRDI portal
Removed claims |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.45.5.702 / rank | |||
| Property / author | |||
| Property / author: Suresh P. Sethi / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Steef L. van de Velde / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146543244 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.45.5.702 / rank | |||
Normal rank | |||
Latest revision as of 23:34, 29 December 2024
scientific article; zbMATH DE number 1161012
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing Makespan in a Class of Reentrant Shops |
scientific article; zbMATH DE number 1161012 |
Statements
Minimizing Makespan in a Class of Reentrant Shops (English)
0 references
8 June 1998
0 references
chain-reentrant shop
0 references
two-machine case
0 references
binary NP-hard
0 references
approximation
0 references
branch-and-bound
0 references
worst-case performance
0 references
