{"id":"https://openalex.org/W2127094990","doi":"https://doi.org/10.1007/3-540-48224-5_72","title":"On the Approximability of Average Completion Time Scheduling under Precedence Constraints","display_name":"On the Approximability of Average Completion Time Scheduling under Precedence Constraints","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2127094990","doi":"https://doi.org/10.1007/3-540-48224-5_72","mag":"2127094990"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_72","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_72","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/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":true,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Graz, Austria","Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, 8010 Graz, Austria and Department of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, Netherlands#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, 8010 Graz, Austria and Department of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, Netherlands#TAB#","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080746477"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.502,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.95398952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"887","last_page":"897"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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.9771999716758728,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6124887466430664},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5968391299247742},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5438327193260193},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5193658471107483},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48635631799697876},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4775969982147217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41875216364860535},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.41754212975502014},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4103662669658661},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38382241129875183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3791303038597107},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3770372271537781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29195281863212585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11948144435882568},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.05799227952957153}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6124887466430664},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5968391299247742},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5438327193260193},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5193658471107483},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48635631799697876},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4775969982147217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41875216364860535},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.41754212975502014},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4103662669658661},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38382241129875183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3791303038597107},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3770372271537781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29195281863212585},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11948144435882568},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.05799227952957153},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/3-540-48224-5_72","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_72","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/641fc330-73c2-4732-8e69-36721445e3c4","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/641fc330-73c2-4732-8e69-36721445e3c4","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":"Woeginger, G J 2001, On the approximability of average completion time scheduling under precedence constraints. in F Orejas, P G Spirakis & J Leeuwen, van (eds), Automata, languages and programming : proceedings 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Lecture Notes in Computer Science, vol. 2076, Springer, Berlin, pp. 887-897. https://doi.org/10.1007/3-540-48224-5_72","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/32c77f54-8fbe-44da-b9de-7db2005df4e3","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/32c77f54-8fbe-44da-b9de-7db2005df4e3","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:623643","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623643","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:665653","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=665653","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":"","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.111.7583","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.7583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/~gwoegi/papers/precsum.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.978","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/~gwoegi/papers/precsum.ps","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:623643","is_oa":false,"landing_page_url":"http://repository.tue.nl/623643","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:665653","is_oa":false,"landing_page_url":"http://repository.tue.nl/665653","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":"","raw_type":null},{"id":"pmh:tue:oai:pure.tue.nl:publications/641fc330-73c2-4732-8e69-36721445e3c4","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/641fc330-73c2-4732-8e69-36721445e3c4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Automata, languages and programming : proceedings 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, 887 - 897","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W179016828","https://openalex.org/W1488422606","https://openalex.org/W1569458199","https://openalex.org/W1585310225","https://openalex.org/W1992370758","https://openalex.org/W2006905044","https://openalex.org/W2034689708","https://openalex.org/W2127277545","https://openalex.org/W2130418601","https://openalex.org/W2148204686","https://openalex.org/W2150446509","https://openalex.org/W2159152246"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W2151412766","https://openalex.org/W2398738602","https://openalex.org/W2965171438","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}