Minimizing Makespan in a Class of Reentrant Shops (Q4393117)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing Makespan in a Class of Reentrant Shops |
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
