Single-machine scheduling to minimize the size of input buffer

DOI10.1002/NAV.22256MaRDI QIDQ6936285zbMATH OpenFDO

Authors Shunji Tanaka, B. M. T. Lin

Publication date 1 September 2025

Published in Naval Research Logistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/NAV.22256

zbMATH Keywords

buffer capacitydynamic programmingheuristicsmixed integer linear programNP-hardnesssingle-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Mixed integer programming (90C11) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Exact algorithms for inventory constrained scheduling on a single machine
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum loss scheduling problems
• Preemptive scheduling with finite capacity input buffers
• Scheduling jobs with fixed start and end times
• Scheduling jobs with release times on a machine with finite storage
• Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
• Scheduling with finite capacity input buffers
• Scheduling with finite capacity output buffers

This page was built for publication: Single-machine scheduling to minimize the size of input buffer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936285)