• Graduate Programs
    • Tinbergen Institute Research Master in Economics
      • Why Tinbergen Institute?
      • Research Master
      • Admissions
      • Course Registration
      • Facilities
      • PhD Vacancies
      • Selected PhD Placements
    • Research Master Business Data Science
    • PhD Vacancies
  • Research
  • Browse our Courses
  • Events
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Gender in Society
      • Machine Learning for Business
      • Marketing Research with Purpose
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Events Calendar
    • Events Archive
    • Tinbergen Institute Lectures
    • 16th Tinbergen Institute Annual Conference
    • Annual Tinbergen Institute Conference
  • News
  • Alumni
    • PhD Theses
    • Master Theses
    • Selected PhD Placements
    • Key alumni publications
    • Alumni Community

Önal, M., \van den Heuvel\, W., Dereli, \.M. and Albey, E. (2023). Economic lot sizing problem with tank scheduling European Journal of Operational Research, 308(1):166--182.


  • Affiliated author
    Wilco van den Heuvel
  • Publication year
    2023
  • Journal
    European Journal of Operational Research

We introduce a multiple-item economic lot sizing problem where items are produced through the fermentation of some raw materials. Fermentation takes place in specialized tanks that have finite capacities, and duration of the fermentation process is item dependent. When fermentation starts, the tanks are not available for the duration of the fermentation process. We analyze the complexity of this problem under various assumptions on the number of items and tanks. In particular, we show that several cases of the problem are (strongly) NP-hard, and we propose polynomial time algorithms to some single item cases. In addition, we propose a quick and simple heuristic approach for one of the multiple item cases.