Search Results - (( java application optimization algorithm ) OR ( all permutations selection algorithm ))

Refine Results
  1. 1

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

    Published 2015
    “…The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in flow shops. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

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

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

    Scheduling scientific workflow in multi-cloud: a multi-objective minimum weight optimization decision-making approach by Farid, Mazen, Heng, Siong Lim, Chin, Poo Lee, Latip, Rohaya

    Published 2023
    “…Multi-objective algorithms use this method to select a set of permutations that provide the best trade-off between competing objectives. …”
    Get full text
    Get full text
    Article
  6. 6

    A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

    Published 2016
    “…However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

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

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

    Published 2015
    “…All the average percentage makespan difference from three onlooker approaches was compared and the lowest average percentage makespan difference was selected as the best method. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Dynamic determinant matrix-based block cipher algorithm by Juremi, Julia

    Published 2018
    “…Analyses on linear, differential and short attack will be performed against the DDBC algorithm to estimate the possible success of all three attacks. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A new method for starter sets generation by fixing any element by Karim, Sharmila, Ibrahim, Haslinda, Sapiri, Hasimah

    Published 2015
    “…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20