Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (Q4658386): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:08, 7 February 2024
scientific article; zbMATH DE number 2146665
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability |
scientific article; zbMATH DE number 2146665 |
Statements
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (English)
0 references
16 March 2005
0 references
scheduling
0 references
flow shop
0 references
complexity
0 references
heuristics
0 references
