Cargando…
Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization
Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is intro...
Autores principales: | Huang, Song, Tian, Na, Wang, Yan, Ji, Zhicheng |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5005237/ https://www.ncbi.nlm.nih.gov/pubmed/27652008 http://dx.doi.org/10.1186/s40064-016-3054-z |
Ejemplares similares
-
An Improved African Vulture Optimization Algorithm for Dual-Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problems
por: He, Zhou, et al.
Publicado: (2022) -
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem
por: Meng, Leilei, et al.
Publicado: (2023) -
Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times
por: Yang, Xin, et al.
Publicado: (2016) -
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
por: Luo, Qifang, et al.
Publicado: (2014) -
Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems
por: Shi, Xiaoqiu, et al.
Publicado: (2020)