Online scheduling with general cost functions

SIAM J. Comput., pp. 126-143, 2014.

Cited by: 23|Bibtex|Views14|Links
EI
Keywords:
arbitrary non-decreasing cost functionspecial casegeneral objectivejob jjhdf algorithmMore(7+)

Abstract:

We consider a general online scheduling problem on a single machine with the objective of minimizing Σjwjg(Fj), where wj is the weight/importance of job Jj, Fj is the flow time of the job in the schedule, and g is an arbitrary non-decreasing cost function. Numerous natural scheduling objectives are special cases of this general objective....More

Code:

Data:

Your rating :
0

 

Tags
Comments