200 search results - page 16 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
COR
2011
13 years 3 months ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diï¬...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
JCO
2007
13 years 8 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence†information. It is known in advance that the last job has the longest processing ...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...