On parallel and distributed heterogeneous computing systems, a heuristic-based task scheduling algorithm typically consists of two phases: task prioritization and processor selection. In a heuristic based task scheduling algorithm, different prioritization will produce different makespan on a heterogeneous computing system. Therefore, a good scheduling algorithm should be able to efficiently as...

Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...

Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Both algorithms are naturally parallelizable but have heavy data dependencies. Based on experimental results, this paper presents a detailed analysis of the scalability, advantages and disadvantages of each algorithm. Mu...

quality of service (qos) is an important issue in the design and management of web service composition. qos in web services consists of various non-functional factors, such as execution cost, execution time, availability, successful execution rate, and security. in recent years, the number of available web services has proliferated, and then offered the same services increasingly. the same web ...

Water conservancy project scheduling is an extension to the classic resource-constrained problem (RCPSP). It limited by special time constraints called “forbidden windows” during which certain activities cannot be executed. To address this issue, a specific RCPSP model proposed, and approach designated for it incorporates both priority rule-based heuristic algorithm obtain acceptable solution, ...

This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on...

Through analyzing the algorithm presented by Mitsuo.Gen, and taking into account the schema theorem and the architecture block hypothesis of a genetic algorithm, we showed some flaws in Mitsuo.Gen algorithm in this paper. A better genetic algorithm for solving shortest path problems is presented further, which is based on the technology of dynamic coding of the priority of vertex and gene weigh...