An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. We propose an approximation algorithm to solve the problem with a worst case error bound of 3/17. Furthermore, an example is provided to show that the bound is tight. Computational expe...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 161; no. 1; pp. 3 - 10
Main Authors: Sadfi, Cherif, Penz, Bernard, Rapine, Christophe, Błażewicz, Jacek, Formanowicz, Piotr
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 16.02.2005
Elsevier
Elsevier Sequoia S.A
Series:European Journal of Operational Research
Subjects:
Algorithms
Approximation
Approximation algorithm
Availability constraints
Operations research
Production scheduling
Single machine scheduling
Studies
Total completion time
Worst case analysis
Availability constraints
Approximation algorithm
Total completion time
Single machine scheduling
Worst case analysis
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. We propose an approximation algorithm to solve the problem with a worst case error bound of 3/17. Furthermore, an example is provided to show that the bound is tight. Computational experiments and an analysis are given afterwards.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2003.08.026