{"id":"https://openalex.org/W2574347234","doi":"https://doi.org/10.1007/s10957-016-1056-1","title":"Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers","display_name":"Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers","publication_year":2017,"publication_date":"2017-01-12","ids":{"openalex":"https://openalex.org/W2574347234","doi":"https://doi.org/10.1007/s10957-016-1056-1","mag":"2574347234"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-016-1056-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-016-1056-1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10957-016-1056-1.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs10957-016-1056-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069008839","display_name":"Marie\u2010Laure Espinouse","orcid":"https://orcid.org/0000-0003-0120-661X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Marie-Laure Espinouse","raw_affiliation_strings":["Universit\u00e9 Grenoble Alpes, CNRS, G-SCOP, Grenoble, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble Alpes, CNRS, G-SCOP, Grenoble, France","institution_ids":["https://openalex.org/I899635006","https://openalex.org/I4210094718","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065192228","display_name":"Grzegorz Pawlak","orcid":"https://orcid.org/0000-0002-1458-5586"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Grzegorz Pawlak","raw_affiliation_strings":["Institute of Computing Science, Poznan University of Technology, Poznan, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computing Science, Poznan University of Technology, Poznan, Poland","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004993834","display_name":"Ma\u0142gorzata Sterna","orcid":"https://orcid.org/0000-0002-3845-8194"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Malgorzata Sterna","raw_affiliation_strings":["Institute of Computing Science, Poznan University of Technology, Poznan, Poland"],"raw_orcid":"https://orcid.org/0000-0002-3845-8194","affiliations":[{"raw_affiliation_string":"Institute of Computing Science, Poznan University of Technology, Poznan, Poland","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004993834","https://openalex.org/A5065192228","https://openalex.org/A5069008839"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I46597724","https://openalex.org/I899635006"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.8456,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86579683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"173","issue":"3","first_page":"1042","last_page":"1054"},"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6507104635238647},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6172179579734802},{"id":"https://openalex.org/keywords/depot","display_name":"Depot","score":0.6155862808227539},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47348082065582275},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4602770507335663},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43686485290527344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19560667872428894},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08841627836227417}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6507104635238647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172179579734802},{"id":"https://openalex.org/C2776561332","wikidata":"https://www.wikidata.org/wiki/Q5554853","display_name":"Depot","level":2,"score":0.6155862808227539},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47348082065582275},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4602770507335663},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43686485290527344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19560667872428894},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08841627836227417},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10957-016-1056-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-016-1056-1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10957-016-1056-1.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01621224v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01621224","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Optimization Theory and Applications, 2017, 173 (3), pp.1042-1054. &#x27E8;10.1007/s10957-016-1056-1&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:spr:joptap:v:173:y:2017:i:3:d:10.1007_s10957-016-1056-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10957-016-1056-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10957-016-1056-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-016-1056-1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10957-016-1056-1.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2574347234.pdf","grobid_xml":"https://content.openalex.org/works/W2574347234.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W68213892","https://openalex.org/W221979189","https://openalex.org/W579436346","https://openalex.org/W1503139286","https://openalex.org/W1512132267","https://openalex.org/W1523349087","https://openalex.org/W1529442218","https://openalex.org/W1984386185","https://openalex.org/W1999941455","https://openalex.org/W2010782080","https://openalex.org/W2011039300","https://openalex.org/W2014192444","https://openalex.org/W2020220547","https://openalex.org/W2034919285","https://openalex.org/W2044456402","https://openalex.org/W2048900430","https://openalex.org/W2055650858","https://openalex.org/W2062601646","https://openalex.org/W2065314278","https://openalex.org/W2078067185","https://openalex.org/W2081744229","https://openalex.org/W2082021049","https://openalex.org/W2084402702","https://openalex.org/W2087704984","https://openalex.org/W2092994132","https://openalex.org/W2093401491","https://openalex.org/W2095094674","https://openalex.org/W2116751537","https://openalex.org/W2119760838","https://openalex.org/W2140153029","https://openalex.org/W2145493798","https://openalex.org/W2153153846","https://openalex.org/W2160364094","https://openalex.org/W2161644760","https://openalex.org/W2292943019","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2395000508","https://openalex.org/W2420434559","https://openalex.org/W3192142172","https://openalex.org/W1553143911","https://openalex.org/W2093799795","https://openalex.org/W2417634612","https://openalex.org/W2371664621","https://openalex.org/W2735372451","https://openalex.org/W3134266419","https://openalex.org/W3204654320"],"abstract_inverted_index":{"The":[0,16,35,71,80],"paper":[1],"concerns":[2],"complexity":[3],"studies":[4],"on":[5],"the":[6,40,52,66,69,77,85,91,104,108,121,135,143,146,150,153],"scheduling":[7],"problem":[8,113],"arising":[9],"in":[10,49,76,103],"a":[11,20,63],"simple":[12],"flexible":[13],"manufacturing":[14],"system.":[15,105],"system":[17],"consists":[18],"of":[19,51,93,111,134],"single":[21],"machine,":[22],"one":[23,30,60],"depot":[24,67,144],"(both":[25],"with":[26,138],"unlimited":[27],"buffers),":[28],"and":[29,68,99,114,148],"vehicle":[31,36,94],"(automated":[32],"guided":[33],"vehicle).":[34],"operates":[37],"according":[38],"to":[39,83,89,97,126,145,152],"regular":[41],"metro":[42],"strategy.":[43],"This":[44],"means":[45],"that":[46,116,131],"it":[47],"travels":[48],"cycles":[50,95],"constant":[53],"length,":[54,87],"without":[55],"stops,":[56],"transporting":[57],"at":[58,62],"most":[59],"job":[61],"time":[64],"between":[65],"machine.":[70],"machine":[72,147,151],"executes":[73],"available":[74],"jobs":[75,102],"non-preemptive":[78],"way.":[79],"goal":[81],"is":[82],"minimize":[84,90],"schedule":[86],"i.e.,":[88],"number":[92],"necessary":[96],"transport":[98],"execute":[100],"all":[101],"We":[106],"prove":[107],"strong":[109],"NP-hardness":[110],"this":[112],"show":[115],"any":[117],"list":[118],"algorithm":[119],"has":[120],"worst-case":[122],"performance":[123],"ratio":[124],"equal":[125],"2.":[127],"Moreover,":[128],"we":[129],"mention":[130],"special":[132],"cases":[133],"considered":[136],"problem,":[137],"zero":[139],"transportation":[140],"times":[141],"from":[142,149],"depot,":[154],"are":[155],"polynomially":[156],"solvable.":[157]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}
