Search Results - (( _ constructability scheduling algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1

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

    Published 2011
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2012
    “…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
    Monograph
  3. 3

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

    Published 2011
    “…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
    Monograph
  4. 4
  5. 5

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

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms / Salihin Farag Shoeeb by Salihin Farag , Shoeeb

    Published 2003
    “…A recent approach to derive a near-optimal solution is to use evolutionary or genetic algorithms. In this project, we describe in detail the school timetable problem and present the genetic algorithm employed to construct the timetable for a typical Malaysian schools.…”
    Get full text
    Get full text
    Thesis
  7. 7

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Constructing routing tree for centralized scheduling using multi-channel single transceiver system in 802.16 mesh mode by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2008
    “…This paper proposes a centralized scheduling algorithm that can reduce interferences by constructing routing tree with multi-channel single transceiver system in WiMAX mesh networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…The minimum color represents the minimum time slots required to construct the new schedule. The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Student Project
  11. 11

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…The minimum color represents the minimum time slots required to construct the new schedule. The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Research Reports
  12. 12

    Constructing routing tree centralized scheduling using multi-channel system in 802.16 by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2008
    “…The result of analysis shows this algorithm greatly improves the length of scheduling, channel utilization ratio (CUR) and average transmission scheduling.…”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13
  14. 14
  15. 15

    Scheduling Algorithm For Lot Movement in Semiconductor Wafer Fabrication by Norzieyuswati, Md Zenal

    Published 2008
    “…Imitating the collective activities of ant colonies, an approach to constructing pheromone-based scheduling algorithm using Ant Colony Optimization for lot movement in semiconductor wafer fabrication process is propose to be implemented in SilTerra Malaysia.…”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Maximax & Maximin and 2FBlockwise Operators: Enhancement in the Evolutionary Algorithm for a Nurse Scheduling Problem by Ramli, Razamin, Huai Tein, Lim

    Published 2017
    “…Hence, the aim of this paper is to construct the best nurse work schedule based on the rules and requirements of the nurse scheduling problem (NSP). …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Staff scheduling for a courier distribution centre using evolutionary algorithm by Mohd Yusoh, Zeratul Izzah, Pua, Si Ying

    Published 2022
    “…This paper proposed evolutionary algorithm, namely genetic algorithm as the solution to courier center staff scheduling. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…Bitwise operations make this algorithm run very fast. The algorithm constructed by the researcher is a modification of Komosko, etc.’s algorithm in 2015 and it is the key result of this research. …”
    Get full text
    Get full text
    Get full text
    Article