{"id":"https://openalex.org/W2109073642","doi":"https://doi.org/10.1007/bf02684434","title":"Unit-time scheduling problems with time dependent resources","display_name":"Unit-time scheduling problems with time dependent resources","publication_year":1997,"publication_date":"1997-06-01","ids":{"openalex":"https://openalex.org/W2109073642","doi":"https://doi.org/10.1007/bf02684434","mag":"2109073642"},"language":"en","primary_location":{"id":"doi:10.1007/bf02684434","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02684434","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","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/A5078201083","display_name":"Thomas Tautenhahn","orcid":null},"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":"T. Tautenhahn","raw_affiliation_strings":["Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Steyrergasse 30, A-8010, Graz","Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Graz"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Steyrergasse 30, A-8010, Graz","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Graz","institution_ids":["https://openalex.org/I4092182"]}]},{"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, Technische Universit\u00e4t Graz, Steyrergasse 30, A-8010, Graz","Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Graz"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Steyrergasse 30, A-8010, Graz","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, Technische Universit\u00e4t Graz, Graz","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078201083"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.25736434,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"58","issue":"2","first_page":"97","last_page":"111"},"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.9986000061035156,"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.9912999868392944,"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/time-complexity","display_name":"Time complexity","score":0.7194114923477173},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.656999409198761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6132526397705078},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5349926352500916},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5210204124450684},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4907742440700531},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4776921570301056},{"id":"https://openalex.org/keywords/open-shop","display_name":"Open shop","score":0.43555986881256104},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3708842694759369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28609681129455566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21364077925682068},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.2130947709083557},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.0666661262512207}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7194114923477173},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.656999409198761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6132526397705078},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5349926352500916},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5210204124450684},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4907742440700531},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4776921570301056},{"id":"https://openalex.org/C2776484797","wikidata":"https://www.wikidata.org/wiki/Q7096412","display_name":"Open shop","level":5,"score":0.43555986881256104},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3708842694759369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28609681129455566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21364077925682068},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.2130947709083557},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0666661262512207},{"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/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/bf02684434","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02684434","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/23118624-5dc8-4a14-8493-e72483c58b24","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/23118624-5dc8-4a14-8493-e72483c58b24","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":"Tautenhahn, T & Woeginger, G 1997, 'Unit-time scheduling problems with time dependent resources', Computing, vol. 58, no. 2, pp. 97-111. https://doi.org/10.1007/BF02684434","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:683808","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=683808","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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:0010-485X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:683808","is_oa":false,"landing_page_url":"http://repository.tue.nl/683808","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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:0010-485X","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/23118624-5dc8-4a14-8493-e72483c58b24","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/23118624-5dc8-4a14-8493-e72483c58b24","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":"Computing, 58(2), 97 - 111. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1521979570","https://openalex.org/W1559709919","https://openalex.org/W2031705523","https://openalex.org/W2065394292","https://openalex.org/W2076906849","https://openalex.org/W2114616381","https://openalex.org/W2166566648","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3094194260","https://openalex.org/W2034689541","https://openalex.org/W2045363538","https://openalex.org/W3173048457","https://openalex.org/W2392498686","https://openalex.org/W4205832532","https://openalex.org/W2011111461","https://openalex.org/W4205247740","https://openalex.org/W2003214227","https://openalex.org/W1978898155"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":18},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}