{"id":"https://openalex.org/W2896194150","doi":"https://doi.org/10.1007/s10951-018-0588-7","title":"An approximation scheme for the bi-scenario sum of completion times trade-off problem","display_name":"An approximation scheme for the bi-scenario sum of completion times trade-off problem","publication_year":2018,"publication_date":"2018-10-19","ids":{"openalex":"https://openalex.org/W2896194150","doi":"https://doi.org/10.1007/s10951-018-0588-7","mag":"2896194150"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-018-0588-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-018-0588-7","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-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/A5083152096","display_name":"Miri Gilenson","orcid":"https://orcid.org/0000-0003-0578-9111"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Miri Gilenson","raw_affiliation_strings":["Department of Industrial Engineering and Management, Ben Gurion University, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Ben Gurion University, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077168000","display_name":"Hussein Naseraldin","orcid":null},"institutions":[{"id":"https://openalex.org/I231622532","display_name":"Braude College of Engineering Karmiel","ror":"https://ror.org/004af2v94","country_code":"IL","type":"education","lineage":["https://openalex.org/I231622532"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Hussein Naseraldin","raw_affiliation_strings":["Department of Industrial Engineering and Management, ORT Braude College of Engineering, Karmiel, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, ORT Braude College of Engineering, Karmiel, Israel","institution_ids":["https://openalex.org/I231622532"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032943144","display_name":"Liron Yedidsion","orcid":"https://orcid.org/0000-0002-4747-142X"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Liron Yedidsion","raw_affiliation_strings":["Faculty of Industrial Engineering and Management, Technion, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0002-4747-142X","affiliations":[{"raw_affiliation_string":"Faculty of Industrial Engineering and Management, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083152096"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5044,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73700581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"3","first_page":"289","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.996999979019165,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.708907961845398},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6283053755760193},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5948677659034729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5599648356437683},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5175318121910095},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46386024355888367},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.45847585797309875},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4407729506492615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31164735555648804},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.10850721597671509}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.708907961845398},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6283053755760193},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5948677659034729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5599648356437683},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5175318121910095},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46386024355888367},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.45847585797309875},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4407729506492615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31164735555648804},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.10850721597671509},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10951-018-0588-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-018-0588-7","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jsched:v:22:y:2019:i:3:d:10.1007_s10951-018-0588-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10951-018-0588-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W600489529","https://openalex.org/W1488422606","https://openalex.org/W1569805180","https://openalex.org/W1577174000","https://openalex.org/W1928381443","https://openalex.org/W1930081464","https://openalex.org/W1988328380","https://openalex.org/W1994856874","https://openalex.org/W2019167767","https://openalex.org/W2026900294","https://openalex.org/W2044420226","https://openalex.org/W2045000969","https://openalex.org/W2057882206","https://openalex.org/W2083743691","https://openalex.org/W2129174714","https://openalex.org/W2148204686","https://openalex.org/W2167597350","https://openalex.org/W2593781315","https://openalex.org/W4211017838"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2970302286","https://openalex.org/W2142195909","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2799046353","https://openalex.org/W1974309933","https://openalex.org/W2963761620","https://openalex.org/W2898780166"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}
