Online Scheduling of Equal-Length Jobs on Parallel Machines
From MaRDI portal
Publication:3527232
DOI10.1007/978-3-540-75520-3_39zbMATH Open1151.90404OpenAlexW1504289907MaRDI QIDQ3527232FDOQ3527232
Jihuan Ding, Jiří Sgall, Tomáš Ebenlendr, Guochuan Zhang
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_39
Recommendations
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
- On-line scheduling of equal-length intervals on parallel machines
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
- Structural Information and Communication Complexity
- On-line scheduling of parallel jobs
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- On an on-line scheduling problem for parallel jobs
- Online nonpreemptive scheduling of equal-length jobs on two identical machines
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
Cited In (14)
- Online scheduling with immediate and reliable lead-time quotation
- Online scheduling of parallel jobs with preemption on two identical machines
- Online scheduling of equal-processing-time task systems
- Scheduling parallel jobs online with convex and concave parallelizability
- Online C-benevolent job scheduling on multiple machines
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Parallel machine problems with equal processing times: a survey
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
- Online scheduling with preemption or non-completion penalties
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
This page was built for publication: Online Scheduling of Equal-Length Jobs on Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527232)
