Article ID: | iaor1997112 |
Country: | United Kingdom |
Volume: | 23 |
Issue: | 9 |
Start Page Number: | 897 |
End Page Number: | 907 |
Publication Date: | Sep 1996 |
Journal: | Computers and Operations Research |
Authors: | Sandbothe Richard A. |
Keywords: | heuristics |
The paper considers a lot-sizing model for the manufacture and storage of several products that require processing on a machine with limited production capacity. In addition, the machine can only be dedicated to producing one of these products in a time period and a fixed changeover cost is incurred whenever the machine changes from the production of one product to the production of a different product. A procedure is presented which uses a modified run-out time method to select which product to process next and a single product heuristic algorithm as the lot-sizing module for the selected product. The user is actively involved in resolving infeasibilities and in generating alternate feasible solutions. The procedure was tested on a set of 48 test problems. Each problem was 15 periods in length and consisted of either 2, 3 or 5 products. The best feasible solutions averaged 8.5% above the optimum with a mean CPU solution time of 3.29s.