A MRP Lot Size Scheduling Problem

DOI

Bibliographic Information

Other Title
  • MRPロットサイズ問題

Search this article

Description

MRP (Material Requirements Planning) lot size scheduling problem is to decide the lot sizes for all items which minimize the total setup, production and inventory costs over a planning horizon, and is one of the important subjects in MRP research. This paper presents a heuristic algorithm which leads to an approximate optimal or potimal sulution for it. The algorithm is tested on some examples which involve from small to large problems. The results of this test indicate that it always brings the effective solutions for all examples.

Journal

Details 詳細情報について

  • CRID
    1390282763076602496
  • NII Article ID
    110003935029
  • DOI
    10.11221/jimapre.40.3_149
  • ISSN
    24329983
    03864812
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top