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...
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
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 ...
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...