{"id":"https://openalex.org/W7097478071","doi":null,"title":"FairnessinScheduling (ExtendedAbstract) MiklosAjtaiJamesAspnesyMoniNaorzYuvalRabanixLeonardJ.Schulman{","display_name":"FairnessinScheduling (ExtendedAbstract) MiklosAjtaiJamesAspnesyMoniNaorzYuvalRabanixLeonardJ.Schulman{","publication_year":2012,"publication_date":"2012-04-24","ids":{"openalex":"https://openalex.org/W7097478071"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.260","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/~aspnes/soda95-proceedings.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.49874687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9437999725341797,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9437999725341797,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.012199999764561653,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.005100000184029341,"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/online-scheduling","display_name":"online scheduling","score":0.8899999856948853},{"id":"https://openalex.org/keywords/unfairness","display_name":"unfairness","score":0.6809999942779541},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.5720000267028809},{"id":"https://openalex.org/keywords/input-distribution","display_name":"input distribution","score":0.49300000071525574},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5040000081062317}],"concepts":[{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.19869999587535858},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.19499999284744263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1906999945640564},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.1860000044107437},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.18389999866485596},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.16850000619888306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.16580000519752502},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.16410000622272491},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.16120000183582306},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.15870000422000885}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.260","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/~aspnes/soda95-proceedings.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7096712995","https://openalex.org/W7100326820","https://openalex.org/W4236693084","https://openalex.org/W7097657785","https://openalex.org/W6904046178","https://openalex.org/W7098089302","https://openalex.org/W2169145071","https://openalex.org/W7055753080","https://openalex.org/W2400622369","https://openalex.org/W2559910846"],"abstract_inverted_index":{"On-linemachineschedulinghasbeenstudiedextensively,but":[0],"thefundamentalissueoffairnessinschedulingisstillmostly":[1],"open.Inthispaperweexploretheissueinsettingswhere":[2],"therearelonglivingprocesseswhichshouldberepeatedly":[3],"scheduledforvarioustasksthroughoutthelifetimeofa":[4],"system.Foranysuchinstancewedevelopanotionof":[5],"desiredloadofaprocess,whichisafunctionofthetasksit":[6],"participatesin.Theunfairnessofasystemisthemaximum,":[7],"takenoverallprocesses,ofthedierencebetweenthedesired":[8],"loadandtheactualload.":[9],"Anexampleofsuchasettingisthecarpoolproblem":[10],"suggestedbyFaginandWilliams[17].Inthisproblem,":[11],"asetofnpeopleformacarpool.Oneachdayasubset":[12],"ofthepeoplearriveandoneofthemisdesignatedasthe":[13],"driver.Aschedulingruleisrequiredsothatthedriverwill":[14],"bedeterminedina`fair'way.":[15],"Weinvestigatethisproblemundervariousassumptions":[16],"ontheinputdistribution.Wealsoshowthatthecarpool":[17],"problemscancaptureseveralotherproblemsoffairnessin":[18],"scheduling.":[19]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-27T00:00:00"}