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

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

0.00 Avg rating0 Votes
Article ID: iaor20053075
Country: Netherlands
Volume: 161
Issue: 1
Start Page Number: 3
End Page Number: 10
Publication Date: Feb 2005
Journal: European Journal of Operational Research
Authors: , , , ,
Keywords: maintenance, repair & replacement, heuristics
Abstract:

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 analysis are given afterwards.

Reviews

Required fields are marked *. Your email address will not be published.