{"id":"https://openalex.org/W2323670826","doi":"https://doi.org/10.1109/codit.2014.6996878","title":"An improved approximation algorithm for the ancient scheduling problem with deadlines","display_name":"An improved approximation algorithm for the ancient scheduling problem with deadlines","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2323670826","doi":"https://doi.org/10.1109/codit.2014.6996878","mag":"2323670826"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2014.6996878","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108144978","display_name":"Eugene Levner","orcid":null},"institutions":[{"id":"https://openalex.org/I154488051","display_name":"Ashkelon Academic College","ror":"https://ror.org/00sfwx025","country_code":"IL","type":"education","lineage":["https://openalex.org/I154488051"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Eugene Levner","raw_affiliation_strings":["Ashkelon Academic College, School of Economics, Ashkelon, Israel"],"affiliations":[{"raw_affiliation_string":"Ashkelon Academic College, School of Economics, Ashkelon, Israel","institution_ids":["https://openalex.org/I154488051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028888072","display_name":"Amir Elalouf","orcid":"https://orcid.org/0000-0001-7950-0785"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Elalouf","raw_affiliation_strings":["Department of Management, Bar Ilan University, Ramat Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Management, Bar Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108144978"],"corresponding_institution_ids":["https://openalex.org/I154488051"],"apc_list":null,"apc_paid":null,"fwci":1.2315,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.84689085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"17","issue":null,"first_page":"113","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9959999918937683,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7665258646011353},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5988630652427673},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.59619140625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5791221857070923},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5686960816383362},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.507293164730072},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.49971771240234375},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4962490200996399},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.48820239305496216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4624145030975342},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4128727316856384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29825538396835327},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.05988967418670654}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7665258646011353},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5988630652427673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.59619140625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5791221857070923},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5686960816383362},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.507293164730072},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.49971771240234375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4962490200996399},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.48820239305496216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4624145030975342},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4128727316856384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29825538396835327},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.05988967418670654},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit.2014.6996878","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W264528716","https://openalex.org/W1988328380","https://openalex.org/W2028866289","https://openalex.org/W2059001284","https://openalex.org/W2061701207","https://openalex.org/W2065104488","https://openalex.org/W2066047491","https://openalex.org/W2067297441","https://openalex.org/W2107216979","https://openalex.org/W2130626677","https://openalex.org/W2147799577","https://openalex.org/W2401610261","https://openalex.org/W6609929780"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2962917430","https://openalex.org/W2048358792","https://openalex.org/W2028468530","https://openalex.org/W2620541949","https://openalex.org/W1903284337","https://openalex.org/W1972853793","https://openalex.org/W2399100966","https://openalex.org/W2049084621","https://openalex.org/W2009846993"],"abstract_inverted_index":{"The":[0,32,79],"aim":[1],"of":[2,17,60,76],"this":[3],"paper":[4],"is":[5],"to":[6,14,35],"develop":[7],"an":[8,26,51],"improved":[9],"polynomial-time":[10],"approximation":[11,22],"algorithm":[12,33,53,81],"belonging":[13],"the":[15,18,57,61,66,70,73,77,83],"family":[16],"fully":[19],"polynomial":[20],"time":[21],"schemes":[23],"(FPTAS),":[24],"for":[25,56,72],"ancient":[27],"scheduling":[28],"problem":[29,63],"with":[30,65],"deadlines.":[31],"permits":[34],"answer":[36],"a":[37],"question":[38],"posed":[39],"more":[40],"than":[41],"three":[42],"decades":[43],"ago":[44],"in":[45],"Gens":[46],"&":[47],"Levner":[48],"(1981):":[49],"\u201cCan":[50],"epsilon-approximation":[52],"be":[54],"found":[55],"minimization":[58],"version":[59],"job-sequencing-with-deadlines":[62],"running":[64],"same":[67],"complexity":[68],"as":[69],"algorithms":[71],"maximization":[74],"form":[75],"problem?\u201d":[78],"new":[80],"provides":[82],"positive":[84],"answer.":[85]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}