We consider two generalizations of the fixed job schedule problem, obtained by imposing a bound on the spread-time or on the working time of each processor.
We consider two generalizations of the fixed job schedule problem, obtained by imposing a bound on the spread-time or on the working time of each processor.
We introduce several polynomial-time approximation algorithms, give efficient implementations for them, and analyze their complexity and worst case performance.
This thesis describes efficient approximation algorithms for some NP-Hard deterministic machine scheduling and related problems. An approximation algorithm ...
People also ask
Which algorithm technique is used to solve job scheduling?
What is the 2 approximation algorithm?
What is the NP approximation algorithm?
What is the difference between heuristic and approximation algorithm?
We consider two generalizations of the fixed job schedule problem, obtained by imposing a bound on the spread-time or on the working time of each processor.
We present an improved algorithm with approximation ratio 3/2 and polynomial running time. We also give matching results for the related problem of scheduling.
In this paper we consider the job interval selection prob- lem (JISP), a simple scheduling model with a rich history and numerous applications.
We study non-preemptive scheduling problems on identical parallel machines and uniformly related machines under both resource constraints and general precedence ...
In this chapter we survey approximation algorithms for scheduling to minimize average (weighted) com- pletion time (equivalently sum of (weighted) ...
The problem of minimizing the makespan of the schedule for a set of jobs is one of the most well-studied in scheduling theory. For this problem, we are given a ...