Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem

Andreas Weidenhiller and Herbert Jodlbauer

European Journal of Operational Research, 2009, vol. 199, issue 1, 139-149

Abstract: In the context of a single machine, multi-item, continuous-time lot sizing and scheduling problem with a production rate alternating between the two values zero and full production rate, this paper identifies classes of equivalent problem instances which differ from one another in the way in which demand is represented. Each class contains an instance with a continuous cumulated demand function, and may contain demand functions with very different shapes, including functions with discontinuities. When approaching the problem (in order to solve it numerically, or to prove analytical results etc.), it therefore becomes possible to select, from many different representations, the problem instance which best meets the requirements of the applied method.

Keywords: Scheduling; Lot; sizing; Equivalence; classes (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00982-X
Full text for ScienceDirect subscribers only

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:eee:ejores:v:199:y:2009:i:1:p:139-149

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().