{"id":"https://openalex.org/W2028821829","doi":"https://doi.org/10.1007/s00236-004-0145-z","title":"Approximation schemes for the Min-Max Starting Time Problem","display_name":"Approximation schemes for the Min-Max Starting Time Problem","publication_year":2004,"publication_date":"2004-08-04","ids":{"openalex":"https://openalex.org/W2028821829","doi":"https://doi.org/10.1007/s00236-004-0145-z","mag":"2028821829"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-004-0145-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-004-0145-z","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"Acta Informatica","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/A5023269343","display_name":"Leah Epstein","orcid":"https://orcid.org/0000-0002-6761-8521"},"institutions":[{"id":"https://openalex.org/I138898306","display_name":"Reichman University","ror":"https://ror.org/01px5cv07","country_code":"IL","type":"education","lineage":["https://openalex.org/I138898306"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Leah Epstein","raw_affiliation_strings":["School of Computer Science, The Interdisciplinary Center, Herzliya, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The Interdisciplinary Center, Herzliya, Israel","institution_ids":["https://openalex.org/I138898306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080737186","display_name":"Tamir Tassa","orcid":"https://orcid.org/0000-0001-9681-8824"},"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"]},{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]},{"id":"https://openalex.org/I204136569","display_name":"The Open University","ror":"https://ror.org/05mzfcs16","country_code":"GB","type":"education","lineage":["https://openalex.org/I204136569"]}],"countries":["GB","IL"],"is_corresponding":false,"raw_author_name":"Tamir Tassa","raw_affiliation_strings":["Department of Computer Science, Ben Gurion University, Beer Sheva, Israel","Department of Mathematics and Computer Science, The Open University, Ramat Aviv, Tel Aviv"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben Gurion University, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University, Ramat Aviv, Tel Aviv","institution_ids":["https://openalex.org/I164950643","https://openalex.org/I204136569"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023269343"],"corresponding_institution_ids":["https://openalex.org/I138898306"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.16601695,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"40","issue":"9","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":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.9962000250816345,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9944000244140625,"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/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7953232526779175},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7840578556060791},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.743109405040741},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6961402893066406},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6604421138763428},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6246278882026672},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5870267152786255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5659993290901184},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.5177040100097656},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5142592787742615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.494750440120697},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46907466650009155},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4557762145996094},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4531446397304535},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43697160482406616},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42651963233947754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39702779054641724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2739517092704773},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12755516171455383}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7953232526779175},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7840578556060791},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.743109405040741},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6961402893066406},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6604421138763428},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6246278882026672},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5870267152786255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5659993290901184},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5177040100097656},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5142592787742615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.494750440120697},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46907466650009155},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4557762145996094},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4531446397304535},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43697160482406616},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42651963233947754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39702779054641724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2739517092704773},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12755516171455383},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00236-004-0145-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-004-0145-z","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1538183795","https://openalex.org/W1977276352","https://openalex.org/W1992734168","https://openalex.org/W2006905044","https://openalex.org/W2014071862","https://openalex.org/W2047837328","https://openalex.org/W2067297441","https://openalex.org/W2089269509","https://openalex.org/W2093979815","https://openalex.org/W2103811745","https://openalex.org/W2104680817","https://openalex.org/W2150446509","https://openalex.org/W2156222606","https://openalex.org/W2179639784","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2059001284","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2032550399","https://openalex.org/W2098281589","https://openalex.org/W2057791178","https://openalex.org/W2970302286","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}