Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/65937
PIRA download icon_1.1View/Download Full Text
Title: Fast approximation algorithms for uniform machine scheduling with processing set restrictions
Authors: Leung, JYT
Ng, CT 
Issue Date: 16-Jul-2017
Source: European journal of operational research, 16 July 2017, v. 260, no. 2, p. 507-513
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.
Keywords: Inclusive processing set
Makespan
Scheduling
Tree-hierarchical processing set
Uniform machines
Worst-case bound
Publisher: Elsevier
Journal: European journal of operational research 
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2017.01.013
Rights: © 2017 Elsevier B.V. All rights reserved.
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/
The following publication Leung, J. Y., & Ng, C. T. (2017). Fast approximation algorithms for uniform machine scheduling with processing set restrictions. European Journal of Operational Research, 260(2), 507-513 is available at https://doi.org/10.1016/j.ejor.2017.01.013
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Ng_Fast_Approximation_Algorithms.pdfPre-Published version691.21 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

53
Last Week
4
Last month
Citations as of Oct 2, 2022

Downloads

4
Citations as of Oct 2, 2022

SCOPUSTM   
Citations

5
Last Week
0
Last month
Citations as of Oct 6, 2022

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
Citations as of Oct 6, 2022

Google ScholarTM

Check

Altmetric


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