{"id":"https://openalex.org/W7161751691","doi":"https://doi.org/10.1007/s10479-026-07261-3","title":"A coupled task scheduling approximation algorithm for minimizing the sum of completion times","display_name":"A coupled task scheduling approximation algorithm for minimizing the sum of completion times","publication_year":2026,"publication_date":"2026-05-21","ids":{"openalex":"https://openalex.org/W7161751691","doi":"https://doi.org/10.1007/s10479-026-07261-3"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-026-07261-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10479-026-07261-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10479-026-07261-3.pdf","source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","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/s10479-026-07261-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357961","display_name":"J\u00f3zsef B\u00e9k\u00e9si","orcid":"https://orcid.org/0000-0003-3820-9777"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"J\u00f3zsef B\u00e9k\u00e9si","raw_affiliation_strings":["Department of Foundations of Computer Science, Faculty of Science and Informatics, University of Szeged, Tisza Lajos str. 103., H-6725, Szeged, Hungary"],"raw_orcid":"https://orcid.org/0000-0003-3820-9777","affiliations":[{"raw_affiliation_string":"Department of Foundations of Computer Science, Faculty of Science and Informatics, University of Szeged, Tisza Lajos str. 103., H-6725, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136582408","display_name":"Gy\u00f6rgy D\u00f3sa","orcid":null},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gy\u00f6rgy D\u00f3sa","raw_affiliation_strings":["Department of Mathematics, Faculty of Information Technology, University of Pannonia, Egyetem str. 10, H-8200, Veszpr\u00e9m, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Information Technology, University of Pannonia, Egyetem str. 10, H-8200, Veszpr\u00e9m, Hungary","institution_ids":["https://openalex.org/I140275651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110525746","display_name":"G\u00e1bor Galambos","orcid":null},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e1bor Galambos","raw_affiliation_strings":["Department of Informatics, Faculty of Juh\u00e1sz Gyula Teacher\u2019s Training College, University of Szeged, Boldogasszony str. 6., H-6725, Szeged, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Faculty of Juh\u00e1sz Gyula Teacher\u2019s Training College, University of Szeged, Boldogasszony str. 6., H-6725, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068357961"],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.55361453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"362","issue":"1-3","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.5491999983787537,"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.5491999983787537,"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.28450000286102295,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.0697999969124794,"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/theory-of-computation","display_name":"Theory of computation","score":0.7099000215530396},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6543999910354614},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6111000180244446},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.484499990940094},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4812999963760376},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4779999852180481},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46970000863075256}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7099000215530396},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6543999910354614},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6111000180244446},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5065000057220459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5009999871253967},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.484499990940094},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4779999852180481},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46970000863075256},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46709999442100525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4618000090122223},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45649999380111694},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.3582000136375427},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30250000953674316},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2529999911785126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10479-026-07261-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10479-026-07261-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10479-026-07261-3.pdf","source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10479-026-07261-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10479-026-07261-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10479-026-07261-3.pdf","source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.44589194655418396,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320329149","display_name":"Szegedi Tudom\u00e1nyegyetem","ror":"https://ror.org/01pnej532"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161751691.pdf","grobid_xml":"https://content.openalex.org/works/W7161751691.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1966465131","https://openalex.org/W1980759864","https://openalex.org/W1981499630","https://openalex.org/W2060208047","https://openalex.org/W2089381285","https://openalex.org/W2091574768","https://openalex.org/W2093957211","https://openalex.org/W2115390787","https://openalex.org/W2117976507","https://openalex.org/W2558937980","https://openalex.org/W2884935773","https://openalex.org/W2972249483","https://openalex.org/W3166447492","https://openalex.org/W4224296565","https://openalex.org/W4238077421","https://openalex.org/W4299328713","https://openalex.org/W4366984194"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"the":[2,30,35,40,66,72,88,93,186,196],"considered":[3],"coupled":[4],"task":[5,77],"problem":[6],"(CTP)":[7],"we":[8,62,181],"have":[9],"to":[10,33,121,177],"schedule":[11],"n":[12],"jobs":[13],"on":[14,92],"a":[15,44,122,193],"single":[16],"machine,":[17],"each":[18,76],"consisting":[19],"of":[20,39,59,69,97,189,195],"two":[21],"tasks":[22],"with":[23],"exact":[24],"time":[25,38,82],"delay":[26],"between":[27],"them,":[28],"while":[29],"objective":[31],"is":[32,100],"minimize":[34],"total":[36],"completion":[37],"jobs.":[41],"We":[42,117],"analyze":[43],"greedy":[45],"type":[46],"algorithm":[47,98,190],"\u2013":[48,54],"called":[49],"SDF":[50,70,99,191],"(Shortest":[51],"Delay":[52],"First)":[53],"from":[55],"worst":[56],"case":[57,74],"point":[58],"view,":[60],"and":[61],"give":[63,182],"bounds":[64],"for":[65,71,162,185],"asymptotic":[67,94,187],"behavior":[68,188],"special":[73],"where":[75],"has":[78],"equal":[79],"length":[80],"processing":[81],"p":[83,198],".":[84,199],"For":[85],"this":[86,119],"case,":[87],"best-known":[89],"upper":[90,124],"bound":[91,120,125],"performance":[95],"ratio":[96],"$$\\frac{5}{3}\\approx":[101],"1.666\\ldots":[102],".$$":[103],"<mml:math":[104,127,166],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[105,128,167],"<mml:mrow>":[106,130,135,154,168],"<mml:mfrac>":[107,129],"<mml:mn>5</mml:mn>":[108],"<mml:mn>3</mml:mn>":[109,136],"</mml:mfrac>":[110,158],"<mml:mo>\u2248</mml:mo>":[111],"<mml:mn>1.666</mml:mn>":[112],"<mml:mo>\u2026</mml:mo>":[113],"<mml:mo>.</mml:mo>":[114,172],"</mml:mrow>":[115,149,153,157,173],"</mml:math>":[116,159,174],"improve":[118],"general":[123],"$$\\frac{21p-\\sqrt{3(43p^2-28p+4)}-6}{6p}$$":[126],"<mml:mn>21</mml:mn>":[131],"<mml:mi>p</mml:mi>":[132,140,145,156,169],"<mml:mo>-</mml:mo>":[133,143,151],"<mml:msqrt>":[134],"<mml:mo>(</mml:mo>":[137],"<mml:mn>43</mml:mn>":[138],"<mml:msup>":[139],"<mml:mn>2</mml:mn>":[141,171],"</mml:msup>":[142],"<mml:mn>28</mml:mn>":[144],"<mml:mo>+</mml:mo>":[146],"<mml:mn>4</mml:mn>":[147],"<mml:mo>)</mml:mo>":[148],"</mml:msqrt>":[150],"<mml:mn>6</mml:mn>":[152,155],"that":[160],"holds":[161],"all":[163],"$$p\\ge":[164],"2.$$":[165],"<mml:mo>\u2265</mml:mo>":[170],"Using":[175],"constructions":[176],"compute":[178],"lower":[179],"bounds,":[180],"narrow":[183],"intervals":[184],"as":[192],"function":[194],"parameter":[197]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2026-05-21T00:00:00"}