Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (Q4658386): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q320791 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Bernard Penz / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2601025 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999298971 / rank | |||
Normal rank |
Latest revision as of 03:09, 20 March 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