Three Hybrid Scatter Search Algorithms for Multi-Objective Job Shop Scheduling Problem

Three Hybrid Scatter Search Algorithms for Multi-Objective Job Shop Scheduling Problem

The Job Shop Scheduling Problem (JSSP) consists of finding the best scheduling for a set of jobs that should be processed in a specific order using a set of machines. This problem belongs to the NP-hard class problems and has enormous industrial applicability. In the manufacturing area, decision-mak...

Full description

Bibliographic Details
Main Authors: Leo Hernández-Ramírez, Juan Frausto-Solís, Guadalupe Castilla-Valdez, Javier González-Barbosa, Juan-Paulo Sánchez Hernández
Format: Article
Language:English
Published: MDPI AG 2022-01-01
Series:Axioms
Subjects:
JJSP
Scatter Search
CMOSA
CMOTA
hybrid algorithms
Online Access:https://www.mdpi.com/2075-1680/11/2/61

Similar Items

Similar Items