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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 161; číslo 1; s. 3 - 10
Hlavní autoři: Sadfi, Cherif, Penz, Bernard, Rapine, Christophe, Błażewicz, Jacek, Formanowicz, Piotr
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.02.2005
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2003.08.026