Search Results - (( initial solution scheduling algorithm ) OR ( java application based algorithm ))

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Experimental results show that EACO produced better grid resource management solution compared to other algorithms. …”
Get full text
Get full text
Get full text

Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text

Flexible job shop scheduling using priority heuristics and genetic algorithm by Farashahi, Hamid Ghaani

“…In the next method, a genetic algorithm has been developed. It has been shown that proposed genetic algorithm with a reinforced initial population (GA2) has better efficiency compared to a proposed genetic algorithm with fully random initial population (GA0). …”
Get full text
Get full text

A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

“…In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
Get full text
Get full text

Hybrid dynamic scheduling model for flexible manufacturing system with machine availability and new job arrivals by Paslar, Shahla

“…The performance of the schedules as produced by the scheduling/rescheduling algorithms were investigated and compared. …”
Get full text
Get full text

A hybrid genetic algorithm for optimization of scheduling workflow applications in heterogeneous computing systems by Ahmad, S.G., Liew, Chee Sun, Munir, E.U., Ang, Tan Fong, Khan, S.U.

“…These features are incorporated in the proposed Hybrid Genetic Algorithm (HGA). A solution obtained from a heuristic is seeded in the initial population that provides a direction to reach an optimal (makespan)solution. …”
Get full text
Get full text

Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

“…The chromosomes are decoded into active schedules thus increasing the probability of obtaining near or optimal solution significantly. …”
Get full text
Get full text
Get full text

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
Get full text
Get full text
Get full text

A Modified LRE-TL Real-Time Multiprocessor Scheduling Algorithm by Alhussian, Hitham, Zakaria, Mohd Nordin, Hussin, Fawnizu Azmadi, Bahbouh, Hussein T

“…A modified version of Local Remaining Execution-TL (LRE-TL) real-time multiprocessor scheduling algorithm is presented. LRE-TL uses two events to make scheduling decisions: The Bottom (B) event and the Critical (C) event. …”
Get full text
Get full text

Max-average: an extended max-min scheduling algorithm for Grid computing environtment by Maipan-uku, J. Y., Muhammed, Abdullah, Abdullah, Azizol, Hussin, Masnida

“…This paper presents a new proposed grid based scheduling algorithm called Max-Average, inspired from Max-Min algorithm. …”
Get full text
Get full text
Get full text

A modified LRE-TL real-time multiprocessor scheduling algorithm by Alhussian, H., Zakaria, N., Hussin, F.A., Bahbouh, H.T.

“…A modified version of Local Remaining Execution-TL (LRE-TL) real-time multiprocessor scheduling algorithm is presented. LRE-TL uses two events to make scheduling decisions: The Bottom (B) event and the Critical (C) event. …”
Get full text
Get full text

Vehicle pick-up and drop-off schedule optimization in a university setting by Teo, Chun Kit

“…A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. The initial solution is generated by distributing requests across vehicles, and local searches are performed through request swapping and movement. …”
Get full text
Get full text

Reducing Tasks Migration in LRE-TL Real-time Multiprocessor Scheduling Algorithm by Alhussian, Hitham, Nordin, Zakaria M, Hussin, Fawnizu Azmadi, Bahbouh, Hussein T.

“…In this paper we present a modification of Local Remaining Execution (LRE-TL) real-time multiprocessor scheduling algorithm to reduce tasks migration significantly. …”
Get full text
Get full text

Hybrid genetic algorithm for uncapacitated university examination timetabling problem by Ishak, Suhada

“…This study presents a solution for an uncapacitated UETP where five domain-specific knowledges in the form of low-level heuristics are used to guide the construction of the timetable in the initial population. …”
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…However, the current meta-heuristic algorithms do not ensure an optimum solution within a reasonable time. …”
Get full text
Get full text

Parallel multiple tabu search for multiobjective Urban Transit Scheduling Problem by Uvaraja, Vikneswary, Lai, Soon Lee, Abd Rahmin, Nor Aliza, Hsin, Vonn Seow

“…A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. …”
Get full text
Get full text

Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

“…However, these traditional approaches bias toward the initial timetable where the improvement algorithms (sometimes) are affected and unable to produce a quality timetable. …”
Get full text
Get full text

Web based personalized university timetable for UiTM students using genetic algorithm / Mohd Radhi Fauzan Jamli and Ahmad Firdaus Ahmad Fadzil by Jamli, Mohd Radhi Fauzan, Ahmad Fadzil, Ahmad Firdaus

“…The research endeavors to develop a web-based system specifically designed to create personalized university timetables for Universiti Teknologi MARA (UiTM) students using genetic algorithms, aiming to address the urgent need for a customizable timetable solution catering to the diverse scheduling requirements of both repeater and non-repeater students while optimizing course group selection to minimize conflicts and enhance scheduling flexibility. …”
Get full text
Get full text
Get full text