Ou, Jinwen; Zhong, Xueling; Wang, Guoqing - In: European Journal of Operational Research 241 (2015) 3, pp. 653-661
In this paper we study a classical parallel machine scheduling model with m machines and n jobs, where each job is either accepted and then processed by one of the machines, or rejected and then a rejection penalty is paid. The objective is to minimize the completion time of the last accepted...
