Improved competitive algorithms for online scheduling with partial job values

@article{Chin2004ImprovedCA,
  title={Improved competitive algorithms for online scheduling with partial job values},
  author={Francis Y. L. Chin and Stanley P. Y. Fung},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={325},
  pages={467-478}
}
This paper considers an online scheduling problem arising from Quality-of-Service (QoS) applications. We are required to schedule a set of jobs, each with release time, deadline, processing time and weight. The objective is to maximize the total value obtained for scheduling the jobs. Unlike the traditional model of this scheduling problem, in our model unfinished jobs also get partial values proportional to their amounts processed. We give a new non-timesharing algorithm GAP for this problem… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…