Search Results - (( problem permutation generation algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…Listing of all n! distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2014
    “…Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set.However, a problem arises when the equivalence starter sets generate similar permutations and, therefore, will need to be discarded. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2014
    “…Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set. However, a problem arises when the equivalence starter sets generate similar permutations and, therefore, willneed to be discarded. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop by Ziao, C.Z., Kamaruddin, S.

    Published 2015
    “…Permutation flow shop problem (PFSP) is one of the important subclass of scheduling, where the order in each process remains unchanged for all machines. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    A DNA-dynamic permutation-diffusion algorithm for image encryption using scaling chaotification models and advanced DNA operations by Alkawsi, Gamal, Khairullah, Mustafa Kamil, Baharuddin, Mohd Zafri, Thabit, Reema, Alomari, Mohammad Ahmed, A. Saif, Faten

    Published 2025
    “…To overcome these challenges, this paper proposes the DNA-Dynamic Concurrent Permutation-Diffusion Algorithm (DNA-DCP-DA), which introduces four advanced encryption mechanisms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems by Chong, Zheng Ziao

    Published 2015
    “…Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…The algorithm was tested on 15 test problems where between 10 to 150 holes were randomly generated. …”
    Get full text
    Get full text
    Thesis
  8. 8

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…Some theoretical works and mathematical properties for generating permutation and determining determinants were also constructed to support the research. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

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

    Optimization of job scheduling in a machine shop using genetic algorithm by Adhikari, A., Biswas, C.K., Adhikari, N.

    Published 2002
    “…It is suggested that the minimum values of these parameters be used for scheduling problems.…”
    Get full text
    Get full text
    Article
  12. 12

    Optimization of job scheduling in a machine shop using genetic algorithm by Adhikari, A., Biswas, C.K., Adhikari, N.

    Published 2002
    “…It is suggested that the minimum values of these parameters be used for scheduling problems.…”
    Get full text
    Get full text
    Article
  13. 13

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

    Solving assembly sequence planning using angle modulated simulated kalman filter by Ainizar, Mustapa, Zulkifli, Md. Yusof, Asrul, Adam, Badaruddin, Muhammad, Zuwairie, Ibrahim

    Published 2018
    “…This paper presents an implementation of Simulated Kalman Filter (SKF) algorithm for optimizing an Assembly Sequence Planning (ASP) problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…For these types of problems, the proposed algorithm is demonstrated to be capable of producing higher percentages of solutions in the overall non-dominated set with better quality in terms of convergence and diversity than those obtained by the competing algorithms.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis