Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance (Q323343)
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 6636469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance |
scientific article; zbMATH DE number 6636469 |
Statements
Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance (English)
0 references
7 October 2016
0 references
scheduling
0 references
proportionate flowshop
0 references
due-date assignment
0 references
due-window assignment
0 references
flow-allowance
0 references
0 references
0 references
0.90066165
0 references
0.88023627
0 references
0.87732565
0 references
0.87065816
0 references
0.86322784
0 references
0.86138004
0 references
0.86079645
0 references
