{"id":"https://openalex.org/W1581923154","doi":"https://doi.org/10.1007/978-3-540-87744-8_63","title":"Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times \u2013 A Polymatroid Optimization Approach","display_name":"Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times \u2013 A Polymatroid Optimization Approach","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1581923154","doi":"https://doi.org/10.1007/978-3-540-87744-8_63","mag":"1581923154"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-87744-8_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-87744-8_63","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/A5091211971","display_name":"Natalia V. Shakhlevich","orcid":"https://orcid.org/0000-0002-5225-4008"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Natalia V. Shakhlevich","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, U.K","School of Computing, University of Leeds, Leeds, U.K. LS2 9JT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, U.K","institution_ids":["https://openalex.org/I130828816"]},{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, U.K. LS2 9JT","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579, Japan","Graduate School of Information Sciences, Tohoku University, Sendai, Japan 980-8579#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579, Japan","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Graduate School of Information Sciences, Tohoku University, Sendai, Japan 980-8579#TAB#","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049506022","display_name":"Vitaly A. Strusevich","orcid":"https://orcid.org/0000-0002-4602-8573"},"institutions":[{"id":"https://openalex.org/I55060895","display_name":"University of Greenwich","ror":"https://ror.org/00bmj0a71","country_code":"GB","type":"education","lineage":["https://openalex.org/I55060895"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vitaly A. Strusevich","raw_affiliation_strings":["Department of Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, London, SE10 9LS, U.K","Department of Mathematical Sciences, University of Greenwich, London, U.K. SE10 9LS#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, London, SE10 9LS, U.K","institution_ids":["https://openalex.org/I55060895"]},{"raw_affiliation_string":"Department of Mathematical Sciences, University of Greenwich, London, U.K. SE10 9LS#TAB#","institution_ids":["https://openalex.org/I55060895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2546,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.3776402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"756","last_page":"767"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.7435822486877441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.713180422782898},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6715355515480042},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.49094322323799133},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4538912773132324},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44353312253952026},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4323636591434479},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.41417208313941956},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.41333815455436707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4080784320831299},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3608257472515106},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3487696945667267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22676455974578857},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08558547496795654}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.7435822486877441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.713180422782898},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6715355515480042},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.49094322323799133},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4538912773132324},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44353312253952026},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4323636591434479},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.41417208313941956},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.41333815455436707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4080784320831299},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3608257472515106},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3487696945667267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22676455974578857},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08558547496795654},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-87744-8_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-87744-8_63","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:eprints.whiterose.ac.uk:5397","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Book Section"},{"id":"pmh:oai:gala.gre.ac.uk:1214","is_oa":false,"landing_page_url":"http://gala.gre.ac.uk/id/eprint/1214/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401244","display_name":"Greenwich Academic Literature Archive (University of Greenwich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55060895","host_organization_name":"University of Greenwich","host_organization_lineage":["https://openalex.org/I55060895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1576820654","https://openalex.org/W1975678202","https://openalex.org/W1980289219","https://openalex.org/W1985907895","https://openalex.org/W1990176814","https://openalex.org/W2002683979","https://openalex.org/W2003879538","https://openalex.org/W2013469283","https://openalex.org/W2015790145","https://openalex.org/W2020006381","https://openalex.org/W2056991815","https://openalex.org/W2057412510","https://openalex.org/W2058817479","https://openalex.org/W2072938341","https://openalex.org/W2073821436","https://openalex.org/W2102771587","https://openalex.org/W2104988268","https://openalex.org/W2117135110","https://openalex.org/W2126734353","https://openalex.org/W2129875250","https://openalex.org/W2157503827","https://openalex.org/W2406761071","https://openalex.org/W4234582748"],"related_works":["https://openalex.org/W2245286458","https://openalex.org/W2956094179","https://openalex.org/W2106332846","https://openalex.org/W27741389","https://openalex.org/W2172075652","https://openalex.org/W2545511463","https://openalex.org/W2541348386","https://openalex.org/W2390610159","https://openalex.org/W2468395309","https://openalex.org/W2369829641"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}