Search Results - (( java implementation path algorithm ) OR ( using simulation scheduling algorithm ))

Search alternatives:

Refine Results
  1. 1
    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

    Published 2016
    “…Round Robin scheduling algorithm is the most widely used scheduling algorithm because of its simplicity and fairness [1]. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

    Published 2015
    “…Round Robin scheduling algorithm is the most widely used scheduling algorithm because of its simplicity and fairness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    An FPGA implementation of exp-bet scheduling algorithm in LTE networks / Yusmardiah Yusuf

    An FPGA implementation of exp-bet scheduling algorithm in LTE networks / Yusmardiah Yusuf by Yusuf, Yusmardiah

    Published 2017
    “…Since the implementation of scheduling algorithm is an open issue in LTE, many packet scheduling algorithms have been proposed by researchers. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems

    Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems by Tan, Joe Yee

    Published 2022
    “…Simulation experiments were run using different parameters to analyze the performance of the proposed algorithm with the system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Predictive-reactive job shop scheduling for flexible production systems with the combination of optimization and simulation based algorithm

    Predictive-reactive job shop scheduling for flexible production systems with the combination of optimization and simulation based algorithm by Abdul Rahman, Azrul Azwan, Joe Yee, Tan, A Rahman, Muhamad Arfauz, Salleh, Mohd Rizal, Bilge, Pinar

    Published 2020
    “…The predictive part determines the feasible schedule to be used for a flow shop which is generated using a combination of rule-based simulation and optimization: first, using the optimization algorithm to compute a rough plan, followed by using a rule based simulation system to locally fine tune the plan to obtain the final schedule. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…Furthermore, CloudSim simulator will be used to evaluate the performance of this algorithm. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  8. 8
    A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment

    A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment by Ahmad, Idawaty, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zukarnain, Zuriati

    Published 2011
    “…Approach: The study focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Using simulated annealing algorithm for optimization of quay cranes and automated guided vehicles scheduling

    Using simulated annealing algorithm for optimization of quay cranes and automated guided vehicles scheduling by Homayouni, Seyed Mahdi, Tang, Sai Hong, Ismail, Napsiah, Mohd Ariffin, Mohd Khairol Anuar

    Published 2011
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks

    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

    Published 2012
    “…In order to evaluate the proposed algorithms and validate their efficiency for IEEE 802.16j networks, the authors simulated the algorithms in QualNet simulator. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Incorporating the range-based method into GridSim for modeling task and resource heterogeneity

    Incorporating the range-based method into GridSim for modeling task and resource heterogeneity by Eng, Kailun, Muhammed, Abdullah, Mohamed, Mohamad Afendee, Hasan, Sazlinah

    Published 2017
    “…GridSim simulator has become a very popular simulation tool and has been widely used by Grid researchers to test and evaluate the performance of their proposed scheduling algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Simulated annealing algorithm for scheduling divisible load in large scale data grids.

    Simulated annealing algorithm for scheduling divisible load in large scale data grids. by Abdullah, Monir, Othman, Mohamad, Ibrahim, Hamidah, Subramaniam, Shamala

    Published 2009
    “…This paper proposes a novel Simulated Annealing (SA) algorithm for scheduling divisible load in large scale data grids. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    The comparison of tardiness in scheduling techniques for task distribution using grid simulation tool

    The comparison of tardiness in scheduling techniques for task distribution using grid simulation tool by Stapa @ Mustapa, Muhamad Azhar

    Published 2008
    “…The goal of this project is to test on tardiness parameter in local search based algorithms. A good scheduling algorithm normally shows lower value of total tardiness and schedule time. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    A branch and bound and simulated annealing approach for job shop scheduling

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

    Published 2004
    “…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
    Article
    Save to List
    Saved in:
  17. 17
    Simulated annealing algorithm for scheduling divisible load in large scale data grids

    Simulated annealing algorithm for scheduling divisible load in large scale data grids by Abdullah, Monir, Othman, Mohamed, Ibrahim, Hamidah, K. Subramaniam, Shamala

    Published 2008
    “…This paper proposes a novel simulated annealing (SA) algorithm for scheduling divisible load in large scale data grids. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Enhanced utility accrual scheduling algorithms for adaptive real time system.

    Enhanced utility accrual scheduling algorithms for adaptive real time system. by Othman, Muhammad Fauzan, Ahmad, Idawaty

    Published 2009
    “…We compared the performances of these algorithms by using discrete event simulation. Results: The proposed PUAS algorithm achieved the highest accrued utility for the entire load range. …”
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Scalable workflow scheduling algorithm for minimizing makespan and failure probability

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Benchmark simulator with dynamic environment for job scheduling in grid computing

    Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

    Published 2014
    “…Job scheduling algorithm has a significant influence on grid computing performance. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: