Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439)
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: Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms |
scientific article; zbMATH DE number 6650450
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms |
scientific article; zbMATH DE number 6650450 |
Statements
Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (English)
0 references
10 November 2016
0 references
scheduling
0 references
aging effect
0 references
learning effect
0 references
computational complexity
0 references
heuristic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9150662422180176
0 references
0.8789053559303284
0 references
0.8701753616333008
0 references
0.8463154435157776
0 references
0.8431771993637085
0 references
