Search Results - (( problems using time algorithm ) OR ( java application scheduling algorithm ))

Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

“…This paper reports the power fill techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text

Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text

Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text

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

“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
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

“…Many algorithms have been implemented to solve the grid scheduling problem. …”
Get full text
Get full text
Get full text

Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text

A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

“…In this type of environment it is nearly impossible to prove the effectiveness of a scheduling algorithm. Hence the main objective of this study is to develop a desktop grid simulator toolkit for measuring and modeling scheduler algorithm performance. …”
Get full text
Get full text

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text

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

“…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
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

“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. …”
Get full text
Get full text

Classroom finder system with student availability, space and time constraint by Loh, Yong Bin

Get full text
Get full text

Smart student timetable planner by Wong, Xin Tong

“…Course data is managed in CSV format, parsed into JSON for fast processing, while sessionStorage and localStorage handle user data within active sessions. A Genetic Algorithm forms the core scheduling engine, generating optimized timetables that respect both hard constraints, such as avoiding clashes, and soft constraints, such as personal preferences.The final output of this project is a functional web-based timetable planner that successfully enhances scheduling efficiency, reduces the likelihood of errors, and improves the overall academic planning experience. …”
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…In creating this application, NetBeans IDE 6.5and Java Micro Edition (Java ME) are used. …”
Get full text
Get full text

Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

“…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
Get full text
Get full text
Get full text

Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

“…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
Get full text
Get full text

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

“…These new parallel and sequential finite difference time domain (FDTD) algorithms yield from O(h2), ordinary O(h4) and weighted average O(h4) centered difference discretization using direct-domain and temporary-domain are used to solve problems mentioned above. …”
Get full text
Get full text

Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser by Chai, S. W., Kamaluddin, M. R., Ab Rashid, M. F. F.

“…The main objective of the study is to minimise the number of vehicles to be assigned for the routing problem subjected to the given time windows. The problem was optimised using a new algorithm known as Harris Hawks Optimiser (HHO). …”
Get full text
Get full text
Get full text

Solving time gap problems through the optimization of detecting stepping stone algorithm by Omar, Mohd. Nizam, Maarof, Mohd. Aizaini, Zainal, Anazida

“…Since the detecting stepping stone is listed as one of the response technique, it is suggested that the improved algorithm should be used as a remedial to the time gap problem.…”
Get full text
Get full text

Volunteer Management System by Muhammad Fazril Bin Mohd Amin, Muhammad Fazril

“…The project will adopt the Iterative and incremental development methodology, which promotes constant reevaluation, and will be built on the java programming language and developed on the Netbeans IDE, for the GUI and algorithm implementation. …”
Get full text
Get full text