A comparison of messy GA and permutation based GA for job shop scheduling

Autor:	Paul Walsh, Pio Fenton
Rok vydání:	2005
Předmět:	Permutation Mathematical optimization Job shop scheduling media_common.quotation_subject Macro level Quality (business) Flow shop scheduling Mathematics media_common
Zdroj:	GECCO
DOI:	10.1145/1068009.1068275
Popis:	This paper presents the results of a fair comparison between a messy GA and a permutation based simple GA as applied to a job shop scheduling system. An examination is made at a macro level in terms of performance and quality of schedules achieved and conclusions are drawn as to the superiority of messy GA or otherwise.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f1cadc40499b353b1ad15aea7aec284c https://doi.org/10.1145/1068009.1068275 Zobrazit plný text záznamu