Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (Q535971): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58654327, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel scheduling strategy for downlink multiuser MIMO system: Particle swarm optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with multiple modes: A genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: A survey of recent developments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for multi-mode resource-constrained project scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3540787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with multiple modes: A comparison of exact algorithms / rank
 
Normal rank

Latest revision as of 00:56, 4 July 2024

scientific article
Language Label Description Also known as
English
Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
scientific article

    Statements

    Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (English)
    0 references
    0 references
    0 references
    16 May 2011
    0 references
    Summary: The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named ``standard'' particle swarm optimization (PSO) metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the best performance resource heuristic and the latest finish time heuristic. These two heuristics applied to the PSO scheme are for speeding up the search of the particle and improving the capability of finding a sound schedule. Moreover, both global communication topology and local ring communication topology are also investigated for efficient study of proposed scheme. Simulation results demonstrate that the proposed approach in this investigation can successfully solve the task-resource assignment problems in grid computing and similar scheduling problems.
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references