Lower bounds for the economic lot scheduling problem using aggregation (Q761933)
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: Lower bounds for the economic lot scheduling problem using aggregation |
scientific article; zbMATH DE number 3889225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the economic lot scheduling problem using aggregation |
scientific article; zbMATH DE number 3889225 |
Statements
Lower bounds for the economic lot scheduling problem using aggregation (English)
0 references
1984
0 references
This paper considers the problem of how to choose cyclical production patterns for several products which are produced on a common production facility. The demands are constant. The purpose is to suggest new methods to generate efficient lower bounds. Numerical examples are given.
0 references
economic lot scheduling
0 references
aggregation
0 references
cyclical production patterns
0 references
efficient lower bounds
0 references
0.8337793946266174
0 references
0.786799967288971
0 references
0.7842713594436646
0 references
