{"id":"https://openalex.org/W2607270909","doi":"https://doi.org/10.1007/s10878-017-0131-3","title":"Competitive analysis of bi-directional non-preemptive conversion","display_name":"Competitive analysis of bi-directional non-preemptive conversion","publication_year":2017,"publication_date":"2017-04-17","ids":{"openalex":"https://openalex.org/W2607270909","doi":"https://doi.org/10.1007/s10878-017-0131-3","mag":"2607270909"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-017-0131-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-017-0131-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5026890421","display_name":"G\u00fcnter Schmidt","orcid":"https://orcid.org/0000-0003-1944-0885"},"institutions":[{"id":"https://openalex.org/I157614274","display_name":"University of Cape Town","ror":"https://ror.org/03p74gp79","country_code":"ZA","type":"education","lineage":["https://openalex.org/I157614274"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE","ZA"],"is_corresponding":true,"raw_author_name":"G\u00fcnter Schmidt","raw_affiliation_strings":["Germany and University of Cape Town, Rondebosch, Cape Town, 7700, South Africa","Operations Research and Business Informatics, Saarland University, 66041, Saarbr\u00fccken, Germany","Germany and University of Cape Town, Rondebosch, South Africa","Operations Research and Business Informatics, Saarland University, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Germany and University of Cape Town, Rondebosch, Cape Town, 7700, South Africa","institution_ids":["https://openalex.org/I157614274"]},{"raw_affiliation_string":"Operations Research and Business Informatics, Saarland University, 66041, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Germany and University of Cape Town, Rondebosch, South Africa","institution_ids":["https://openalex.org/I157614274"]},{"raw_affiliation_string":"Operations Research and Business Informatics, Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026890421"],"corresponding_institution_ids":["https://openalex.org/I157614274","https://openalex.org/I91712215"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.5351,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.84925621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"34","issue":"4","first_page":"1096","last_page":"1113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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.9994000196456909,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9915000200271606,"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/theory-of-computation","display_name":"Theory of computation","score":0.7002624273300171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49249324202537537},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44046998023986816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33422860503196716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28084805607795715}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7002624273300171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49249324202537537},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44046998023986816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33422860503196716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28084805607795715}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-017-0131-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-017-0131-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0131-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-017-0131-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:pure.mpg.de:item_3166330","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0004-BEFD-A","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization","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":10,"referenced_works":["https://openalex.org/W1494101111","https://openalex.org/W1745851447","https://openalex.org/W1978416470","https://openalex.org/W1986329165","https://openalex.org/W2001747258","https://openalex.org/W2052284057","https://openalex.org/W2093226551","https://openalex.org/W2118877434","https://openalex.org/W2160509725","https://openalex.org/W4256193557"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}