Online Scheduling with Hard Deadlines
From MaRDI portal
Publication:4943083
Recommendations
- On-line scheduling with hard deadlines
- Online Scheduling with Hard Deadlines on Parallel Machines
- On-line scheduling of jobs with order arrival time and hard deadline on two parallel identical machines
- scientific article; zbMATH DE number 1834669
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Cited in
(14)- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- On-line scheduling with tight deadlines.
- Online scheduling of jobs with kind release times and deadlines on a single machine
- Admission control with immediate notification
- Aggressive online deadline scheduling
- On-line scheduling with setup costs
- Temperature aware online algorithms for scheduling equal length jobs
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
- Temperature aware online algorithms for scheduling equal length jobs
- Online Scheduling with Hard Deadlines on Parallel Machines
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
- Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
- Online scheduling with reassignment
- How much can lookahead help in online single machine scheduling
This page was built for publication: Online Scheduling with Hard Deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943083)
