Abstract

Machine scheduling problems belong to the most difficult deterministic combinatorial optimization problems. Hence, most scheduling problems are NP-hard and it is impossible to find the optimal schedule in reasonable time. In this paper, we consider a flow-shop scheduling problem with multi-processor tasks. A parallel genetic algorithm using multithreaded programming technique is developed to obtain a quick but good solution to the problem. The performance of the parallel genetic algorithm under various conditions and parameters are studied and presented.KeywordsGenetic algorithmsparallel architecturesparallel computing

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call