TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
From MaRDI portal
Publication:4649879
DOI10.1142/S0217595912500297zbMath1251.90166OpenAlexW2157098840MaRDI QIDQ4649879
Tongquan Zhang, Jianping Li, Weidong Li
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
Related Items (4)
Algorithms for single machine scheduling problem with release dates and submodular penalties ⋮ Approximation scheme for single-machine rescheduling with job delay and rejection ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
Cites Work
- Online hierarchical scheduling: an approach using mathematical programming
- There is no EPTAS for two-dimensional knapsack
- Online parallel machines scheduling with two hierarchies
- Grouping techniques for scheduling problems: simpler and faster
- Online scheduling on parallel machines with two goS levels
- 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
- Approximation schemes for scheduling on parallel machines
- Parallel machine scheduling under a grade of service provision
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Integer Programming with a Fixed Number of Variables
- Scheduling parallel machines with inclusive processing set restrictions
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
This page was built for publication: TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
