Scheduling jobs with release times on a machine with finite storage

DOI10.1016/0377-2217(94)90209-7zbMath0827.90077OpenAlexW2105780058MaRDI QIDQ1330556

Walter Kern, Sjoerd M. Baas, Willem M. Nawijn

Publication date: 18 August 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/scheduling-jobs-with-release-times-on-a-machine-with-finite-storage(db0af510-0776-4862-b6ad-e3f65f0ffa6b).html

zbMATH Keywords

deadlinesbufferone machinearbitrary processing and arrival timesnonpreemptable

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Scheduling jobs with fixed start and end times
• Minimum loss scheduling problems
• Contraction Mappings in the Theory Underlying Dynamic Programming

This page was built for publication: Scheduling jobs with release times on a machine with finite storage