Name
Abstract | ||
|---|---|---|
A chemical company produces powdery substances by a process that is difficult to control tightly. As a result, a significant proportion of production lots, fail to meet the specifications of one or more of the key measurable characteristics. These lots are stored in bins that can be later blended in fixed amounts so as to product a larger batch that is within specifications on all measurements. The blending of these bins is formulated here as an integer programming problem. This paper describes the sequential solution procedure used to find an optimal solution. The sequential procedure includes a penalty function at each step that is designed to force 'bad' lots, the most out-of-specifications, to blend first. The introduction of a variable step size eliminated the need for a branch-and-bound procedure. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1057/palgrave.jors.2600532 | Journal of The Operational Research Society |
Keywords | DocType | Volume |
operational research,information technology,production,location,reliability,forecasting,communications technology,management science,marketing,scheduling,information systems,project management,computer science,operations research,investment,logistics,inventory | Journal | 49 |
Issue | ISSN | Citations |
5 | 0160-5682 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitris Mihailidis | 1 | 4 | 1.44 |
| K. R. Chelst | 2 | 0 | 0.34 |