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

zbMATH Keywords

heuristicsdynamic programmingNP-hardnessmixed integer linear programsingle-machine schedulingbuffer capacity

Mathematics Subject Classification ID

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

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)