An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
DOI10.1137/S0097539790186716zbMATH Open0802.68016OpenAlexW2151482551MaRDI QIDQ4286236FDOQ4286236
Authors: Greg N. Frederickson, Susan Rodger 
Publication date: 27 March 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539790186716
Recommendations
- A note on ``Scheduling unit-time tasks with integer release times and deadlines
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
- List scheduling for jobs with arbitrary release times and unit-processing time
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
- A Note on Online Scheduling for Jobs with Arbitrary Release Times
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Algorithms for dynamic scheduling of unit execution time tasks
Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Cited In (3)
This page was built for publication: An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286236)
