A Note on Online Scheduling for Jobs with Arbitrary Release Times

DOI10.1007/978-3-642-02026-1_33zbMATH Open1246.90053OpenAlexW1500611422MaRDI QIDQ3637082

Could not fetch data.

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_33

zbMATH Keywords

competitive ratiomakespanidentical parallel machineson-line scheduling

Mathematics Subject Classification ID

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

Related Items (2)

Online scheduling of jobs with kind release times and deadlines on a single machine ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines

This page was built for publication: A Note on Online Scheduling for Jobs with Arbitrary Release Times

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