An Efficient Algorithm to Check Feasibility for Two-Level Discrete Lot-Sizing and Scheduling

Abstract

In general, discrete lot-sizing and scheduling problem (DLSP) is NP-hard in single level, all the more so in multiple levels. We investigate the computational complexity of conceivably the simplest yet nontrivial multi-level DLSP. Namely, we ignore setups and examine the feasibility problem that asks whether all demand can be met on time. As it turns out, an answer can be provided by an algorithm that is polynomial in the planning horizon. © 2025 Elsevier B.V., All rights reserved.