Sciweavers

Share
230 search results - page 1 / 46
» Approximation Algorithms for the Job Interval Selection Prob...
Sort
View
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
9 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
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...
Thomas Erlebach, Frits C. R. Spieksma
RTCSA
2005
IEEE
9 years 3 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
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...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
GECCO
1999
Springer
115views Optimization» more  GECCO 1999»
9 years 2 months ago
A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems
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 ...
Carlos A. Brizuela, Nobuo Sannomiya
IFIPTCS
2010
8 years 8 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
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...
Marin Bougeret, Pierre-François Dutot, Klau...
books