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

Murat Güngör () and Ali Tamer Ünal ()
Additional contact information
Murat Güngör: Istanbul Medeniyet University
Ali Tamer Ünal: Boğaziçi University

SN Operations Research Forum, 2025, vol. 6, issue 2, 1-8

Abstract: 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.

Keywords: Lot-sizing; Scheduling; Discrete; Multi-level; Feasibility (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-025-00441-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:snopef:v:6:y:2025:i:2:d:10.1007_s43069-025-00441-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-025-00441-0

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().