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

Refine Results
  1. 1

    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
  2. 2

    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
  3. 3

    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
  4. 4
  5. 5

    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
  6. 6
  7. 7

    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
  8. 8

    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
  9. 9

    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
  10. 10

    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
  11. 11

    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
  12. 12
  13. 13

    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
  14. 14

    An Educational Tool Aimed at Learning Metaheuristics by Kader, Md. Abdul, Jamaluddin, Jamal A., Kamal Z., Zamli

    Published 2020
    “…In this paper, we introduce an education tool for learning metaheuristic algorithms that allows displaying the convergence speed of the corresponding metaheuristic upon setting/changing the dependable parameters. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    A Feature Ranking Algorithm in Pragmatic Quality Factor Model for Software Quality Assessment by Ruzita, Ahmad

    Published 2013
    “…The methodology used consists of theoretical study, design of formal framework on intelligent software quality, identification of Feature Ranking Technique (FRT), construction and evaluation of FRA algorithm. The assessment of quality attributes has been improved using FRA algorithm enriched with a formula to calculate the priority of attributes and followed by learning adaptation through Java Library for Multi Label Learning (MULAN) application. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    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
  20. 20