3,136 research outputs found
On the efficiency of a genetic algorithm for the multiprocessor scheduling problem
In the multiprocessor scheduling problem a given program is to be scheduled in a given multiprocessor system such that the program's execution time is minimized. This problem being very hard to solve exactly, many heuristic methods for finding a suboptimal schedule exist. An efficient genetic algorithm which introduces some knowledge about the scheduling problem represented by the use of a list heuristic in the crossover and mutation genetic operations was recently proposed [3] in this paper we investigate the efficiency of this genetic algorithm from a theoretical point of view. In particular , we demonstrate the ability of the knowledge-augmented crossover operator to generate all the space of feasible solutions
Multiprocessor task scheduling in multistage hyrid flowshops: a genetic algorithm approach
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage. This problem is of practical interest in the textile and process industries. A genetic algorithm (GA) is developed to solve the problem. The GA is tested against a lower bound from the literature as well as against heuristic rules on a test bed comprising 400 problems with up to 100 jobs, 10 stages, and with up to five processors on each stage. For small problems, solutions found by the GA are compared to optimal solutions, which are obtained by total enumeration. For larger problems, optimum solutions are estimated by a statistical prediction technique. Computational results show that the GA is both effective and efficient for the current problem. Test problems are provided in a web site at www.benchmark.ibu.edu.tr/mpt-h; fsp
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks
This paper considers multiprocessor task scheduling in a multistage hybrid
flow-shop environment. The problem even in its simplest form is NP-hard in the
strong sense. The great deal of interest for this problem, besides its
theoretical complexity, is animated by needs of various manufacturing and
computing systems. We propose a new approach based on limited discrepancy
search to solve the problem. Our method is tested with reference to a proposed
lower bound as well as the best-known solutions in literature. Computational
results show that the developed approach is efficient in particular for
large-size problems
Recommended from our members
Scheduling of tasks in multiprocessor system using hybrid genetic algorithms
This paper presents an investigation into the optimal scheduling of realtime
tasks of a multiprocessor system using hybrid genetic algorithms (GAs). A comparative
study of heuristic approaches such as `Earliest Deadline First (EDF)¿ and
`Shortest Computation Time First (SCTF)¿ and genetic algorithm is explored and
demonstrated. The results of the simulation study using MATLAB is presented and
discussed. Finally, conclusions are drawn from the results obtained that genetic algorithm
can be used for scheduling of real-time tasks to meet deadlines, in turn to obtain
high processor utilization
- …