Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type (Q1944074)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6150255
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type |
scientific article; zbMATH DE number 6150255 |
Statements
Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type (English)
0 references
4 April 2013
0 references
design of algorithms
0 references
scheduling
0 references
differentiation flowshop
0 references
fixed sequences
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.8601865768432617
0 references
0.8442766070365906
0 references
0.8091340661048889
0 references
0.806851327419281
0 references
