Add to ORKGConsider the problem of scheduling a set of tasks of length p without preemption on m identical machines with given release and deadline times. We present a new algorithm for computing the schedule with minimal completion times and makespan. The algorithm has time complexity O(min(1, p/m)n²) which improves substantially over the best known algorithm with complexity O(mn²)
Abstract. The problem 01 sequencing jobs 01 equal durations with available (readiness) times and the...
Suppose that $n$ independent tasks are to be scheduled without preemption on an unlimited number of ...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
Consider the problem of scheduling a set of tasks of length p without preemption on $m$ identical ma...
textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to ...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set o...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
We consider the problem of scheduling n jobs on m parallel machines with inclusive processing set re...
AbstractThe makespan problem on a single machine for a set of tasks with two distinct deadlines and ...
Abstract. Consider n independent jobs and m uniform machines in parallel. Each job has a processing ...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are giv...
[[abstract]]Consideration is given to the problem of scheduling tasks each of which is logically dec...
Abstract. The problem 01 sequencing jobs 01 equal durations with available (readiness) times and the...
Suppose that $n$ independent tasks are to be scheduled without preemption on an unlimited number of ...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
Consider the problem of scheduling a set of tasks of length p without preemption on $m$ identical ma...
textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to ...
We are given a nite set of jobs of equal processing times with readiness times and tails and a set o...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
We consider the problem of scheduling n jobs on m parallel machines with inclusive processing set re...
AbstractThe makespan problem on a single machine for a set of tasks with two distinct deadlines and ...
Abstract. Consider n independent jobs and m uniform machines in parallel. Each job has a processing ...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are giv...
[[abstract]]Consideration is given to the problem of scheduling tasks each of which is logically dec...
Abstract. The problem 01 sequencing jobs 01 equal durations with available (readiness) times and the...
Suppose that $n$ independent tasks are to be scheduled without preemption on an unlimited number of ...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...