Cargando…
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...
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: | |
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 |
Ejemplares similares
-
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
por: Luo, Qifang, et al.
Publicado: (2014) -
A computational efficient optimization of flow shop scheduling problems
por: Liang, Zhongyuan, et al.
Publicado: (2022) -
Genetic Algorithm for Solving the No-Wait Three-Stage Surgery Scheduling Problem
por: Lin, Yang-Kuei, et al.
Publicado: (2023) -
Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated
por: Branda, Antonella, et al.
Publicado: (2021) -
A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling
por: Liu, Ruochen, et al.
Publicado: (2013)