An FPTAS for parallel machine scheduling under a grade of service provision to minimize makespan. ... Online scheduling on parallel machines with two GoS levels.

In this paper, we present an efficient polynomial-time approximation scheme (EPTAS) with running time O(nlogn) for the special case where the GoS level is ...

In this paper, an efficient polynomial-time approximation scheme (EPTAS) with running time O(n log n) for the special case where the GoS level is either 1 ...

TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION ; WEIDONG LI, ; JIANPING LI, and ; TONGQUAN ZHANG.

We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed number of machines subject to a grade of service ...

Mar 16, 2009 · We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed number of machines subject to a grade ...

We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed number of machines subject to a grade of service provision.

Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision · Weidong LiJianping LiTongquan Zhang. Computer Science ...

In this paper we present a fully polynomial-time approximation scheme (FPTAS) for the problem. Pm|GoS|Cmax with a fixed number of m, which greatly improves the ...

An FPTAS for parallel machine scheduling under a grade of service provision to minimize makespan. ... On line scheduling on parallel machines with two GoS levels.