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

Herbert Jodlbauer, Andreas Weidenhiller

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)139-149
Number of pages11
JournalEuropean Journal of Operational Research
Volume199
Issue number1
DOIs
Publication statusPublished - 16 Nov 2009

Keywords

  • Equivalence classes
  • Lot sizing
  • Scheduling

Fingerprint Dive into the research topics of 'Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem'. Together they form a unique fingerprint.

Cite this