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

Descripción completa

Detalles Bibliográficos
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:
Adaptive and Self-Organizing Systems
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

Internet

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