<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-3H3KVCGO</identifier><date>2023</date><creator>Han, J. H.</creator><creator>Lee, J. Y.</creator><relation>documents/doc/3/URN_NBN_SI_doc-3H3KVCGO_001.pdf</relation><relation>documents/doc/3/URN_NBN_SI_doc-3H3KVCGO_001.txt</relation><format format_type="volume">18</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 152-162</format><identifier identifier_type="DOI">10.14743/apem2023.2.463</identifier><identifier identifier_type="ISSN">1854-6250</identifier><identifier identifier_type="COBISSID_HOST">268223747</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-3H3KVCGO</identifier><language>eng</language><publisher publisher_location="Maribor">Fakulteta za strojništvo, Inštitut za proizvodno strojništvo</publisher><source>Advances in production engineering and management</source><rights>BY</rights><subject language_type_id="eng">flow shop</subject><subject language_type_id="eng">genetic algorithm</subject><subject language_type_id="slv">genetski algoritmi</subject><subject language_type_id="eng">makespan</subject><subject language_type_id="slv">modeliranje</subject><subject language_type_id="eng">modelling</subject><subject language_type_id="slv">optimizacija</subject><subject language_type_id="eng">optimization</subject><subject language_type_id="eng">queue time limits</subject><subject language_type_id="eng">scheduling</subject><subject language_type_id="eng">skipping jobs</subject><title>Genetic algorithm-based approach for makespan minimization in a flow shop with queue time limits and skip-ping jobs</title></Record>