A Novel Imperialist Competitive Algorithm With Multi-Elite Individuals Guidance for Multi-Object Unrelated Parallel Machine Scheduling Problem

A Novel Imperialist Competitive Algorithm With Multi-Elite Individuals Guidance for Multi-Object Unrelated Parallel Machine Scheduling Problem

In this study unrelated parallel machine scheduling problem (UPMSP) with preventive maintenance (PM) and sequence dependent setup times (SDST) is investigated. A novel imperialist competitive algorithm (NICA) with multi-elite individuals guidance is proposed to minimize makespan and total tardiness...

Full description

Bibliographic Details
Main Authors: Mei Wang, Guohua Pan
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Preventive maintenance
setup times
imperialist competitive algorithm
multi-elite individual guidance
estimation of distribution algorithm
Online Access:https://ieeexplore.ieee.org/document/8815759/

Internet

https://ieeexplore.ieee.org/document/8815759/

Similar Items