{"id":"https://openalex.org/W2507112901","doi":"https://doi.org/10.1080/0951192x.2016.1210231","title":"Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots","display_name":"Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2507112901","doi":"https://doi.org/10.1080/0951192x.2016.1210231","mag":"2507112901"},"language":"en","primary_location":{"id":"doi:10.1080/0951192x.2016.1210231","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0951192x.2016.1210231","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/Multi-degree_cyclic_flow_shop_robotic_cell_scheduling_problem_with_multiple_robots/20701459","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038993464","display_name":"Atabak Elmi","orcid":"https://orcid.org/0000-0003-3660-8408"},"institutions":[{"id":"https://openalex.org/I59738393","display_name":"Gaziantep University","ror":"https://ror.org/020vvc407","country_code":"TR","type":"education","lineage":["https://openalex.org/I59738393"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Atabak Elmi","raw_affiliation_strings":["Department of Industrial Engineering, Faculty of Engineering, Gaziantep University, Gaziantep, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Faculty of Engineering, Gaziantep University, Gaziantep, Turkey","institution_ids":["https://openalex.org/I59738393"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079642684","display_name":"\u015eeyda Topalo\u011flu","orcid":"https://orcid.org/0000-0001-6827-126X"},"institutions":[{"id":"https://openalex.org/I193615760","display_name":"Dokuz Eyl\u00fcl University","ror":"https://ror.org/00dbd8b73","country_code":"TR","type":"education","lineage":["https://openalex.org/I193615760"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Seyda Topaloglu","raw_affiliation_strings":["Department of Industrial Engineering, Faculty of Engineering, Dokuz Eylul University, Izmir, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Faculty of Engineering, Dokuz Eylul University, Izmir, Turkey","institution_ids":["https://openalex.org/I193615760"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038993464"],"corresponding_institution_ids":["https://openalex.org/I59738393"],"apc_list":null,"apc_paid":null,"fwci":2.1226,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88418586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"30","issue":"8","first_page":"805","last_page":"821"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7232567667961121},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6279302835464478},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6175804138183594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6139087677001953},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.565406084060669},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5559591054916382},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5478609800338745},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.43222135305404663},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4301391839981079},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4212465286254883},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26774460077285767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2095908522605896},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20761480927467346}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7232567667961121},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6279302835464478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6175804138183594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6139087677001953},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.565406084060669},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5559591054916382},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5478609800338745},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.43222135305404663},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4301391839981079},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4212465286254883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26774460077285767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2095908522605896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20761480927467346},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/0951192x.2016.1210231","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0951192x.2016.1210231","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30139322","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:figshare.com:article/20701459","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Multi-degree_cyclic_flow_shop_robotic_cell_scheduling_problem_with_multiple_robots/20701459","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/20701459","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Multi-degree_cyclic_flow_shop_robotic_cell_scheduling_problem_with_multiple_robots/20701459","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W606103426","https://openalex.org/W1965605059","https://openalex.org/W1996937503","https://openalex.org/W2002556739","https://openalex.org/W2003019107","https://openalex.org/W2004158688","https://openalex.org/W2011960863","https://openalex.org/W2024909962","https://openalex.org/W2027270128","https://openalex.org/W2027854417","https://openalex.org/W2033538145","https://openalex.org/W2034919285","https://openalex.org/W2045766182","https://openalex.org/W2048804129","https://openalex.org/W2051107539","https://openalex.org/W2059404503","https://openalex.org/W2069762730","https://openalex.org/W2077748110","https://openalex.org/W2078552078","https://openalex.org/W2088044969","https://openalex.org/W2089989890","https://openalex.org/W2121573168","https://openalex.org/W2129068093","https://openalex.org/W2131087757","https://openalex.org/W2132607795","https://openalex.org/W2134686833","https://openalex.org/W2136502128","https://openalex.org/W2147965468","https://openalex.org/W2148039735","https://openalex.org/W2171514102","https://openalex.org/W3023512930","https://openalex.org/W3122485362","https://openalex.org/W3125400005"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W2140584489"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,12,24],"the":[4,33,36,41,60,64,68,72,79,85,113],"cyclic":[5,65],"flow":[6],"shop":[7],"robotic":[8],"cell":[9],"scheduling":[10],"problem":[11,100],"multiple":[13,22],"robots,":[14],"in":[15,76],"which":[16,75],"parts":[17,39],"are":[18],"processed":[19],"successively":[20],"on":[21,29,94],"machines":[23],"lower":[25],"and":[26,32,67,102],"upper":[27],"bounds":[28],"processing":[30],"times":[31],"robots":[34,73],"execute":[35],"transportation":[37],"of":[38,63,71,84,97,115],"between":[40],"machines.":[42],"A":[43],"novel":[44],"mixed-integer":[45],"linear":[46],"programming":[47],"model":[48,57,87],"has":[49],"been":[50],"proposed":[51,56,86,116],"for":[52],"this":[53],"problem.":[54],"The":[55,82,109],"simultaneously":[58],"determines":[59],"optimal":[61,69],"degree":[62],"schedule":[66],"sequencing":[70],"moves,":[74],"return":[77],"maximises":[78],"throughput":[80],"rate.":[81],"validity":[83],"is":[88],"examined":[89],"by":[90],"a":[91,95],"computational":[92,110],"study":[93],"set":[96],"randomly":[98],"generated":[99],"instances":[101],"solved":[103],"using":[104],"commercial":[105],"optimisation":[106],"software":[107],"GAMS.":[108],"experiments":[111],"indicate":[112],"efficiency":[114],"model.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}