Distributed task scheduling and allocation using genetic algorithms
β Scribed by David Todd; Pratyush Sen
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 313 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
β¦ Synopsis
As complexity and size of projects increase so do the problems associated with the scheduling and management of the design, manufacturing and assembly processes. In the context of large projects the ability to oplimise the scheduling and allocation of these processes can also aid in tendering for contract as well as the management of the project itself. Many large projects will be constructed across distributed sites, each with their own capabilities and specific areas of expertise. Multiple sources may be needed to provide skilled personnel, raw materials, specialised components or facilities for the project, even whole sub-systems within a complex project may be contracted out for financial or time reasons. This paper demonstrates how a computational intelligence technique know as the Genetic Algorithm can be used to optirnise design, manufacturing and construction schedules for multiple objectives such as minimising cost and time and maximising utilisation. The system generates a number of near-optimal project scenarios from which a single solution can be selected and implemented by the project manager.
π SIMILAR VOLUMES
This paper considers the problem of distributed dynamic task allocation by a set of cooperative agents. The paper describes a rather speciΓΏc situation. However, its methods have wide application and, thus, it can be useful to solve general problems of computer science. One of its main ideas is to co
This paper presents 8n optimal caps&or allocation method which uses fuzzy reasoning and genetic algorithms for primary distribution systems. In the method, capacitor allocation ls applied to correct voltage deviation and reduce power loss for a given load pattern. The problem of caps&or allocation i
We consider the problem of designing a distributed computing system for handling a set of repetitive tasks on a periodic basis. Tasks assigned to di!erent processors need communication link capacity, tasks executing on the same processor do not. The aim is to develop a design of minimum total cost t
To exploit a heterogeneous computing (HC) environment, an application task may be decomposed into subtasks that have data dependencies. Subtask matching and scheduling consists of assigning subtasks to machines, ordering subtask execution for each machine, and ordering intermachine data transfers. T
Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptio