Dispatching equal-length jobs to parallel machines to maximize throughput

DOI10.1007/978-3-642-13731-0_33MaRDI QIDQ3569904zbMATH OpenOpenAlexFDO

Authors David P. Bunde, Michael H. Goldwasser

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_33

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online Scheduling of Equal-Length Jobs on Parallel Machines
• Online nonpreemptive scheduling of equal-length jobs on two identical machines
• Improved online scheduling in maximizing throughput of equal length jobs
• Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

Cited in

(4)

• Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
• Online nonpreemptive scheduling of equal-length jobs on two identical machines
• Improved online scheduling in maximizing throughput of equal length jobs
• A dispatching algorithm for parallel machines with rework processes

This page was built for publication: Dispatching equal-length jobs to parallel machines to maximize throughput

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