Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint

DOI10.1016/j.tcs.2011.05.028zbMath1233.90165OpenAlexW2043605162WikidataQ57185691 ScholiaQ57185691MaRDI QIDQ719260

Ming Liu, Feifeng Zheng, Chengbin Chu, Yin-Feng Xu

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.028

zbMATH Keywords

parallel machinescompetitive analysismakespanonline schedulingperiodic availability constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items

Online and semi-online scheduling to minimize makespan on single machine with an availability constraint ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods

Cites Work

• Unnamed Item
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Current trends in deterministic scheduling
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• Makespan minimization for two parallel machines with an availability constraint
• Machine scheduling with an availability constraint

This page was built for publication: Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint