Online Interval Scheduling to Maximize Total Satisfaction

DOI10.1007/978-3-319-94776-1_10MaRDI QIDQ5889050zbMATH OpenOpenAlexFDO

Authors Koji M. Kobayashi

Publication date 26 April 2023

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

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_10

Mathematics Subject Classification ID

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

Recommendations

• Online interval scheduling to maximize total satisfaction
• Interval scheduling on related machines
• scientific article; zbMATH DE number 1003261
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
• Online Job Admission

Cited in

(7)

• Online interval scheduling to maximize total satisfaction
• Approximating Interval Scheduling Problems with Bounded Profits
• Scheduling to Maximize Participation
• Online scheduling with interval conflicts
• scientific article; zbMATH DE number 7051282 (Why is no real title available?)
• Online Job Admission
• Scheduling to maximize participation

This page was built for publication: Online Interval Scheduling to Maximize Total Satisfaction

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