Online and semi-online scheduling to minimize makespan on single machine with an availability constraint

DOI10.1142/S1793830915500214zbMath1327.90069OpenAlexW1908901187MaRDI QIDQ3451058

Ganggang Li, Qiang Gao, Xi-wen Lu

Publication date: 10 November 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830915500214

zbMATH Keywords

algorithmschedulingonlinesemi-onlineavailability constraint

Mathematics Subject Classification ID

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

Cites Work

• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
• Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
• Single machine flow-time scheduling with scheduled maintenance
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
• Improved algorithms for two single machine scheduling problems
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint
• Approximation algorithms for single machine scheduling with one unavailability period
• Two-machine flowshop scheduling with availability constraints
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Machine scheduling with an availability constraint

This page was built for publication: Online and semi-online scheduling to minimize makespan on single machine with an availability constraint