Search Results - (( java implementation phase algorithm ) OR ( basic permutation generation algorithm ))

Search alternatives:

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop

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

    Published 2015
    “…Throughout the last 30 years, the NEH heuristic developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. This heuristic is basically divided into two main stages: generate an initial sequence with decreasing total processing time and insert into the schedule accordingly. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…All the algorithm for the engine has been developed by using Java script language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    A new 128-bit block cipher

    A new 128-bit block cipher by Mohd Ali, Fakariah Hani

    Published 2009
    “…It is an involution substitution and permutation encryption network (SPN). This block cipher uses only basic operations, key dependent S-box and XOR IS together so that it can be efficiently implemented on various platforms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar

    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar by Tengku Jaafar, Tengku Salman Fathi

    Published 2006
    “…Although from human logical thinking, the route can be generated easily but the calculation of checking the route whether it is optimal route or not is difficult and will take long time to be implemented. This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling

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

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem

    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem by Sh Ahmad, Sh Salleh

    Published 2009
    “…Third, bottleneck approach was utilised in the study and the analysis using Visual Basic macro programming indicated that this method produced good results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: