Some Optimum Algorithms for Scheduling Problems with Changeover Costs (Q3758548)
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: Some Optimum Algorithms for Scheduling Problems with Changeover Costs |
scientific article; zbMATH DE number 4008085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Optimum Algorithms for Scheduling Problems with Changeover Costs |
scientific article; zbMATH DE number 4008085 |
Statements
Some Optimum Algorithms for Scheduling Problems with Changeover Costs (English)
0 references
1987
0 references
assembly line
0 references
changeover cost
0 references
multiple identical production lines
0 references
Optimum production schedules
0 references
0.8492161631584167
0 references
0.8492158651351929
0 references
0.8166157603263855
0 references
0.8058491349220276
0 references
0.792765200138092
0 references
