Online scheduling of unit length jobs with commitment and penalties

DOI10.1007/978-3-662-44602-7_5MaRDI QIDQ3190150zbMATH OpenOpenAlexFDO

Authors Stanley P. Y. Fung

Publication date 15 September 2014

Published in Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01402028/file/978-3-662-44602-7_5_Chapter.pdf

Mathematics Subject Classification ID

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

Recommendations

• A general framework for handling commitment in online throughput maximization
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
• A general framework for handling commitment in online throughput maximization
• Online Scheduling of Equal-Length Jobs on Parallel Machines
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

Cited in

(6)

• Online scheduling with unit processing times and processing set restrictions
• Admission control with immediate notification
• Clairvoyant mechanisms for online auctions
• ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
• A general framework for handling commitment in online throughput maximization
• A general framework for handling commitment in online throughput maximization

This page was built for publication: Online scheduling of unit length jobs with commitment and penalties

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