222 search results - page 1 / 45 » Approximation Algorithms for the Job Interval Selection Prob... |
MOR
2006
13 years 4 months ago
2006
ISAAC
2000
Springer
13 years 8 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
RTCSA
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
GECCO
1999
Springer
13 years 8 months ago
1999
Springer
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...
IFIPTCS
2010
13 years 2 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...