Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 发表日期：

    2025年3月21日

查看全文
  • Murat Güngör,
  • Ali Tamer Ünal

摘要

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.