{"id":"https://openalex.org/W3137060907","doi":"https://doi.org/10.1137/s0895480199326104","title":"Better Approximation Guarantees for Job-Shop Scheduling","display_name":"Better Approximation Guarantees for Job-Shop Scheduling","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W3137060907","doi":"https://doi.org/10.1137/s0895480199326104","mag":"3137060907"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480199326104","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199326104","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5029293569","display_name":"Leslie Ann Goldberg","orcid":"https://orcid.org/0000-0003-1879-6089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leslie Ann Goldberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063801356","display_name":"Mike Paterson","orcid":"https://orcid.org/0000-0003-0426-3468"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mike Paterson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014577367","display_name":"Elizabeth Sweedyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elizabeth Sweedyk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6511,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.92345776,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"1","first_page":"67","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9987000226974487,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7980872392654419},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.567680835723877},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5500003695487976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5142475962638855},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4870922565460205},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44263461232185364},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4236927330493927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3807218670845032},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3587428331375122},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34754490852355957}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7980872392654419},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.567680835723877},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5500003695487976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5142475962638855},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4870922565460205},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44263461232185364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4236927330493927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3807218670845032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3587428331375122},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34754490852355957},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"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.1137/s0895480199326104","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480199326104","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1991124379","https://openalex.org/W2007315235","https://openalex.org/W2022392080","https://openalex.org/W2028457507","https://openalex.org/W2063844956","https://openalex.org/W2071306171","https://openalex.org/W2084427019","https://openalex.org/W2128452148","https://openalex.org/W2130272456","https://openalex.org/W3015891365","https://openalex.org/W4212875334"],"related_works":["https://openalex.org/W2740635957","https://openalex.org/W2089406119","https://openalex.org/W2081848918","https://openalex.org/W2014071862","https://openalex.org/W2188553320","https://openalex.org/W1572330396","https://openalex.org/W2272917567","https://openalex.org/W2073617864","https://openalex.org/W2402412765","https://openalex.org/W2035743284"],"abstract_inverted_index":{"Job-shop":[0],"scheduling":[1],"is":[2],"a":[3,22],"classical":[4],"NP-hard":[5,42,74],"problem.":[6],"Shmoys,":[7],"Stein,":[8],"and":[9,35,60],"Wein":[10],"presented":[11],"the":[12,29,50],"first":[13],"polynomial-time":[14],"approximation":[15,25,30,70],"algorithm":[16],"for":[17,39,72],"this":[18,46],"problem":[19,47],"that":[20],"has":[21],"good":[23],"(polylogarithmic)":[24],"guarantee.":[26],"We":[27,63],"improve":[28],"guarantee":[31],"of":[32,45],"their":[33],"work":[34,57],"present":[36,65],"further":[37],"improvements":[38],"some":[40,73],"important":[41],"special":[43,75],"cases":[44],"(e.g.,":[48],"in":[49],"preemptive":[51],"case":[52],"where":[53],"machines":[54],"can":[55],"suspend":[56],"on":[58],"operations":[59],"later":[61],"resume).":[62],"also":[64],"NC":[66],"algorithms":[67],"with":[68],"improved":[69],"guarantees":[71],"cases.":[76]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}