Online Job Admission

DOI10.1007/978-1-4020-9688-4_16MaRDI QIDQ5192368zbMATH OpenOpenAlexWikidataFDO

Authors Rob van Stee, Stephan Westphal, Sven O. Krumke

Publication date 5 August 2009

Published in Fundamental Problems in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4020-9688-4_16

zbMATH Keywords

\(c\)-competitiveonline algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
• On-line parallel machine scheduling with selective jobs
• Online Scheduling with Hard Deadlines on Parallel Machines
• Online scheduling of jobs with fixed start times on related machines
• Online Interval Scheduling to Maximize Total Satisfaction

Cited in

(8)

• Maximizing job benefits on-line
• Online interval scheduling to maximize total satisfaction
• scientific article; zbMATH DE number 1670528 (Why is no real title available?)
• Competitive Algorithms for Cottage Rental
• Online Interval Scheduling to Maximize Total Satisfaction
• A general framework for handling commitment in online throughput maximization
• A general framework for handling commitment in online throughput maximization
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

This page was built for publication: Online Job Admission

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