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+bt 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...
| Publicado en: | Scientific World Journal pp. 547573 - 547574 |
|---|---|
| Autores principales: | , |
| Formato: | research Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |