A comment on parallel-machine scheduling under a grade of service provision to minimize makespan

DOI10.1016/J.IPL.2008.11.008zbMath1193.68062OpenAlexW2043457363MaRDI QIDQ976111

Gerhard J. Woeginger

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.11.008

zbMATH Keywords

schedulinggrade of serviceeligibility

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 (3)

TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION ⋮ Optimal algorithm for semi-online scheduling on two machines under GoS levels ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

Cites Work

• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• Parallel machine scheduling under a grade of service provision
• Scheduling parallel machines with inclusive processing set restrictions
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Unnamed Item

This page was built for publication: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan