A note on ``Scheduling unit-time tasks with integer release times and deadlines

DOI10.1016/0020-0190(93)90241-ZzbMATH Open0780.68008OpenAlexW52323648MaRDI QIDQ689642FDOQ689642

Authors: George Steiner, Scott Yeomans 

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

Recommendations

• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
• A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
• On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem

zbMATH Keywords

schedulingdeadlinesrelease times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Scheduling unit-time tasks with integer release times and deadlines
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

Cited In (4)

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
• Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
• An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
• A linear time algorithm for maximum matchings in convex, bipartite graphs

This page was built for publication: A note on ``Scheduling unit-time tasks with integer release times and deadlines

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