The solution of the concurrent layout scheduling problem in the job-shop environment through a local neighborhood search algorithm.
Eva Selene Hernández-GressJuan Carlos Seck Tuoh MoraNorberto Hernandez-RomeroJoselito Medina MarínPedro Lagos-EulogioJavier Ortíz-PereaPublished in: Expert Syst. Appl. (2020)
Keyphrases
- job shop
- scheduling problem
- search algorithm
- tabu search
- distributed constraint satisfaction problems
- job shop scheduling
- open shop
- flowshop
- job shop scheduling problem
- single machine
- np hard
- processing times
- search procedure
- production scheduling
- parallel machines
- search space
- memetic algorithm
- resource constrained
- optimal solution
- constraint satisfaction problems
- routing protocol