Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449)
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: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm |
scientific article; zbMATH DE number 5510183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm |
scientific article; zbMATH DE number 5510183 |
Statements
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (English)
0 references
24 February 2009
0 references
scheduling
0 references
flow shop
0 references
due dates
0 references
greedy algorithm
0 references
0 references
0.9396383
0 references
0.92718774
0 references
0.90246767
0 references
0.9011952
0 references
0.8995654
0 references
0.8967213
0 references
0.8891647
0 references
0.8888494
0 references
0.88643515
0 references
