An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02522667.2002.10699531 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046861767 / rank | |||
Normal rank | |||
Revision as of 19:29, 19 March 2024
scientific article; zbMATH DE number 2094338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion |
scientific article; zbMATH DE number 2094338 |
Statements
An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (English)
0 references
23 August 2004
0 references
minimum makespan criterion
0 references
