Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
IDENTICAL PARALLEL MACHINES SCHEDULING USING GENETIC ALGORITHM
View through CrossRef
Minimizing the scheduling production time consider one of the most important factors forcompanies which their objectives is achieve the maximum profits. This paper studies theidentical parallel machine scheduling problem which involves the assignment numbers ofjob (N) to set of identical parallel machine (M) in order to minimize the makespan(maximum completion time of all job). There are numerous troubles in solving the largesize of “parallel machine scheduling” problem with an excessive jobs and machines, sothe genetic algorithm was proposed in this paper which is consider an efficient algorithmthat fits larger size of identical “parallel machine scheduling” for minimizing themakespan. Most studies in the scheduling field suppose setup time is insignificant orincluded in the processing time, in this paper both the sequence independent setup timesand processing time were considered. The solutions of algorithms are coding in(MATLAB). A numerical example of (11) jobs are schedule on (3) machines todemonstrative the effectiveness of algorithm solution. The result show the algorithm caneffectively solve large size of scheduling problem and given the best schedule withminimum makespan.
University of Babylon - Department of Mechanical Engineering, Faculty of Engineering
Title: IDENTICAL PARALLEL MACHINES SCHEDULING USING GENETIC ALGORITHM
Description:
Minimizing the scheduling production time consider one of the most important factors forcompanies which their objectives is achieve the maximum profits.
This paper studies theidentical parallel machine scheduling problem which involves the assignment numbers ofjob (N) to set of identical parallel machine (M) in order to minimize the makespan(maximum completion time of all job).
There are numerous troubles in solving the largesize of “parallel machine scheduling” problem with an excessive jobs and machines, sothe genetic algorithm was proposed in this paper which is consider an efficient algorithmthat fits larger size of identical “parallel machine scheduling” for minimizing themakespan.
Most studies in the scheduling field suppose setup time is insignificant orincluded in the processing time, in this paper both the sequence independent setup timesand processing time were considered.
The solutions of algorithms are coding in(MATLAB).
A numerical example of (11) jobs are schedule on (3) machines todemonstrative the effectiveness of algorithm solution.
The result show the algorithm caneffectively solve large size of scheduling problem and given the best schedule withminimum makespan.
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...
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...
Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints
Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints
Global warming and climate change are threatening life on earth. These changes are due to human activities resulting in the emission of greenhouse gases. This is caused by intensiv...
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 ...
Workflow Scheduling Based on Mobile Cloud Computing Machine Learning
Workflow Scheduling Based on Mobile Cloud Computing Machine Learning
In recent years, cloud workflow task scheduling has always been an important research topic in the business world. Cloud workflow task scheduling means that the workflow tasks subm...
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...
Performance Analysis of Scheduling Algorithms on Fog Computing using YAFS
Performance Analysis of Scheduling Algorithms on Fog Computing using YAFS
A smart device that has seen more development is the Internet of Things (IoT). An IoT system implementation requires a device that can accept and handle various sorts of data. Fog ...