Lot Sizing and Sequencing for N Products on One Facility

Christian M. Delporte and L. Joseph Thomas
Additional contact information
Christian M. Delporte: Université de Louvain, Belgium
L. Joseph Thomas: Cornell University

Management Science, 1977, vol. 23, issue 10, 1070-1079

Abstract: The problem of determining both lot sizes and repeating sequences for N products on one facility is difficult due to the combinatorial and continuous nature of the problem. The work that has been done on the problem has made various assumptions ("zero-switch rule" or "equal lot size," for example) to simplify the problem. Several heuristics have been suggested that come fairly close to a computable lower bound on cost. This paper discusses a mathematical programming formulation of the entire problem, along with reasons for its (current) nonpracticality. Heuristics for reducing the problem to a manageable mathematical programming formulation are presented. Specifically, a formulation is given when the sequence is known with both (potentially unequal) lot sizes and idle time periods as variables. The formulation is a convex quadratic program. Heuristics for finding sequences (to feed to the quadratic program) are explored, and examples from previous literature demonstrate that the methods here give consistent results as good as and sometimes significantly better than previous methods. Finally, we discuss situations in which such methods might be important and situations in which easier methods should suffice.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.10.1070 (application/pdf)

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:inm:ormnsc:v:23:y:1977:i:10:p:1070-1079

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().