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

DOI10.1016/J.IPL.2008.11.008zbMATH Open1193.68062OpenAlexW2043457363MaRDI QIDQ976111FDOQ976111

Authors 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)

Recommendations

• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• Two approximation schemes for scheduling on parallel machines under a grade of service provision
• Parallel machine scheduling under a grade of service provision
• scientific article; zbMATH DE number 5525401
• Approximation schemes for scheduling on parallel machines

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Parallel machine scheduling under a grade of service provision
• Scheduling parallel machines with inclusive processing set restrictions
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(7)

• Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision
• scientific article; zbMATH DE number 5525401 (Why is no real title available?)
• Optimal algorithm for semi-online scheduling on two machines under GoS levels
• Two approximation schemes for scheduling on parallel machines under a grade of service provision
• Parallel machine scheduling under a grade of service provision
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

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

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