A MIP based heuristic for capacitated MRP systems


Ozturk C., Ornek A. M.

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.63, sa.4, ss.926-942, 2012 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 63 Sayı: 4
  • Basım Tarihi: 2012
  • Doi Numarası: 10.1016/j.cie.2012.06.005
  • Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.926-942
  • Orta Doğu Teknik Üniversitesi Kuzey Kıbrıs Kampüsü Adresli: Hayır

Özet

Although Material Requirements Planning (MRP) is the most widely used production planning tool in today's manufacturing companies, its inability to perform an exhaustive capacity planning, lack of a comprehensive and integrated shop floor extension and using constant and inflated lead times necessitate intelligent methods for developing cost effective production plans. A single optimization model might be employed to overcome these limitations, but it would be intractable to use it in large manufacturing systems. Hence, in this paper, we propose a heuristic method called Capacity Allocater and Scheduler, CAS, to eliminate drawbacks of MRP systems and provide solutions for large-scale instances. The CAS procedure. based on iteratively solving relaxed Mixed Integer Programming (MIP) models, is built on a lot sizing and scheduling framework, which considers both supply alternatives and lot size restrictions simultaneously. Finally, we give a detailed numerical example to demonstrate how CAS may be used in practice, and provide our concluding remarks. (C) 2012 Elsevier Ltd. All rights reserved.