{"id":"https://openalex.org/W4414410795","doi":"https://doi.org/10.1007/s00224-025-10232-z","title":"Total Completion Time Scheduling Under Scenarios","display_name":"Total Completion Time Scheduling Under Scenarios","publication_year":2025,"publication_date":"2025-09-22","ids":{"openalex":"https://openalex.org/W4414410795","doi":"https://doi.org/10.1007/s00224-025-10232-z"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-025-10232-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10232-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10232-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","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/s00224-025-10232-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026347724","display_name":"Thomas Bosman","orcid":null},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Thomas Bosman","raw_affiliation_strings":["Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044760370","display_name":"Martijn van Ee","orcid":"https://orcid.org/0000-0002-7724-8990"},"institutions":[{"id":"https://openalex.org/I4210119716","display_name":"Netherlands Defence Academy","ror":"https://ror.org/02dnvjf04","country_code":"NL","type":"facility","lineage":["https://openalex.org/I4210094335","https://openalex.org/I4210119716","https://openalex.org/I4210140876"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Martijn van Ee","raw_affiliation_strings":["Netherlands Defence Academy, Den Helder, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Netherlands Defence Academy, Den Helder, The Netherlands","institution_ids":["https://openalex.org/I4210119716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102569675","display_name":"Ekin Ergen","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ekin Ergen","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089062943","display_name":"Csan\u00e1d Imreh","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":"Csan\u00e1d Imreh","raw_affiliation_strings":["University of Szeged, Szeged, Hungary"],"affiliations":[{"raw_affiliation_string":"University of Szeged, Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064823807","display_name":"Alberto Marchetti-Spaccamela","orcid":"https://orcid.org/0000-0002-7991-4416"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alberto Marchetti-Spaccamela","raw_affiliation_strings":["Universit\u00e1 di Roma \u201cLa Sapienza\u201d, Rome, Italy","Universit\u00e1 di Roma \"La Sapienza\", Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e1 di Roma \u201cLa Sapienza\u201d, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Universit\u00e1 di Roma \"La Sapienza\", Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044184077","display_name":"Leen Stougie","orcid":"https://orcid.org/0000-0001-6938-8902"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Leen Stougie","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands","Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5026347724"],"corresponding_institution_ids":["https://openalex.org/I865915315"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36918297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"69","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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.9988999962806702,"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"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/scheduling","display_name":"Scheduling (production processes)","score":0.6822999715805054},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4652999937534332},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4309999942779541},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.40450000762939453},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.39469999074935913},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3912000060081482},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.37049999833106995}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6822999715805054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6464999914169312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6456000208854675},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4309999942779541},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.40450000762939453},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34950000047683716},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3425999879837036},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29010000824928284},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2718000113964081},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2563000023365021},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00224-025-10232-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10232-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10232-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/4096436c-fae3-4752-8acf-f7bfd4144855","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/4096436c-fae3-4752-8acf-f7bfd4144855","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bosman, T, van Ee, M, Ergen, E, Imreh, C, Marchetti-Spaccamela, A, Skutella, M & Stougie, L 2025, 'Total Completion Time Scheduling Under Scenarios', Theory of Computing Systems, vol. 69, no. 4, 33, pp. 1-41. https://doi.org/10.1007/s00224-025-10232-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-05435070v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05435070","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Theory of Computing Systems, 2025, 69, ⟨10.1007/s00224-025-10232-z⟩","raw_type":"Journal articles"},{"id":"pmh:oai:research.vu.nl:openaire/4096436c-fae3-4752-8acf-f7bfd4144855","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/4096436c-fae3-4752-8acf-f7bfd4144855","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Bosman, T, van Ee, M, Ergen, E, Imreh, C, Marchetti-Spaccamela, A, Skutella, M & Stougie, L 2025, 'Total Completion Time Scheduling Under Scenarios', Theory of Computing Systems, vol. 69, no. 4, 33, pp. 1-41. https://doi.org/10.1007/s00224-025-10232-z","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00224-025-10232-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10232-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10232-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414410795.pdf"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W34185299","https://openalex.org/W1569805180","https://openalex.org/W1569990960","https://openalex.org/W1930081464","https://openalex.org/W1983916623","https://openalex.org/W1999032440","https://openalex.org/W2006049518","https://openalex.org/W2006742819","https://openalex.org/W2009976411","https://openalex.org/W2013170874","https://openalex.org/W2026900294","https://openalex.org/W2031612682","https://openalex.org/W2034689708","https://openalex.org/W2087038607","https://openalex.org/W2092438148","https://openalex.org/W2143466467","https://openalex.org/W2424274037","https://openalex.org/W2809282601","https://openalex.org/W2816659207","https://openalex.org/W3004316827","https://openalex.org/W3191776655","https://openalex.org/W4250310797","https://openalex.org/W4251616545","https://openalex.org/W4253347690","https://openalex.org/W4301808069","https://openalex.org/W4309279635","https://openalex.org/W4313442659"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Scheduling":[1],"jobs":[2,76,94],"with":[3],"given":[4,88],"processing":[5],"times":[6,106],"on":[7,160,165,174],"identical":[8,78],"parallel":[9,79],"machines":[10,80],"so":[11],"as":[12,52],"to":[13,67,77,178],"minimize":[14],"their":[15],"total":[16,104],"completion":[17,105],"time":[18],"is":[19,38,50,66],"one":[20],"of":[21,43,55,62,71,75,102,141,154,169,181],"the":[22,36,72,83,87,93,97,103,111,132,142,147,166],"most":[23],"basic":[24],"scheduling":[25,113],"problems.":[26],"We":[27,135],"study":[28],"this":[29],"classical":[30],"problem":[31,114,133],"under":[32],"uncertainty,":[33],"in":[34,96,129],"which":[35],"uncertainty":[37],"modeled":[39],"by":[40,90,121],"a":[41,48,53,56,100,122,161,175,182],"set":[42,61,74],"scenarios.":[44,109],"In":[45],"our":[46,155],"model,":[47],"scenario":[49],"defined":[51],"subset":[54],"predefined":[57],"and":[58,151],"fully":[59],"specified":[60],"jobs.":[63],"The":[64],"aim":[65],"find":[68],"an":[69,137,170],"assignment":[70],"whole":[73],"such":[81],"that":[82],"schedule,":[84,172],"obtained":[85],"for":[86],"scenarios":[89,116],"simply":[91],"skipping":[92],"not":[95],"scenario,":[98],"optimizes":[99],"function":[101],"over":[107],"all":[108],"While":[110],"underlying":[112],"without":[115],"can":[117],"be":[118],"solved":[119],"efficiently":[120],"simple":[123],"greedy":[124],"procedure":[125],"(SPT":[126],"rule),":[127],"scenarios,":[128],"general,":[130],"make":[131],"NP-hard.":[134],"paint":[136],"almost":[138],"complete":[139],"picture":[140],"evolving":[143],"complexity":[144],"landscape,":[145],"drawing":[146],"line":[148],"between":[149],"easy":[150],"hard.":[152],"One":[153],"main":[156],"algorithmic":[157],"contributions":[158],"relies":[159],"deep":[162],"structural":[163],"result":[164],"maximum":[167],"imbalance":[168],"optimal":[171],"based":[173],"subtle":[176],"connection":[177],"Hilbert":[179],"bases":[180],"related":[183],"convex":[184],"cone.":[185]},"counts_by_year":[],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}