Cargando…
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
The Flexible Job Shop Scheduling Problem (FJSP) is a combinatorial problem that continues to be studied extensively due to its practical implications in manufacturing systems and emerging new variants, in order to model and optimize more complex situations that reflect the current needs of the indus...
Autores principales: | Escamilla Serna, Nayeli Jazmin, Seck-Tuoh-Mora, Juan Carlos, Medina-Marin, Joselito, Hernandez-Romero, Norberto, Barragan-Vite, Irving, Corona Armenta, Jose Ramon |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8176541/ https://www.ncbi.nlm.nih.gov/pubmed/34141895 http://dx.doi.org/10.7717/peerj-cs.574 |
Ejemplares similares
-
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem
por: Peng, Chong, et al.
Publicado: (2019) -
Iterative improvement in the automatic modular design of robot swarms
por: Kuckling, Jonas, et al.
Publicado: (2020) -
Non-destructive detection of highway hidden layer defects using a ground-penetrating radar and adaptive particle swarm support vector machine
por: Liu, Xinyu, et al.
Publicado: (2021) -
An adaptive weighting mechanism for Reynolds rules-based flocking control scheme
por: Hoang, Duc N. M., et al.
Publicado: (2021) -
Artificial intelligence and multi agent based distributed ledger system for better privacy and security of electronic healthcare records
por: Alruwaili, Fahad F.
Publicado: (2020)