Showing 1 - 1 of 1
In this paper we consider online scheduling of malleable parallel jobs on two identical machines, where jobs arrive over time. Each job Jj has an execution time tj=pj/kj+(kj-1)cj when it is processed on kj machines, where pj0 and cj0 are the length and setup time of job Jj. The objective is to...
Persistent link: https://www.econbiz.de/10008494765