Two approximation schemes for scheduling on parallel machines under a grade of service provision
From MaRDI portal
Publication:4649879
DOI10.1142/S0217595912500297zbMATH Open1251.90166OpenAlexW2157098840MaRDI QIDQ4649879FDOQ4649879
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
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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Integer Programming with a Fixed Number of Variables
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Approximation schemes for scheduling on parallel machines
- There is no EPTAS for two-dimensional knapsack
- Online parallel machines scheduling with two hierarchies
- Online scheduling on parallel machines with two goS levels
- Parallel machine scheduling under a grade of service provision
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Scheduling parallel machines with inclusive processing set restrictions
- Grouping techniques for scheduling problems: simpler and faster
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Online hierarchical scheduling: an approach using mathematical programming
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
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
- Title not available (Why is that?)
- 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)
