CAI, SHENG-YI - In: Asia-Pacific Journal of Operational Research (APJOR) 24 (2007) 03, pp. 373-382
This paper investigates two different semi-online versions of the machine covering, which is the problem of assigning a set of jobs to a system of m(m ≥ 3) identical parallel machines so as to maximize the earliest machine completion time. In the first case, we assume that the largest...