scientific article; zbMATH DE number 7051282

MaRDI QIDQ4633926zbMATH OpenFDO

Authors Chandra Chekuri, Benjamin Moseley

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496891

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling to minimize maximum response time and maximum delay factor
• Online scheduling to minimize modified total tardiness with an availability constraint
• Online scheduling to minimize total weighted (modified) earliness and tardiness cost
• On-line Scheduling with Optimal Worst-Case Response Time
• Online interval scheduling to maximize total satisfaction
• Online Interval Scheduling to Maximize Total Satisfaction
• On-line scheduling revisited
• Online scheduling in manufacturing. A cumulative delay approach
• Online Scheduling of Bounded Length Jobs to Maximize Throughput

Cited in

(8)

• Online scheduling to minimize modified total tardiness with an availability constraint
• Minimizing the maximum starting time on-line
• Online scheduling of time-critical tasks to minimize the number of calibrations
• Rejecting jobs to minimize load and maximum flow-time
• Online scheduling FIFO policies with admission and push-out
• Online scheduling to minimize maximum response time and maximum delay factor
• Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
• Minimizing maximum (weighted) flow-time on related and unrelated machines

This page was built for publication:

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