Search alternatives:
method algorithm » mould algorithm (Expand Search)
data scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
using algorithm » cosine algorithm (Expand Search)
Showing 1 - 20 results of 316 for search '(((( data scheduling algorithm ) OR ( solved using algorithm ))) OR ( elements method algorithm ))*', query time: 0.14s Refine Results
  1. 1

    Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

    Published 2007
    “…Then, we empirically compare the three proposed algorithms and FESP using realistic data. Our experimental results show that SA and GA produce good exam schedules that are better than those of FESP heuristic procedure. …”
    Get full text
    Get full text
    article
  2. 2
  3. 3

    Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing by Al Sadawi, Alia

    Published 2016
    “…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …”
    Get full text
    doctoralThesis
  4. 4

    Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain by Al Sadawi, Alia

    Published 2021
    “…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
    Get full text
    article
  5. 5
  6. 6

    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

    Published 2018
    “…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  7. 7
  8. 8
  9. 9

    An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

    Published 2017
    “…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  10. 10
  11. 11

    Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

    Published 1998
    “…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
    Get full text
    Get full text
    article
  12. 12
  13. 13
  14. 14

    Three-phase simulated annealing algorithms for exam scheduling by Mansour, Nashat

    Published 2003
    “…We empirically compare 3PSA with a 4-phase clustering-based heuristic algorithm using realistic data. Our experimental results show that 3PSA produces good exam schedules, which are better than those of the clustering heuristic procedure.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  15. 15

    Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

    Published 2002
    “…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
    Get full text
    Get full text
    Get full text
    article
  16. 16
  17. 17
  18. 18
  19. 19

    A reduced model for phase-change problems with radiation using simplified PN approximations by Belhamadia, Youssef

    Published 2025
    “…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
    Get full text
    article
  20. 20