Guo, Shouwei; Kang, Liying - In: European Journal of Operational Research 206 (2010) 3, pp. 555-561
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...