Search Results - (( developing permutation selection algorithm ) OR ( java application stemming algorithm ))

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
  2. 2

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

    Published 2015
    “…Throughout the past 30 years, the NEH heuristics developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. …”
    Get full text
    Get full text
    Thesis
  3. 3

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

    Published 2016
    “…A new method is developed for starter sets generation namely STARSET2 based on exchange where any element can be selected randomly to be fixed.The result showed that no redundancy of starter sets is occurring and no equivalence starter sets are obtained.…”
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2015
    “…The main objective of this research is to develop a computer program with capability of manipulating the onlooker bee approaches in ABC Algorithm for solving flowshop scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2015
    “…A new method is developed for starter sets generation namely STARSET1 based on circular where any element can be selected randomly to be fixed. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6