{"id":"https://openalex.org/W7146956355","doi":"https://doi.org/10.48550/arxiv.2603.28800","title":"Scheduling with Time Dependent Utilities: Fairness and Efficiency","display_name":"Scheduling with Time Dependent Utilities: Fairness and Efficiency","publication_year":2026,"publication_date":"2026-03-26","ids":{"openalex":"https://openalex.org/W7146956355","doi":"https://doi.org/10.48550/arxiv.2603.28800"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.28800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.28800","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035123646","display_name":"Gaia Nicosia","orcid":"https://orcid.org/0000-0003-4043-2812"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicosia, Gaia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132713890","display_name":"Andrea Pacifici","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pacifici, Andrea","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069744603","display_name":"Ulrich Pferschy","orcid":"https://orcid.org/0000-0001-8881-1497"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pferschy, Ulrich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.7128000259399414,"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.7128000259399414,"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.1834000051021576,"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.02070000022649765,"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.6291999816894531},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5236999988555908},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5023000240325928},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4740000069141388},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4607999920845032},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45320001244544983},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4002000093460083},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.38510000705718994}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6545000076293945},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6291999816894531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5598999857902527},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5236999988555908},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4740000069141388},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45320001244544983},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4002000093460083},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.38510000705718994},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.30730000138282776},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.28130000829696655},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25940001010894775},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.28800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.28800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5077396035194397}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"new":[1,184],"class":[2],"of":[3,127,134,173,207],"multi":[4,252],"agent":[5,21,167,253],"single":[6,104,166],"machine":[7],"scheduling":[8,250],"problems":[9],"is":[10,15,136],"introduced,":[11],"where":[12,131,142,199,221],"each":[13],"job":[14,185],"associated":[16],"with":[17,22,83,189],"a":[18,23,34,63,103,165,183,217,222,227,239],"self":[19],"interested":[20],"utility":[24,41,144,177,193,233],"function":[25],"decreasing":[26],"in":[27,178,262],"completion":[28],"time.":[29],"We":[30,45,138],"aim":[31],"to":[32,67,186,196,225,249],"achieve":[33],"fair":[35,210,240],"solution":[36,52,241],"by":[37,231],"maximizing":[38],"the":[39,47,58,69,124,132,153,171,179,190,205,208,236,243],"minimum":[40,72],"across":[42],"all":[43,112,118],"agents.":[44],"study":[46,123],"problem's":[48],"complexity":[49],"and":[50,85,108,255],"propose":[51],"methods":[53],"for":[54,94,102,242],"several":[55],"variants.":[56],"For":[57,117],"general":[59],"case,":[60],"we":[61,121,169,215],"present":[62],"binary":[64],"search":[65],"procedure":[66],"find":[68],"largest":[70],"possible":[71,192],"utility,":[73],"as":[74,76],"well":[75],"an":[77],"exact":[78],"greedy":[79],"based":[80],"alternative.":[81],"Variants":[82],"release":[84,96,105],"due":[86],"dates":[87],"are":[88,162,212],"analyzed,":[89],"showing":[90],"strong":[91],"NP":[92,100],"hardness":[93,101],"arbitrary":[95],"dates,":[97],"but":[98],"weak":[99],"date":[106],"job,":[107],"polynomial":[109],"solvability":[110],"when":[111,158],"jobs":[113],"share":[114],"processing":[115],"times.":[116],"these":[119],"cases":[120],"also":[122,139],"corresponding":[125],"problem":[126],"finding":[128],"efficient":[129],"solutions":[130],"sum":[133],"utilities":[135,206],"maximized.":[137],"examine":[140],"settings":[141],"linear":[143],"functions":[145,234],"can":[146],"be":[147,187],"adjusted":[148],"within":[149],"budget":[150],"constraints,":[151],"exploring":[152],"impact":[154],"on":[155,204],"optimal":[156],"schedules":[157],"intercepts":[159],"or":[160],"slopes":[161],"modified.":[163],"From":[164],"perspective,":[168],"investigate":[170],"effect":[172],"improving":[174],"one":[175],"agent's":[176],"overall":[180],"solution.":[181],"Adding":[182],"inserted":[188],"best":[191],"gives":[194],"rise":[195],"rescheduling":[197],"problems,":[198],"different":[200],"lower":[201],"bounds":[202],"depending":[203],"original":[209],"schedule":[211,230],"imposed.":[213],"Finally,":[214],"consider":[216],"bi":[218],"level":[219],"setting":[220],"leader":[223],"wants":[224],"enforce":[226],"certain":[228],"target":[229],"modifying":[232],"while":[235],"follower":[237],"computes":[238],"modified":[244],"instance.":[245],"Our":[246],"work":[247],"contributes":[248],"theory,":[251],"systems,":[254],"algorithmic":[256],"fairness,":[257],"highlighting":[258],"fairness":[259],"oriented":[260],"objectives":[261],"competitive":[263],"scheduling.":[264]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-02T00:00:00"}