A variant of the permutation flow shop model with variable processing times (Q1363747)
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: A variant of the permutation flow shop model with variable processing times |
scientific article; zbMATH DE number 1047170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variant of the permutation flow shop model with variable processing times |
scientific article; zbMATH DE number 1047170 |
Statements
A variant of the permutation flow shop model with variable processing times (English)
0 references
24 February 1998
0 references
makespan minimization
0 references
variable processing times
0 references
flow shop
0 references
infinite buffer capacities
0 references
greedy placement algorithm
0 references
0 references
0 references
0 references
0.8525193929672241
0 references
0.8511797785758972
0 references
0.8149623274803162
0 references
0.8077709078788757
0 references
