Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A Hybrid Imperialist Competitive Algorithm for the Distributed Unrelated Parallel Machines Scheduling Problem
View through CrossRef
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.
Title: A Hybrid Imperialist Competitive Algorithm for the Distributed Unrelated Parallel Machines Scheduling Problem
Description:
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.
Related Results
An algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device
An algorithm based on quasi critical path strategy for exchanging adjacent parallel processes of the same device
Abstract
Aiming at the defect that quasi critical path algorithm can't take into account both vertical scheduling and horizontal scheduling when scheduling products, this p...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
DPTM: An Adaptive Scheduler Design Utilizing Timeslot Matching and Release Methods for Concurrent and Multi-task Interleaved Pipelining-oriented CGRA
DPTM: An Adaptive Scheduler Design Utilizing Timeslot Matching and Release Methods for Concurrent and Multi-task Interleaved Pipelining-oriented CGRA
Coarse-grained reconfigurable architectures (CGRAs) are increasingly employed as domain-specific accelerators due to their efficiency and flexibility. However, the existing CGRA ar...
Visual versus Tabular Scheduling Programs
Visual versus Tabular Scheduling Programs
Effective scheduling in construction is crucial for ensuring timely project completion and maintaining budget control. Scheduling programs play an important role in this process by...
A Hybrid Honey Badger Algorithm to Solve Energy-Efficient Hybrid Flow Shop Scheduling Problems
A Hybrid Honey Badger Algorithm to Solve Energy-Efficient Hybrid Flow Shop Scheduling Problems
A well-planned schedule is essential to any organization’s growth. Thus, it is important for the literature to cover a more comprehensive range of scheduling problems. In this pape...
Adaptive Scheduling of Mixing Trucks in Construction Sites with an Improved Deep Q-Network
Adaptive Scheduling of Mixing Trucks in Construction Sites with an Improved Deep Q-Network
The management of concrete mixing station distribution is evolving toward more intelligent and efficient methods. Additionally, in the context of the group operations of commodity ...
Task Scheduling for cloud computing Based on Firefly Algorithm
Task Scheduling for cloud computing Based on Firefly Algorithm
Abstract
In this paper a new method proposed, to solve the problem of scheduling resources in cloud computing, it is using a parallel scheduling model which can enha...