Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393)
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 6650432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimizing blocking flow shop scheduling problem with total completion time criterion |
scientific article; zbMATH DE number 6650432 |
Statements
Optimizing blocking flow shop scheduling problem with total completion time criterion (English)
0 references
10 November 2016
0 references
scheduling
0 references
blocking flow shop
0 references
total completion time
0 references
mixed binary integer programming model
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
0.8205094337463379
0 references
0.8195081353187561
0 references
0.8165594935417175
0 references
0.8121674060821533
0 references
