Scheduling Problem for Parallel Machines with Limited Processing Capacities
In the actual industrial engineering, machines used for processing need to be checked periodically to ensure that they can work efficiently. Thus, the novel scheduling problem for parallel machines with limited capacities is worth to study. The objective function is to maximize the last completion time of jobs. We show the problem is NP-hard at least. Furthermore, two approximation algorithms are presented, and algorithms' performances are considered through the experiments with large amounts of data.
Helen Zhang and David Jin
J. Fan "Scheduling Problem for Parallel Machines with Limited Processing Capacities", Advanced Materials Research, Vol. 382, pp. 110-113, 2012