Article ID: | iaor20011239 |
Country: | United Kingdom |
Volume: | 38 |
Issue: | 11 |
Start Page Number: | 2417 |
End Page Number: | 2441 |
Publication Date: | Jan 2000 |
Journal: | International Journal of Production Research |
Authors: | Hua Zhongsheng, Banerjee Prashant |
Keywords: | programming: integer, programming: linear |
In a multi-product, flexible manufacturing environment, line capacity of printed wiring board assembly systems may need to be adjusted at the beginning of each aggregate planning period because of demand fluctuation over multiple periods. A model of production planning and equipment changeover scheduling at the aggregate level is developed. In the described model, three kinds of equipment changeover methods, i.e. adding machine, removing machine and transferring machine, are involved. Because the model is a large-scale integer programming problem, it cannot be solved directly. A solution approach is developed, which first solves a recursive linear programming problem to obtain a rough set of machines to be added and a rough set of machines to be removed for each machine line in each period, then applies a branch and bound heuristic to the rough sets to obtain near-optimal solutions to the equipment changeover scheduling problem. Computational studies show the financial benefit both on capital cost and equipment changeover costs.