Solving constrained flow-shop scheduling problems with three machines (Q3072696)
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 5845621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving constrained flow-shop scheduling problems with three machines |
scientific article; zbMATH DE number 5845621 |
Statements
4 February 2011
0 references
flow-shop scheduling problem
0 references
transportation time
0 references
weights of jobs
0 references
optimal sequence
0 references
0.8592804074287415
0 references
