Online Scheduling of Equal-Length Jobs on Parallel Machines

DOI10.1007/978-3-540-75520-3_39zbMATH Open1151.90404OpenAlexW1504289907MaRDI QIDQ3527232FDOQ3527232

Authors Jihuan Ding, Tomáš Ebenlendr, Jiří Sgall, 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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

(17)

• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• Online scheduling of unit length jobs with commitment and penalties
• On-line scheduling of equal-length intervals on parallel machines
• Online scheduling of parallel jobs with preemption on two identical machines
• Dispatching equal-length jobs to parallel machines to maximize throughput
• Online Scheduling of Bounded Length Jobs to Maximize Throughput
• Online scheduling with immediate and reliable lead-time quotation
• Parallel machine problems with equal processing times: a survey
• Online scheduling of equal-processing-time task systems
• A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
• Online scheduling with preemption or non-completion penalties
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Scheduling parallel jobs online with convex and concave parallelizability
• Online C-benevolent job scheduling on multiple machines
• Online scheduling of malleable parallel jobs with setup times on two identical machines
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
• 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)