Cargando…
A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem
This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local...
Autores principales: | Amirghasemi, Mehrdad, Zamani, Reza |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4008728/ https://www.ncbi.nlm.nih.gov/pubmed/24808999 http://dx.doi.org/10.1186/2193-1801-3-193 |
Ejemplares similares
-
Hybrid Quantum Annealing Heuristic Method for Solving Job Shop Scheduling Problem
por: Kurowski, Krzysztof, et al.
Publicado: (2020) -
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem
por: Meng, Leilei, et al.
Publicado: (2023) -
Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems
por: Shi, Xiaoqiu, et al.
Publicado: (2020) -
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
por: Escamilla Serna, Nayeli Jazmin, et al.
Publicado: (2021) -
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem †
por: Viana, Monique Simplicio, et al.
Publicado: (2022)