Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”

DOI10.1287/mnsc.43.1.122zbMath0900.90283OpenAlexW2087605237MaRDI QIDQ4367226

Hermann Jahnke, Wolfgang Brüggemann

Publication date: 4 June 1998

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.43.1.122

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Related Items (3)

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources ⋮ The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability

This page was built for publication: Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”