{"id":"https://openalex.org/W2317082574","doi":"https://doi.org/10.1051/ro/2016021","title":"Improving the solution complexity of the scheduling problem with deadlines: A general technique","display_name":"Improving the solution complexity of the scheduling problem with deadlines: A general technique","publication_year":2016,"publication_date":"2016-02-26","ids":{"openalex":"https://openalex.org/W2317082574","doi":"https://doi.org/10.1051/ro/2016021","mag":"2317082574"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2016021","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2016021","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro/2016021.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["Bar Ilan University, Ramat Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","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":false,"raw_author_name":"Eugene Levner","raw_affiliation_strings":["Ashkelon Academic College, Ashkelon, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ashkelon Academic College, Ashkelon, Israel","institution_ids":["https://openalex.org/I154488051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.02161232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"50","issue":"4-5","first_page":"681","last_page":"687"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9970999956130981,"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.9937000274658203,"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/time-complexity","display_name":"Time complexity","score":0.5998702049255371},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5917773842811584},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5729668736457825},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5596470832824707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5496746301651001},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5322543978691101},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5065528154373169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4755370616912842},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4205549657344818},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.41536611318588257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.390293151140213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33769309520721436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2933971881866455},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.08585411310195923},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05965256690979004}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5998702049255371},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5917773842811584},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5729668736457825},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5596470832824707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5496746301651001},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5322543978691101},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5065528154373169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4755370616912842},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4205549657344818},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.41536611318588257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.390293151140213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33769309520721436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2933971881866455},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.08585411310195923},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05965256690979004},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2016021","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2016021","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2016__50_4-5_681_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2016021/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2016021.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2016__50_4-5_681_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2016021/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2016021.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2317082574.pdf","grobid_xml":"https://content.openalex.org/works/W2317082574.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W264528716","https://openalex.org/W1965928330","https://openalex.org/W1988328380","https://openalex.org/W2011039300","https://openalex.org/W2014687183","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"],"related_works":["https://openalex.org/W2520902986","https://openalex.org/W2006623329","https://openalex.org/W2049884448","https://openalex.org/W1602329537","https://openalex.org/W2368250618","https://openalex.org/W1993080431","https://openalex.org/W2740635957","https://openalex.org/W2272917567","https://openalex.org/W2380248554","https://openalex.org/W2139090343"],"abstract_inverted_index":{"The":[0],"aim":[1],"of":[2,16,27,73,89],"this":[3],"paper":[4],"is":[5],"to":[6,13,39],"develop":[7],"improved":[8],"polynomial-time":[9],"approximation":[10,21],"algorithms":[11,84],"belonging":[12],"the":[14,17,32,70,74,79,83,86,90],"family":[15],"fully":[18],"polynomial":[19],"time":[20],"schemes":[22],"(FPTAS)":[23],"for":[24,69,85],"a":[25,36,40],"group":[26],"scheduling":[28],"problems.":[29],"In":[30],"particular,":[31],"new":[33],"technique":[34],"provides":[35],"positive":[37],"answer":[38],"question":[41],"posed":[42],"more":[43],"than":[44],"three":[45],"decades":[46],"ago":[47],"by":[48],"Gens":[49,53],"and":[50,54],"Levner":[51],"[G.V.":[52],"E.V.":[55],"Levner,":[56],"Discrete":[57],"Appl.":[58],"Math.":[59],"3":[60],"(1981)":[61],"313\u2013318]:":[62],"\u201cCan":[63],"an":[64],"epsilon-approximation":[65],"algorithm":[66],"be":[67],"found":[68],"minimization":[71],"version":[72],"job-sequencing-with-deadlines":[75],"problem":[76],"running":[77],"with":[78],"same":[80],"complexity":[81],"as":[82],"maximization":[87],"form":[88],"problem?\u201d":[91]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}