Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
DOI10.1016/J.TCS.2011.05.028zbMATH Open1233.90165DBLPjournals/tcs/LiuZCX11OpenAlexW2043605162WikidataQ57185691 ScholiaQ57185691MaRDI QIDQ719260FDOQ719260
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
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Makespan minimization for two parallel machines with an availability constraint
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Current trends in deterministic scheduling
- Machine scheduling with an availability constraint
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
Cited In (7)
- Scheduling with periodic availability constraints to minimize makespan
- 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.
- 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
- 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
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)
