Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/65937
Title: Fast approximation algorithms for uniform machine scheduling with processing set restrictions
Authors: Leung, JYT
Ng, CT
Keywords: Inclusive processing set
Makespan
Scheduling
Tree-hierarchical processing set
Uniform machines
Worst-case bound
Issue Date: 2017
Publisher: Elsevier
Source: European journal of operational research, 2017, v. 260, no. 2, p. 507-513 How to cite?
Journal: European journal of operational research 
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.
URI: http://hdl.handle.net/10397/65937
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2017.01.013
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

17
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.