Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint

DOI10.1007/978-3-642-14355-7_20zbMath1286.90060OpenAlexW1482646003MaRDI QIDQ3578374

Ming Liu, Lu Wang, Chengbin Chu, Yin-Feng Xu

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_20

zbMATH Keywords

competitive analysismakespanuniform machinesonline schedulingperiodic availability constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint