Karhi, Shlomo; Shabtay, Dvir - In: International Journal of Production Economics 150 (2014) C, pp. 155-162
We study an online-list scheduling problem on a set of m multipurpose machines for which the objective is to minimize the makespan. It is assumed that there are two different job types, and each job type can be processed on a unique subset of machines. We provide an online algorithm with a...