Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations

We consider a single machine scheduling problem with multiple maintenance activities, where the maintenance duration function is of the linear form f t = a + b t with a ≥ 0 and b > 1 . We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. We also show that...

Full description

Saved in:
Bibliographic Details
Published in:TheScientificWorld 2014-01, Vol.2014 (2014), p.1-8
Main Authors: Shi, Xuefei, Xu, Dehua
Format: Article
Language:English
Subjects:
Algorithms
Approximation theory
Equipment and Supplies
Heuristic
Methods
Plant maintenance
Production scheduling
Scheduling (Management)
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a single machine scheduling problem with multiple maintenance activities, where the maintenance duration function is of the linear form f t = a + b t with a ≥ 0 and b > 1 . We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. We also show that there is no polynomial time approximation algorithm with a worst-case bound less than 2 for the problem with b ≥ 0 unless P = N P , which implies that the FFD-LS2I algorithm is the best possible algorithm for the case b > 1 and that the FFD-LS algorithm, which is proposed in the literature, is the best possible algorithm for the case b ≤ 1 both from the worst-case bound point of view.
ISSN:2356-6140
1537-744X
1537-744X
DOI:10.1155/2014/547573