Search Results - (( simulation permutation based algorithm ) OR ( java application testing algorithm ))

Search alternatives:

Refine Results
  1. 1
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by N. A., Isa, S. A., Bareduan, A. S., Zainudin, M., Marsudi

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  6. 6
    Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4

    Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4 by Mohd Fidzwan, Md Amin Hamzas, Ahmad Bareduan, Salleh, Liyana, Tajul, Mohd Sabri, Hussin, Zailani, Zainal Abidin, Hasnul, Hadi

    Published 2013
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…To avoid crosstalk in OMINs many algorithms have been proposed by many researchers such as the Four Heuristic, Simulated Annealing, Genetic, Remove Last Passes and Zero Algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches

    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches by Mohd Pauzi, Nur Fazlinda

    Published 2015
    “…At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Simulated Annealing Based Strategy for Test Redundancy Reduction

    Simulated Annealing Based Strategy for Test Redundancy Reduction by Kamal Z., Zamli, Mohd Hafiz, Mohd Hassin, Al-Kazemi, Basem, Naseer, Atif

    Published 2014
    “…Unlike existing works which rely on the Greedy approaches, our work adopts the random sequence permutation and optimization algorithm based on Simulated Annealing with systematic merging technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Positive outcomes on the application of simulated annealing-based hyper-heuristic (SA-HH) in addressing similar scheduling problem has been reported in the literature. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…Performance Testing is used to test the performance of algorithm implementations in applications. …”
    Get full text
    Get full text
    Journal
    Save to List
    Saved in:
  12. 12
    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Cutpoint determination methods in competing risks subdistribution model

    Cutpoint determination methods in competing risks subdistribution model by Noor Akma Ibrahim, Abdul Kudus, Isa Daud, Mohd. Rizam Abu Bakar

    Published 2009
    “…Simulation results show that the deviance method has the desired properties. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Development of an Image Encryption Algorithm using Latin Square Matrix and Logistics Map

    Development of an Image Encryption Algorithm using Latin Square Matrix and Logistics Map by Emmanuel Oluwatobi Asani, Godsfavour Biety-Nwanju, Abidemi Emmanuel Adeniyi, Salil Bharany, Ashraf Osman Ibrahim Elsayed, Anas W. Abulfaraj, Wamda Nagmeldin

    Published 2023
    “…The hybrid technique was simulated on image data and evaluated to gauge its performance. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Cutpoint determination methods in competing risks subdistribution model

    Cutpoint determination methods in competing risks subdistribution model by Ibrahim, Noor Akma, Kudus, Abdul, Daud, Isa, Abu Bakar, Mohd Rizam

    Published 2009
    “…Simulation results show that the deviance method has the desired properties. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Java based expert system for selection of natural fibre composite materials

    Java based expert system for selection of natural fibre composite materials by Ahmed Ali, Basheer A., Salit, Mohd Sapuan, Zainudin, Edi Syams, Othman, Mohamed

    Published 2013
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Implementation of (AES) Advanced Encryption Standard algorithm in communication application

    Implementation of (AES) Advanced Encryption Standard algorithm in communication application by Moh, Heng Huong

    Published 2014
    “…The concept of ABS algorithm was firstly studied, including the definition, historical background, and a brief comparison was made between the ABS algorithm with other types of algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  18. 18
    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop

    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop by Md Amin Hamzas, Mohd Fidzwan, Ahmad Bareduan, Salleh, Hussin, M.S., Hasnul, M.J.

    Published 2012
    “…Due to the re-entrant and permutation nature of the process routing, the actual bottlenecks were identified as M3 and it utilized makespan algorithms to identify bottleneck categories. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Classification System for Heart Disease Using Bayesian Classifier

    Classification System for Heart Disease Using Bayesian Classifier by Magendram, Anusha

    Published 2007
    “…This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. In this system a Bayesian algorithm was used in order to implement the system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop

    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop by Mohd Fidzwan, Md Amin Hamzas, Ahmad Bareduan, Salleh, Mohd Sabri, Hussin, M. J., Hasnul, Asmawi, Sanuddin, Zailani, Zainal Abidin

    Published 2013
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: