Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545)
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: Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems |
scientific article; zbMATH DE number 1253037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems |
scientific article; zbMATH DE number 1253037 |
Statements
Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (English)
0 references
22 February 1999
0 references
flow shop scheduling
0 references
sum of job completion times
0 references
machine idle times
0 references
job queue times
0 references
0 references
