 Solving the response time variability problem by means of a genetic algorithmAlberto García-Villoria and Rafael Pastor European Journal of Operational Research, 2010, vol. 202, issue 2, 320-327 Abstract: 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. Keywords: Response; time; variability; Fair; sequences; Scheduling; Genetic; algorithm; Evolution; program; Metaheuristics (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:202:y:2010:i:2:p:320-327 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.