Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision

DOI10.1007/978-3-642-14355-7_27zbMath1286.90069OpenAlexW1569919889MaRDI QIDQ3578381

Yong Wu, Qi-Fan Yang

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_27

zbMATH Keywords

schedulingcompetitive ratiograde of servicesemi-onlinetwo machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Semi-online scheduling problems on two uniform machines under a grade of service provision ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

This page was built for publication: Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision