A note on the flow-shop problem without interruptions in job processing (Q3320105)
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 3850805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the flow-shop problem without interruptions in job processing |
scientific article; zbMATH DE number 3850805 |
Statements
A note on the flow-shop problem without interruptions in job processing (English)
0 references
1981
0 references
flow-shop problem
0 references
earliest starting time
0 references
solution method
0 references
optimization criteria
0 references
0.8058878183364868
0 references
0.7921535968780518
0 references
0.7752801775932312
0 references
0.7740683555603027
0 references
