Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517)
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 the makespan in the two-machine flowshop scheduling problem with an availability constraint |
scientific article; zbMATH DE number 1043996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint |
scientific article; zbMATH DE number 1043996 |
Statements
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (English)
0 references
5 August 1997
0 references
two-machine flowshop scheduling
0 references
heuristic algorithms
0 references
error bound analysis
0 references
0.919876217842102
0 references
0.9074057936668396
0 references
0.8980695605278015
0 references
0.8974870443344116
0 references
