Scheduling Problem for Parallel Machines with Limited Processing Capacities

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Helen Zhang and David Jin

Pages:

110-113

DOI:

10.4028/www.scientific.net/AMR.382.110

Citation:

J. Fan "Scheduling Problem for Parallel Machines with Limited Processing Capacities", Advanced Materials Research, Vol. 382, pp. 110-113, 2012

Online since:

November 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.