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

DOI10.1007/S40305-016-0119-1MaRDI QIDQ2014051zbMATH OpenOpenAlexFDO

Authors Jia Xu, Zhaohui Liu

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

eligibility constraintonline algorithmparallel machinescheduling

Mathematics Subject Classification ID

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

Recommendations

• Optimal online algorithms for scheduling on two identical machines under a grade of service
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
• Online Scheduling on Parallel Machines with Two GoS Levels
• Online scheduling on parallel machines with two goS levels
• Heuristics for online scheduling on identical parallel machines with two GoS levels

Cites work

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

Cited in

(11)

• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
• Heuristics for online scheduling on identical parallel machines with two GoS levels
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Online scheduling on two parallel identical machines under a grade of service provision
• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
• Online scheduling with increasing subsequence serving constraint
• A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
• Online Scheduling on Parallel Machines with Two GoS Levels
• Semi-online machine covering problem on three hierarchical machines with bounded processing times
• Improved bounds for online scheduling with eligibility constraints
• Online scheduling on parallel machines with two goS levels

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

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