Solution methods for material requirement planning with lot-size dependent lead times

Raj Jagannathan and Lung Juang

Annals of Operations Research, 1998, vol. 76, issue 0, 217 pages

Abstract: A mixed zero-one programming model of an MRP lot-sizing problem whose lead times are dependent on lot sizes is considered. The algorithm is tested under different randomly generated parameter values and computerized results are presented. Copyright Kluwer Academic Publishers 1998

Keywords: material requirement planning; Lagrangian relaxation; dynamic programming; mixed zero-one programming (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018992404128 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:76:y:1998:i:0:p:201-217:10.1023/a:1018992404128

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018992404128

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().