Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
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.
Year of publication: |
2009
|
---|---|
Authors: | Weidenhiller, Andreas ; Jodlbauer, Herbert |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 199.2009, 1, p. 139-149
|
Publisher: |
Elsevier |
Subject: | Scheduling Lot sizing Equivalence classes |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
Weidenhiller, Andreas, (2009)
-
Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
Weidenhiller, Andreas, (2009)
-
Kombinierte Verschnitt- und Bestandsoptimierung
Jodlbauer, Herbert, (2008)
- More ...