An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints

DOI10.1007/s40305-016-0119-1zbMath1368.90078OpenAlexW2310430865MaRDI QIDQ2014051

Zhaohui Liu, Jia Xu

Publication date: 10 August 2017

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0119-1

zbMATH Keywords

schedulingparallel machineonline algorithmeligibility constraint

Mathematics Subject Classification ID

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

Related Items (2)

Online scheduling on two parallel identical machines under a grade of service provision ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels

Cites Work

• Scheduling on identical machines: How good is LPT in an on-line setting?
• Online scheduling with equal processing times and machine eligibility constraints
• Parallel machine scheduling with nested job assignment restrictions
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Parallel Machines On-Line
• Makespan minimization in online scheduling with machine eligibility
• An optimal online algorithm for scheduling two machines with release times

This page was built for publication: An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints