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

Descripción completa

Detalles Bibliográficos
Autores principales: Shi, Xuefei, Xu, Dehua
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3950368/
https://www.ncbi.nlm.nih.gov/pubmed/24701177
http://dx.doi.org/10.1155/2014/547573

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3950368/
https://www.ncbi.nlm.nih.gov/pubmed/24701177
http://dx.doi.org/10.1155/2014/547573

Ejemplares similares