Online Preemptive Scheduling with Immediate Decision or Notification and Penalties

DOI10.1007/978-3-642-14031-0_42MaRDI QIDQ3578339zbMATH OpenOpenAlexFDO

Authors Stanley P. Y. Fung

Publication date 20 July 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-14031-0_42

Mathematics Subject Classification ID

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

Recommendations

• Online scheduling with preemption or non-completion penalties
• Preemptive online algorithms for scheduling
• Preemptive online scheduling with reordering
• Preemptive Online Scheduling with Reordering
• scientific article; zbMATH DE number 1670533
• Online Scheduling of Precedence Constrained Tasks
• scientific article; zbMATH DE number 1834669
• scientific article; zbMATH DE number 1617256
• On-line scheduling with precedence constraints
• Multi-priority online scheduling with cancellations

Cited in

(8)

• On-line production order scheduling with preemption penalties
• Competitive analysis for make-to-order scheduling with reliable lead time quotation
• Aggressive online deadline scheduling
• Online scheduling of unit length jobs with commitment and penalties
• On Job Scheduling with Preemption Penalties
• Online scheduling with preemption or non-completion penalties
• Online scheduling with immediate and reliable lead-time quotation
• Lower bounds on online deadline scheduling with preemption penalties

This page was built for publication: Online Preemptive Scheduling with Immediate Decision or Notification and Penalties

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