{"id":"https://openalex.org/W2172122411","doi":"https://doi.org/10.1016/s0166-218x(00)00375-9","title":"Linear time approximation scheme for the multiprocessor open shop problem","display_name":"Linear time approximation scheme for the multiprocessor open shop problem","publication_year":2001,"publication_date":"2001-10-01","ids":{"openalex":"https://openalex.org/W2172122411","doi":"https://doi.org/10.1016/s0166-218x(00)00375-9","mag":"2172122411"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(00)00375-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00375-9","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/bc42f1fe-a412-4818-8e92-a8f79597e802","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111442436","display_name":"S. V. Sevastianov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"S.V. Sevastianov","raw_affiliation_strings":["Sobolev Institute of Mathematics, Novosibirsk-90 630090, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sobolev Institute of Mathematics, Novosibirsk-90 630090, Russia","institution_ids":["https://openalex.org/I4210096862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G.J. Woeginger","raw_affiliation_strings":["Institut f\u00fcr Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111442436"],"corresponding_institution_ids":["https://openalex.org/I4210096862"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":1.0858,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.82399299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"114","issue":"1-3","first_page":"273","last_page":"288"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7754560112953186},{"id":"https://openalex.org/keywords/open-shop","display_name":"Open shop","score":0.7535368204116821},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6982097029685974},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6735425591468811},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5781323313713074},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5122384428977966},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5108232498168945},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4766469895839691},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.43365049362182617},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4257259964942932},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4249614477157593},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36693817377090454},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.22058498859405518},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.17786023020744324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16907697916030884},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.08817750215530396},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07043972611427307}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7754560112953186},{"id":"https://openalex.org/C2776484797","wikidata":"https://www.wikidata.org/wiki/Q7096412","display_name":"Open shop","level":5,"score":0.7535368204116821},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6982097029685974},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6735425591468811},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5781323313713074},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5122384428977966},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5108232498168945},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4766469895839691},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.43365049362182617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4257259964942932},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4249614477157593},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36693817377090454},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.22058498859405518},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.17786023020744324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16907697916030884},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08817750215530396},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07043972611427307},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1016/s0166-218x(00)00375-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00375-9","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sevastianov, S V & Woeginger, G J 2001, 'Linear time approximation scheme for the multiprocessor open shop problem', Discrete Applied Mathematics, vol. 114, no. 1-3, pp. 273-288. https://doi.org/10.1016/S0166-218X(00)00375-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:openaire/bc42f1fe-a412-4818-8e92-a8f79597e802","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/bc42f1fe-a412-4818-8e92-a8f79597e802","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sevastianov, S V & Woeginger, G 2001, 'Linear time approximation scheme for the multiprocessor open shop problem', Discrete applied mathematics, vol. 114, pp. 273-288. https://doi.org/10.1016/S0166-218X(00)00375-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:645271","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=645271","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0166-218X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:645271","is_oa":false,"landing_page_url":"http://repository.tue.nl/645271","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0166-218X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:ris.utwente.nl:publications/bc42f1fe-a412-4818-8e92-a8f79597e802","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Applied Mathematics, 114(1-3), 273 - 288. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/bc42f1fe-a412-4818-8e92-a8f79597e802","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/bc42f1fe-a412-4818-8e92-a8f79597e802","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sevastianov, S V & Woeginger, G 2001, 'Linear time approximation scheme for the multiprocessor open shop problem', Discrete applied mathematics, vol. 114, pp. 273-288. https://doi.org/10.1016/S0166-218X(00)00375-9","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W107160726","https://openalex.org/W964861289","https://openalex.org/W1563042316","https://openalex.org/W2007315235","https://openalex.org/W2043366332","https://openalex.org/W2058981679","https://openalex.org/W2576116471","https://openalex.org/W2808376720"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W2804958010","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2113869348"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}