New efficient algorithms for the two-machine no-wait chain-reentrant shop problem (Q6645175)
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: New efficient algorithms for the two-machine no-wait chain-reentrant shop problem |
scientific article; zbMATH DE number 7950896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New efficient algorithms for the two-machine no-wait chain-reentrant shop problem |
scientific article; zbMATH DE number 7950896 |
Statements
New efficient algorithms for the two-machine no-wait chain-reentrant shop problem (English)
0 references
28 November 2024
0 references
chain-reentrant
0 references
no-wait
0 references
makespan
0 references
heuristics
0 references
branch \& bound
0 references
lower bounds
0 references
complexity
0 references
0 references
