Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728)
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 completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence |
scientific article; zbMATH DE number 6055035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence |
scientific article; zbMATH DE number 6055035 |
Statements
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (English)
0 references
12 July 2012
0 references
two-machine flow shop
0 references
total completion time
0 references
fixed sequence
0 references
dynamic programming
0 references
0 references
0 references
0.8601865768432617
0 references
0.8415101766586304
0 references
0.8340855836868286
0 references
0.8314282894134521
0 references
