A note on ``Scheduling unit-time tasks with integer release times and deadlines
From MaRDI portal
Publication:689642
DOI10.1016/0020-0190(93)90241-ZzbMath0780.68008OpenAlexW52323648MaRDI QIDQ689642
Publication date: 15 November 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90241-z
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ A linear time algorithm for maximum matchings in convex, bipartite graphs
Cites Work
This page was built for publication: A note on ``Scheduling unit-time tasks with integer release times and deadlines
