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

DOI10.1016/J.TCS.2011.05.028MaRDI QIDQ719260zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ming Liu, Feifeng Zheng, Chengbin Chu, Yinfeng 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

competitive analysismakespanonline schedulingparallel machinesperiodic availability constraint

Mathematics Subject Classification ID

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

Recommendations

• Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Current trends in deterministic scheduling
• Machine scheduling with an availability constraint
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Makespan minimization for two parallel machines with an availability constraint
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.

Cited in

(7)

• Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
• Scheduling with periodic availability constraints to minimize makespan
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint
• Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.

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

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