<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-Q8GL8QXB/b3fc5328-55e1-4025-be4e-6081cd0f4db3/PDF"><dcterms:extent>1625 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-Q8GL8QXB/bb85380f-ed83-4952-bd96-5adc006dc2c8/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2014-2026"><edm:begin xml:lang="en">2014</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-Q8GL8QXB"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-QCV9XF2O" /><dcterms:issued>2023</dcterms:issued><dc:creator>Peng, F.</dc:creator><dc:creator>Zheng, L.</dc:creator><dc:format xml:lang="sl">letnik:18</dc:format><dc:format xml:lang="sl">številka:3</dc:format><dc:format xml:lang="sl">str. 271-287</dc:format><dc:identifier>DOI:10.14743/apem2023.3.472</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:268582147</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-Q8GL8QXB</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Fakulteta za strojništvo, Inštitut za proizvodno strojništvo</dc:publisher><dcterms:isPartOf xml:lang="sl">Advances in production engineering and management</dcterms:isPartOf><dc:subject xml:lang="sl">algoritmi</dc:subject><dc:subject xml:lang="en">benchmark analysis</dc:subject><dc:subject xml:lang="sl">delavci</dc:subject><dc:subject xml:lang="sl">delovna sila</dc:subject><dc:subject xml:lang="en">dual resource constraints</dc:subject><dc:subject xml:lang="en">flexible job shop scheduling;</dc:subject><dc:subject xml:lang="sl">inženirstvo</dc:subject><dc:subject xml:lang="en">local search</dc:subject><dc:subject xml:lang="sl">management</dc:subject><dc:subject xml:lang="sl">menedžment</dc:subject><dc:subject xml:lang="sl">metoda sortiranja</dc:subject><dc:subject xml:lang="en">multi-objective optimization</dc:subject><dc:subject xml:lang="en">NSGA-II</dc:subject><dc:subject xml:lang="sl">optimizacija</dc:subject><dc:subject xml:lang="sl">produkcijski cikli</dc:subject><dc:subject xml:lang="sl">stroji</dc:subject><dc:subject xml:lang="en">Wild Horse optimization</dc:subject><dcterms:temporal rdf:resource="2014-2026" /><dc:title xml:lang="sl">An improved multi-objective Wild Horse optimization for the dual-resource-constrained flexible job shop scheduling problem: a comparative analysis with NSGA-II and a real case study|</dc:title><dc:description xml:lang="sl">The equipment manufacturing industry needs skilled workers to operate a specific set of machines following process specifications. Optimizing machine and worker assignments to achieve maximum efficiency is a critical problem for workshop managers. This paper investigates a multi-objective dual-resource-constrained flexible job shop scheduling problem. An improved wild horse optimization (IWHO) algorithm is developed to simultaneously optimize three objectives: makespan, maximum machine workload, and total machine workload. To evaluate the quality of individuals in multi-objective optimization, the Pareto fast non-dominated sorting method is used, and the crowding distance is calculated. To update the algorithm's solution, the crossover and mutation operations are used. Further, a local neighborhood search strategy is employed to enhance searchability and avoid trapping into the local optima. The benchmark of the flexible job shop scheduling problem is extended to create test instances, and the performance of the suggested IWHO algorithm is evaluated compared with the NSGA-II. The computational results show that the IWHO algorithm provides a non-dominated efficient set within a reasonable running time. Furthermore, a buffers and chain coupler assembly process is designed to analyze the practical value of the IWHO algorithm. The proposed solutions can be used to generate daily schedules for managing machines, workers, and production cycles</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-Q8GL8QXB"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-Q8GL8QXB" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-Q8GL8QXB/b3fc5328-55e1-4025-be4e-6081cd0f4db3/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza v Mariboru, Fakulteta za strojništvo</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-Q8GL8QXB/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-Q8GL8QXB" /></ore:Aggregation></rdf:RDF>