The multi-level lot sizing problem with flexible production sequences

Joseph Begnaud, Saif Benjaafar and Lisa Miller

IISE Transactions, 2009, vol. 41, issue 8, 702-715

Abstract: This paper considers a multi-level/multi-machine lot sizing problem with flexible production sequences, where the quantity and combination of items required to produce another item need not be unique. The problem is formulated as a mixed-integer linear program and the notion of echelon inventory is used to construct a new class of valid inequalities, which are called echelon cuts. Numerical results show the computational power of the echelon cuts in a branch-and-cut algorithm. These inequalities are compared to known cutting planes from the literature and it is found that, in addition to being strong and valid for the flexible production case, echelon cuts are at least as strong as certain classes of known cuts in the restricted fixed production setting.

Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/07408170902736697 (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:taf:uiiexx:v:41:y:2009:i:8:p:702-715

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/07408170902736697

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().