Search alternatives:
based scheduling » task scheduling (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
Showing 1 - 20 results of 637 for search '(((( based scheduling algorithm ) OR ( problem using algorithm ))) OR ( elements data algorithm ))', query time: 0.14s Refine Results
  1. 1
  2. 2

    A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves by Harmanani, Haidar M.

    Published 2016
    “…This paper investigates the use of parallel genetic algorithms in order to solve the open-shop scheduling problem. …”
    Get full text
    Get full text
    Get full text
    article
  3. 3

    An Uncertainty Based Genetic Algorithm Approach for Project Resource Scheduling by ALKETBI, SAIF

    Published 2016
    “…Several nonlinear optimization models were developed for this purpose assuming uniform resource availability and sequence based project tasks. The work presented in thesis add to the existing literature in a proposing the use of a genetic algorithm uncertain approach to resource- scheduling in projects. …”
    Get full text
  4. 4

    A new tabu search algorithm for the long-term hydro scheduling problem by Mantawy, A.H.

    Published 2002
    “…The algorithm is based on using the short-term memory of the tabu search (TS) approach to solve the nonlinear optimization problem in continuous variables of the LTHSP. …”
    Get full text
    Get full text
    article
  5. 5

    A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems by Bilal Khurshid (16715865)

    Published 2024
    “…<p dir="ltr">This study investigates the no-wait flow shop scheduling problem and proposes a hybrid (HES-IG) algorithm that utilizes makespan as the objective function. …”
  6. 6

    Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

    Published 2007
    “…In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. …”
    Get full text
    Get full text
    article
  7. 7

    Improvement Algorithm for Limited Space Scheduling by Zouein, Pierrette

    Published 2001
    “…This paper addresses the combined problem termed “space scheduling” and presents an algorithmic time-space trade-off model for adjusting activity durations and start dates to decrease the need for space over congested time periods. …”
    Get full text
    Get full text
    article
  8. 8

    Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing by Abualigah, Laith

    Published 2024
    “…We evaluate the proposed algorithm against state-of-the-art approaches using benchmark task scheduling problems in cloud environments. …”
    Get full text
  9. 9

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

    Power-constrained system-on-a-chip test scheduling using a genetic algorithm by Harmanani, Haidar M.

    Published 2006
    “…This paper presents an efficient approach for the test scheduling problem of core-based systems based on a genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    article
  11. 11
  12. 12

    A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units by El-Amin, I.

    Published 2020
    “…A new heuristic algorithm based on the Tabu search has been proposed for the maintenance schedule (MS) of electric generation units. …”
    Get full text
    article
  13. 13

    A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units by Duffuaa, S. O.

    Published 2020
    “…A new heuristic algorithm based on the Tabu search has been proposed for the maintenance schedule (MS) of electric generation units. …”
    Get full text
    article
  14. 14

    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
  15. 15
  16. 16

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
    Get full text
    Get full text
    article
  17. 17

    A Simulated Annealing Algorithm For Fuzzy Unit Commitment Problem by Mantawy, A. H.

    Published 2020
    “…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
    Get full text
    article
  18. 18

    A simulated annealing algorithm for fuzzy unit commitment problem by Mantawy, A.H.

    Published 1999
    “…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
    Get full text
    Get full text
    article
  19. 19

    Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem by Mantawy, A.H.

    Published 1999
    “…This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. …”
    Get full text
    Get full text
    article
  20. 20

    An efficient method for the open-shop scheduling problem using simulated annealing by Harmanani, Haidar M.

    Published 2016
    “…This paper presents a simulated annealing algorithm in order to solve the nonpreemptive open-shop scheduling problem with the objective of minimizing the makespan. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject