Selected variants of a Memetic Algorithm for JSP – a comparative study

Urszula Boryczka and Krzysztof Szwarc

International Journal of Production Research, 2019, vol. 57, issue 22, 7142-7157

Abstract: The article aims to address a research gap concerning the adequate configuration of a Memetic Algorithm adapted to solve the Job-Shop Scheduling Problem. The goal was accomplished by means of conducting a comparative study of 16 variants of a Memetic Algorithm, characterised with different places of hybridisation and local search methods applied. The study involved the solution of eleven instances of JSP and the comparison of the results with the results achieved with an Evolutionary Algorithm lacking the mechanism of hybridisation and selected local search methods. The utilitarian significance of the problem also involved the use of assessment measures intended for both practical applications and research purposes.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2019.1581385 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:57:y:2019:i:22:p:7142-7157

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2019.1581385

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().