Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times (Q4740320)
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: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times |
scientific article; zbMATH DE number 3795666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times |
scientific article; zbMATH DE number 3795666 |
Statements
Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times (English)
0 references
1982
0 references
flowshop scheduling
0 references
sum of completion times
0 references
''no-idle'' or ''no-wait'' constraint
0 references
polynomial bounded algorithms
0 references
