Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhanc...

Descripción completa

Detalles Bibliográficos
Autores principales: Ren, Tao, Zhang, Chuan, Lin, Lin, Guo, Meiting, Xie, Xionghang
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/PMC3934092/
https://www.ncbi.nlm.nih.gov/pubmed/24764774
http://dx.doi.org/10.1155/2014/979238

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3934092/
https://www.ncbi.nlm.nih.gov/pubmed/24764774
http://dx.doi.org/10.1155/2014/979238

Ejemplares similares