کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482269 | 1446130 | 2010 | 8 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Solving the response time variability problem by means of a genetic algorithm Solving the response time variability problem by means of a genetic algorithm](/preview/png/482269.png)
The response time variability problem (RTVP) is a hard scheduling problem that has recently been defined in the literature and has a wide range of real-world applications in mixed-model assembly lines, multithreaded computer systems, network environments and others. The RTVP arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the points at which they receive the necessary resources is minimized. Since the RTVP is a complex problem, heuristic and metaheuristic techniques are needed to solve it. The best results in the literature for the RTVP have been obtained with a psychoclonal algorithm. We propose a genetic algorithm (GA) that is adapted to solve the RTVP. A computational experiment is carried out and it is shown that, on average, the GA produces better results than the psychoclonal algorithm.
Journal: European Journal of Operational Research - Volume 202, Issue 2, 16 April 2010, Pages 320–327