Add to ORKGIn this paper we present constructive algorithms for the classical deterministic scheduling problem of minimising the makespan on identical parallel machines. Since the problem is known to be NP-hard in the strong sense, the approximat
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
In this paper we consider an on-line scheduling problem, where jobs with similar processing times wi...
In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two m...
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
16th International Symposium on Algorithms and Computation, ISAAC 2005, Hainan, 19-21 December 2005I...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m...
We consider the problem of scheduling jobs on two parallel identical machines where an optimal sched...
We consider bicriteria scheduling problems with identical machines in parallel and two popular but c...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set o...
This paper considers a number of machines minimization scheduling problem with restricted processing...
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total ...
We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical pa...
We consider the following problem. There are m parallel machines and n independent jobs. Each job is...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
In this paper we consider an on-line scheduling problem, where jobs with similar processing times wi...
In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two m...
AbstractThe NP-hard problem addressed in this paper is well known in the scheduling literature as R∥...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
16th International Symposium on Algorithms and Computation, ISAAC 2005, Hainan, 19-21 December 2005I...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m...
We consider the problem of scheduling jobs on two parallel identical machines where an optimal sched...
We consider bicriteria scheduling problems with identical machines in parallel and two popular but c...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set o...
This paper considers a number of machines minimization scheduling problem with restricted processing...
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total ...
We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical pa...
We consider the following problem. There are m parallel machines and n independent jobs. Each job is...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
In this paper we consider an on-line scheduling problem, where jobs with similar processing times wi...
In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two m...