Search Results - (( job application need algorithm ) OR ( web application ssmeyes algorithm ))

Refine Results
  1. 1
  2. 2

    Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

    Published 2006
    “…Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. …”
    Get full text
    Get full text
    Article
  3. 3

    Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

    Published 2015
    “…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  5. 5

    Job recruiting system using sorting Algorithm / Adi Asyraf Ayob by Ayob, Adi Asyraf

    Published 2020
    “…The sorting algorithm will assist the recruiters in selecting best job candidate by assigning score to each applicants and sort the applicant list by the finest score value. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Impatient job scheduling under cloud computing by Mahdi, Nawfal A.

    Published 2012
    “…The limitations of those algorithms were addressed and this leads to the proposition of an algorithm that has the ability to map the impatient jobs to virtual machines near its input, output, application, or forth party. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9
  10. 10

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…In the case of large setup time, jobs tend to form a large batch size with more jobs in a batch to reduce the need of setup time between batches from different families. …”
    Get full text
    Conference or Workshop Item
  11. 11

    Quantum time task scheduling technique in novel hybrid shortest job first and round robin by Derahman, Mohd Noor, Roslan, Ahmad Shakir, Huyop @ Ayop, Fahrul Hakim

    Published 2018
    “…Therefore, this study attempts to produce a better performance of hybrid algorithm through the integration of two traditional algorithms namely SJF and RR with dynamic quantum (SRDQ). …”
    Get full text
    Get full text
    Article
  12. 12

    Job-Applicant matchmaking system using natural language processing by Wooi, Zhuang Ru

    Published 2023
    “…This Job-Applicant Matchmaking System using Natural Language Processing project is for academic purpose. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13

    Locust- inspired meta-heuristic algorithm for optimising cloud computing performance by Fadhil, Mohammed Alaa

    Published 2023
    “…The job scheduling of the scientific workflow can efficiently outperform state-of-the-art competitor algorithms.…”
    Get full text
    Get full text
    Thesis
  14. 14

    Green data center by incentive-based job scheduling approach by Jung, L.T., Haruna, A.A.

    Published 2019
    “…A constant artificial cooling (air conditioning) is needed to sustain the DC operation. To solve this issue in the tropical region, incentive-based scheduling algorithms were devised to significantly reduce the electricity consumption cost in DC and also to be able to compensate users (as an incentive) for their submitted jobs that missed the job completion deadline(s). …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

    Dynamic load balancing algorithm based on deadline constrained in cloud environment by Mansur, Muzzammil

    Published 2019
    “…The results show that makespan time was reduce and improves the ratio of task that will meeting to their respective deadline when compared with the First Come First Serve (FCFS), Dynamic Min-Min, and Shortest Job First (SJF) algorithm.…”
    Get full text
    Get full text
    Thesis
  20. 20