{"id":"https://openalex.org/W2620541949","doi":"https://doi.org/10.1051/ro/2017044","title":"Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines","display_name":"Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines","publication_year":2017,"publication_date":"2017-05-29","ids":{"openalex":"https://openalex.org/W2620541949","doi":"https://doi.org/10.1051/ro/2017044","mag":"2620541949"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2017044","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2017044","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2017/04/ro160218.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2017/04/ro160218.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075247612","display_name":"Imed Kacem","orcid":"https://orcid.org/0000-0001-6649-7257"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Imed Kacem","raw_affiliation_strings":["Universit\u00e9 de Lorraine, LCOMS EA 7306, 57000, Metz, France","Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, LCOMS EA 7306, 57000, Metz, France","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"raw_affiliation_string":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4387152457"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044128099","display_name":"Myriam Sahnoune","orcid":"https://orcid.org/0000-0002-1794-170X"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Myriam Sahnoune","raw_affiliation_strings":["Universit\u00e9 de Lorraine, LCOMS EA 7306, 57000, Metz, France","Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, LCOMS EA 7306, 57000, Metz, France","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"raw_affiliation_string":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4387152457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026890421","display_name":"G\u00fcnter Schmidt","orcid":"https://orcid.org/0000-0003-1944-0885"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G\u00fcnter Schmidt","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, ORBI, Sarbrucken, Germany","Universit\u00e4t des Saarlandes [Saarbr\u00fccken]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, ORBI, Sarbrucken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Universit\u00e4t des Saarlandes [Saarbr\u00fccken]","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075247612"],"corresponding_institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":1.531,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85088403,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"51","issue":"4","first_page":"1177","last_page":"1188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9969000220298767,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9901000261306763,"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/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.8206114768981934},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6593120098114014},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6587451696395874},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.639975368976593},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.616761326789856},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.603634774684906},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5704119205474854},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5615999102592468},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5443115234375},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4527478814125061},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42459604144096375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41003745794296265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40918299555778503},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.102283775806427}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8206114768981934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6593120098114014},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6587451696395874},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.639975368976593},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.616761326789856},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.603634774684906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5704119205474854},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5615999102592468},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5443115234375},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4527478814125061},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42459604144096375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41003745794296265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40918299555778503},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.102283775806427},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1051/ro/2017044","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2017044","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2017/04/ro160218.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02925348v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02925348","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RAIRO - Operations Research, 2017, 51 (4), pp.1177-1188. ⟨10.1051/ro/2017044⟩","raw_type":"Journal articles"},{"id":"pmh:oai:edpsciences.org:dkey/10.1051/ro/2017044","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400744","display_name":"Springer Link (Chiba Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8488066","host_organization_name":"Chiba Institute of Technology","host_organization_lineage":["https://openalex.org/I8488066"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.1051/ro/2017044","raw_type":"Text"},{"id":"pmh:oai:numdam.org:RO_2017__51_4_1177_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2017044/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"}],"best_oa_location":{"id":"doi:10.1051/ro/2017044","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2017044","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2017/04/ro160218.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310925","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97"},{"id":"https://openalex.org/F4320323322","display_name":"Universit\u00e4t des Saarlandes","ror":"https://ror.org/01jdpyv68"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2620541949.pdf","grobid_xml":"https://content.openalex.org/works/W2620541949.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1963587549","https://openalex.org/W1988328380","https://openalex.org/W1994639433","https://openalex.org/W1995313677","https://openalex.org/W1996513144","https://openalex.org/W1999566861","https://openalex.org/W2016371955","https://openalex.org/W2020203251","https://openalex.org/W2026891055","https://openalex.org/W2041944550","https://openalex.org/W2048358792","https://openalex.org/W2048690484","https://openalex.org/W2065104488","https://openalex.org/W2067297441","https://openalex.org/W2074951241","https://openalex.org/W2092438148","https://openalex.org/W2093067798","https://openalex.org/W2093570686","https://openalex.org/W2136658137","https://openalex.org/W2289217518"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2970302286","https://openalex.org/W1759995226","https://openalex.org/W2558361976","https://openalex.org/W2048358792","https://openalex.org/W2620541949","https://openalex.org/W1972853793","https://openalex.org/W2399100966","https://openalex.org/W1903284337","https://openalex.org/W2009846993"],"abstract_inverted_index":{"We":[0,50],"consider":[1],"the":[2,9,20,52,64,69,72,90,108,126],"total":[3],"weighted":[4],"completion":[5],"time":[6,28],"minimization":[7],"for":[8,44,63,71,89],"two-parallel":[10,91],"capacitated":[11,92],"machines":[12,21,93],"scheduling":[13,94],"problem.":[14],"In":[15],"this":[16],"problem,":[17,66,95],"one":[18],"of":[19,54,110,120],"can":[22],"process":[23],"jobs":[24,46],"until":[25],"a":[26,55,111,118],"certain":[27],"T":[29],"1":[30,100],"after":[31],"which":[32,67],"it":[33],"is":[34,41,105],"no":[35],"longer":[36],"available.":[37],"The":[38],"other":[39],"machine":[40],"continuously":[42],"available":[43],"performing":[45],"at":[47],"any":[48],"time.":[49],"prove":[51],"existence":[53],"strongly":[56],"Fully":[57,84],"Polynomial":[58,85],"Time":[59,86],"Approximation":[60,87],"Scheme":[61,88],"(FPTAS)":[62],"studied":[65],"extends":[68],"results":[70],"unweighted":[73],"version":[74],"(see":[75],"[I.":[76],"Kacem,":[77],"Y.":[78],"Lanuel":[79],"and":[80,123],"M.":[81],"Sahnoune,":[82],"Strongly":[83],"Int.":[96],"J.":[97],"Plann.":[98],"Sched.":[99],"(2011)":[101],"32\u201341]).":[102],"Our":[103],"FPTAS":[104],"based":[106],"on":[107],"simplification":[109],"dynamic":[112],"programming":[113],"algorithm.":[114],"Moreover,":[115],"we":[116,124],"present":[117],"set":[119],"numerical":[121],"experiments":[122],"discuss":[125],"results.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}