## Abstract

The input to the MINIMUM LATENCY SET COVER PROBLEM consists of a set of jobs and a set of tools. Each job j needs a specific subset S_{j} of the tools in order to be processed. It is possible to install a single tool in every time unit. Once the entire subset S_{j} has been installed, job j can be processed instantly. The problem is to determine an order of job installations which minimizes the weighted sum of job completion times. We show that this problem is NP-hard in the strong sense and provide an e-approximation algorithm. Our approximation algorithm uses a framework of approximation algorithms which were developed for the minimum latency problem.

Original language | English |
---|---|

Pages (from-to) | 726-733 |

Number of pages | 8 |

Journal | Lecture Notes in Computer Science |

Volume | 3669 |

DOIs | |

State | Published - 2005 |

Event | 13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain Duration: 3 Oct 2005 → 6 Oct 2005 |

## Keywords

- Approximation algorithm
- Minimum latency
- Minimum sum set cover