A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem

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

Full description

Bibliographic Details
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:
Job shop scheduling
Cellular automata
Local search
Simplified neighborhood
Tabu search
Online Access:https://peerj.com/articles/cs-574.pdf

Internet

https://peerj.com/articles/cs-574.pdf

Similar Items