25 search results - page 4 / 5 » On-line scheduling of unit time jobs with rejection: minimiz... |
CIKM
2009
Springer
14 years 26 days ago
2009
Springer
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
COR
2007
13 years 6 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
IFIPTCS
2010
13 years 4 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...
DAGSTUHL
2006
13 years 7 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
ESWA
2008
13 years 6 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...