Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959844 | European Journal of Operational Research | 2017 | 29 Pages |
Abstract
We consider the problem of nonpreemptively scheduling a set of independent jobs on a set of uniform machines, where each job has a set of machines to which it can be assigned. This kind of restriction is called the processing set restriction. In the literature there are many kinds of processing set restrictions that have been studied. In this paper we consider two kinds: the “inclusive processing set” and the “tree-hierarchical processing set”. Epstein and Levin (2011) have given Polynomial Time Approximation Schemes (PTAS) to solve both classes. However, the running times of their PTAS are rather high. In this paper, we give fast approximation algorithms for both cases and show that they both have a worst-case performance bound of 4/3. Moreover, we show that the bounds are achievable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Joseph Y-T. Leung, C.T. Ng,