<?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-YH1M02XK/3dee4828-5c9e-460a-b393-8e76ffc773ad/PDF"><dcterms:extent>1120 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-YH1M02XK/8e969c2e-1369-4bcd-a6a0-a9d58e57c97b/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-YH1M02XK"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-QCV9XF2O" /><dcterms:issued>2024</dcterms:issued><dc:creator>Li, Y. C.</dc:creator><dc:creator>Wang, X.</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:19</dc:format><dc:format xml:lang="sl">str. 31-45</dc:format><dc:identifier>DOI:10.14743/apem2024.1.491</dc:identifier><dc:identifier>ISSN:1854-6250</dc:identifier><dc:identifier>COBISSID_HOST:266213891</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-YH1M02XK</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">algoritem roja delcev</dc:subject><dc:subject xml:lang="en">assembly line balancing problem</dc:subject><dc:subject xml:lang="en">carbon emissions</dc:subject><dc:subject xml:lang="en">collaborative robot (cobot)</dc:subject><dc:subject xml:lang="en">cross-station tasks</dc:subject><dc:subject xml:lang="sl">emisije ogljika</dc:subject><dc:subject xml:lang="en">human-robot collaboration</dc:subject><dc:subject xml:lang="sl">kolaborativni robot</dc:subject><dc:subject xml:lang="sl">montažne linije</dc:subject><dc:subject xml:lang="en">particle swarm algorithm</dc:subject><dc:subject xml:lang="en">PSA</dc:subject><dc:subject xml:lang="sl">sodelovanje človek-stroj</dc:subject><dcterms:temporal rdf:resource="2014-2026" /><dc:title xml:lang="sl">Human-robot collaboration assembly line balancing considering cross-station tasks and the carbon emissions|</dc:title><dc:description xml:lang="sl">With the growth of industrialization, the global manufacturing industry is continually evolving and reforming in the direction of intelligence and green production. Industrial robots have replaced human workers because of the benefit of production efficiency. However, the large-scale application of robots requires a large amount of energy consumption and generates a large amount of CO2, which will lead to energy waste and environmental pollution. In addition, in term of performing some particular tasks, current robot technology cannot achieve the same level of intelligence as human. Therefore, the design trend of assembly lines in industry has shifted from traditional configuration to human-robot collaboration to achieve higher productivity and flexibility. This paper investigates the human-robot collaboration (HRC) assembly line balancing problem, taking cycle time and carbon emission as primary and secondary objectives. A new mixed-integer programming model that features a cross-station design is formulated. A particle swarm algorithm (PSO) with two improvement rules is designed to solve the problems. The comparative experiments on ten benchmark datasets are conducted to assess the performance of the proposed algorithm. The experimental results indicate that the improved particle swarm algorithm is superior to the other two heuristics: simulated annealing (SA) and the late acceptance hill-climbing heuristic (LAHC)</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-YH1M02XK"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-YH1M02XK" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-YH1M02XK/3dee4828-5c9e-460a-b393-8e76ffc773ad/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-YH1M02XK/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-YH1M02XK" /></ore:Aggregation></rdf:RDF>