Article ID: | iaor19931338 |
Country: | United Kingdom |
Volume: | 43 |
Issue: | 6 |
Start Page Number: | 605 |
End Page Number: | 620 |
Publication Date: | Jun 1992 |
Journal: | Journal of the Operational Research Society |
Authors: | Raturi A.S., Hill A.V. |
Keywords: | heuristics |
This paper develops an approximate model for simultaneously determining reorder intervals and planned lead times for MRP systems. Unlike previous research, this model explicitly considers commonality, non-instantaneous production, multiple work centres (with multiple machines and with limited capacity), and queue inventory carrying cost. Four heuristic solution procedures for the non-linear integer optimization problem are proposed and compared with an exact branch-and-bound algorithm on a set of forty test problems. The results suggest that two of the heuristics are both effective and efficient.