Similar Search Results

A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs

Kang, Liying; Ng, C.T. - In: International Journal of Production Economics 109 (2007) 1-2, pp. 180-184

Persistent link: https://www.econbiz.de/10005417932

Online scheduling of malleable parallel jobs with setup times on two identical machines

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...

Persistent link: https://www.econbiz.de/10008494765

A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs

Kang, Liying; Ng, C.T. - In: International journal of production economics 109 (2007) 1, pp. 180-184

Persistent link: https://www.econbiz.de/10007748651

Paired-domination of Trees

Qiao, Hong; Kang, Liying; Cardei, Mihaela; Du, Ding-Zhu - In: Journal of global optimization : an international … 25 (2003) 1, pp. 43-54

Persistent link: https://www.econbiz.de/10007162248

Online scheduling of parallel jobs with preemption on two identical machines

Guo, Shouwei; Kang, Liying - In: Operations research letters 41 (2013) 2, pp. 207-209

Persistent link: https://www.econbiz.de/10010083880

Online scheduling of malleable parallel jobs with setup times on two identical machines

Guo, Shouwei; Kang, Liying - In: European journal of operational research : EJOR 206 (2010) 3, pp. 555-562

Persistent link: https://www.econbiz.de/10008407941