Search Results - (( simulation permutation based algorithm ) OR ( java applications optimization algorithm ))
Search alternatives:
- applications optimization »
- simulation permutation »
- permutation based »
- java applications »
-
1
Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem
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
Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem
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
Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem
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
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
5
Performance evaluation of real-time multiprocessor scheduling algorithms
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 -
6
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
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 -
7
Route Optimization System
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 -
8
-
9
-
10
Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network
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 -
11
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
12
Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
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 -
13
Simulated Annealing Based Strategy for Test Redundancy Reduction
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 -
14
A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
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 -
15
Ant colony optimization algorithm for load balancing in grid computing
Published 2012Get full text
Get full text
Get full text
Monograph -
16
Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network
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 -
17
Cutpoint determination methods in competing risks subdistribution model
Published 2009“…Simulation results show that the deviance method has the desired properties. …”
Get full text
Get full text
Article -
18
-
19
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
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 -
20
