A Hybrid Imperialist Competitive Algorithm for the Distributed Unrelated Parallel Machines Scheduling Problem
Open Access
- 21 January 2022
- Vol. 14 (2), 204
- https://doi.org/10.3390/sym14020204
Abstract
In this paper, the distributed unrelated parallel machines scheduling problem (DUPMSP) is studied and a hybrid imperialist competitive algorithm (HICA) is proposed to minimize total tardiness. All empires were categorized into three types: the strongest empire, the weakest empire, and other empires; the diversified assimilation was implemented by using different search operator in the different types of empires, and a novel imperialist competition was implemented among all empires except the strongest one. The knowledge-based local search was embedded. Extensive experiments were conducted to compare the HICA with other algorithms from the literature. The computational results demonstrated that new strategies were effective and the HICA is a promising approach to solving the DUPMSP.Keywords
Funding Information
- National Natural Science Foundation of China (61803149)
This publication has 49 references indexed in Scilit:
- A survey on the Imperialist Competitive Algorithm metaheuristic: Implementation in engineering domain and directions for future researchApplied Soft Computing, 2014
- Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limitsInternational Journal of Production Research, 2014
- Decomposition based hybrid VNS–TS algorithm for distributed parallel factories scheduling with virtual corporationComputers & Operations Research, 2013
- An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problemInternational Journal of Production Research, 2013
- The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machineInformation Sciences, 2013
- A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penaltiesThe International Journal of Advanced Manufacturing Technology, 2012
- A multiscale decomposition method for the optimal planning and scheduling of multi-site continuous multiproduct plantsChemical Engineering Science, 2011
- A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problemInternational Journal of Production Research, 2011
- Order Assignment and Scheduling in a Supply ChainOperations Research, 2006
- A Hybrid Method for the Planning and SchedulingConstraints, 2005