Abstract
This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines. In the problem, the jobs and machines have several different hierarchies and each job can be arbitrarily split between the machines with hierarchies not above the hierarchy of the job. The objective is to minimize the makespan. The authors present an optimal algorithm for the problem with three hierarchies.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
