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. Both results substantially simplify a recent construction by Ji and Cheng [IPL 108 (2008) 171–174]
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed...
We consider the m parallel-machine scheduling problem that process service requests from various cus...
As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investi...
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other resu...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigne...
We derive a polynomial time approximation scheme for a special case of makespan minimization on unre...
In a recent article, Kuo et al study an unrelated parallel machine scheduling problem in which the p...
We consider the problem of scheduling $n$ independent jobs on $m$ unrelated parallel machines. Each ...
This is the Pre-Published Version. We consider the problem of scheduling a set of jobs with differen...
. In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequenc...
We consider the classical scheduling problem on parallel identical machines to minimize the makespan...
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed...
We consider the m parallel-machine scheduling problem that process service requests from various cus...
As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investi...
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other resu...
AbstractIn a recent paper [Discrete Appl. Math. 130 (2003) 449–467], Yang, Ye, and Zhang investigate...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigne...
We derive a polynomial time approximation scheme for a special case of makespan minimization on unre...
In a recent article, Kuo et al study an unrelated parallel machine scheduling problem in which the p...
We consider the problem of scheduling $n$ independent jobs on $m$ unrelated parallel machines. Each ...
This is the Pre-Published Version. We consider the problem of scheduling a set of jobs with differen...
. In the job shop scheduling problem we are given m machines and n jobs; a job consists of a sequenc...
We consider the classical scheduling problem on parallel identical machines to minimize the makespan...
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and o...
We consider parallel-machine scheduling problems in which the processing time of a job is a simple l...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
DOI
Add to ORKG