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...
Main Authors: | Nayeli Jazmin Escamilla Serna, Juan Carlos Seck-Tuoh-Mora, Joselito Medina-Marin, Norberto Hernandez-Romero, Irving Barragan-Vite, Jose Ramon Corona Armenta |
---|---|
Format: | Article |
Language: | English |
Published: |
PeerJ Inc.
2021-05-01
|
Series: | PeerJ Computer Science |
Subjects: | |
Online Access: | https://peerj.com/articles/cs-574.pdf |
Similar Items
-
Application of Tabu Search Algorithm in Job Shop Scheduling
by: Betrianis Betrianis, et al.
Published: (2010-10-01) -
A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem
by: Xiangjing Lai, et al.
Published: (2019-01-01) -
Finding solution by Tabu search
by: Ratanamanee, W., et al.
Published: (2003-11-01) -
Management of resources in multiunit construction projects with the use of a tabu search algorithm
by: Michał Podolski
Published: (2017-02-01) -
Comparative analysis of granular neighborhoods in a Tabu Search for the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP)
by: John Wilmer Escobar, et al.
Published: (2017-09-01)