Two approximation schemes for scheduling on parallel machines under a grade of service provision

DOI10.1142/S0217595912500297MaRDI QIDQ4649879zbMATH OpenOpenAlexFDO

Authors Weidong Li, Jianping Li, Tongquan Zhang

Publication date 15 November 2012

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595912500297

zbMATH Keywords

FPTASmakespanEPTAS

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
• Online Scheduling on Parallel Machines with Two GoS Levels
• Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision
• Online scheduling on parallel machines with two goS levels

Cites work

• A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• Approximation schemes for scheduling on parallel machines
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Grouping techniques for scheduling problems: simpler and faster
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Integer Programming with a Fixed Number of Variables
• Online hierarchical scheduling: an approach using mathematical programming
• Online parallel machines scheduling with two hierarchies
• Online scheduling on parallel machines with two goS levels
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling under a grade of service provision
• Scheduling parallel machines with inclusive processing set restrictions
• There is no EPTAS for two-dimensional knapsack
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(10)

• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
• Parallel machine scheduling under a grade of service provision
• Approximation scheme for single-machine rescheduling with job delay and rejection
• 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?)
• A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
• Algorithms for single machine scheduling problem with release dates and submodular penalties
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements

This page was built for publication: Two approximation schemes for scheduling on parallel machines under a grade of service provision

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