Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

Abstract The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and...

Full description

Bibliographic Details
Main Authors: Houssem Eddine Nouri, Olfa Belkahla Driss, Khaled Ghédira
Format: Article
Language:English
Published: Islamic Azad University 2017-05-01
Series:Journal of Industrial Engineering International
Subjects:
Scheduling
Flexible job shop
Genetic algorithm
Local search
Holonic multiagent
Hybrid metaheuristics
Online Access:http://link.springer.com/article/10.1007/s40092-017-0204-z

Internet

http://link.springer.com/article/10.1007/s40092-017-0204-z

Similar Items