{"id":"https://openalex.org/W2944906438","doi":"https://doi.org/10.1007/s00453-005-1171-0","title":"Minimizing Makespan and Preemption Costs on a System of Uniform Machines","display_name":"Minimizing Makespan and Preemption Costs on a System of Uniform Machines","publication_year":2005,"publication_date":"2005-05-25","ids":{"openalex":"https://openalex.org/W2944906438","doi":"https://doi.org/10.1007/s00453-005-1171-0","mag":"2944906438"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-005-1171-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-005-1171-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5061815610","display_name":"Hadas Shachnai","orcid":"https://orcid.org/0000-0002-6645-4350"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Hadas Shachnai","raw_affiliation_strings":["Computer Science Department, The Technion, Haifa 32000, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, The Technion, Haifa 32000, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084411441","display_name":"Tami Tamir","orcid":"https://orcid.org/0000-0002-8409-562X"},"institutions":[{"id":"https://openalex.org/I138898306","display_name":"Reichman University","ror":"https://ror.org/01px5cv07","country_code":"IL","type":"education","lineage":["https://openalex.org/I138898306"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Tami Tamir","raw_affiliation_strings":["School of Computer Science, The Interdisciplinary Center, Herzliya, Israel"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, The Interdisciplinary Center, Herzliya, Israel","institution_ids":["https://openalex.org/I138898306"]}]},{"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/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Faculty of Electrical Engineering, Mathematics & Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Mathematics & Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061815610","https://openalex.org/A5080746477","https://openalex.org/A5084411441"],"corresponding_institution_ids":["https://openalex.org/I138898306","https://openalex.org/I174306211","https://openalex.org/I94624287"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.442,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.9259594,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"42","issue":"3-4","first_page":"309","last_page":"334"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9922999739646912,"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/preemption","display_name":"Preemption","score":0.8387718200683594},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6913752555847168},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6566272974014282},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.547950029373169},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5437853932380676},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.520564615726471},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4989352226257324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.449716180562973},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43364909291267395},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4256877601146698},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.3168033957481384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2930125892162323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2920383810997009}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8387718200683594},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6913752555847168},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6566272974014282},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.547950029373169},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5437853932380676},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.520564615726471},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4989352226257324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.449716180562973},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43364909291267395},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4256877601146698},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.3168033957481384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2930125892162323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2920383810997009},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-005-1171-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-005-1171-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/390852a8-e452-427c-94b1-8fb7ea401e12","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/390852a8-e452-427c-94b1-8fb7ea401e12","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":"Shachnai, H, Tamir, T & Woeginger, G J 2005, 'Minimizing makespan and preemption costs on a system of uniform machines', Algorithmica, vol. 42, no. 3-4, pp. 309-334. https://doi.org/10.1007/s00453-005-1171-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/763e2fb3-dcda-414b-ba32-10f4cc259774","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/763e2fb3-dcda-414b-ba32-10f4cc259774","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":"Shachnai, H, Tamir, T & Woeginger, G 2005, 'Minimizing Makespan and Preemption Costs on a System of Uniform Machines', Algorithmica, vol. 42, no. 3-4, pp. 309-334. https://doi.org/10.1007/s00453-005-1171-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/390852a8-e452-427c-94b1-8fb7ea401e12","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/390852a8-e452-427c-94b1-8fb7ea401e12","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":"Algorithmica, 42(3-4), 309 - 334. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1769185087","https://openalex.org/W1971930430","https://openalex.org/W1978732961","https://openalex.org/W1992200688","https://openalex.org/W2011039300","https://openalex.org/W2013198217","https://openalex.org/W2014071862","https://openalex.org/W2036711992","https://openalex.org/W2058817479","https://openalex.org/W2058981679","https://openalex.org/W2073821436","https://openalex.org/W2093979815","https://openalex.org/W2101848567","https://openalex.org/W2142258482","https://openalex.org/W2142932691","https://openalex.org/W2166185745","https://openalex.org/W2476096155","https://openalex.org/W2576116471","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942","https://openalex.org/W142012776","https://openalex.org/W1640420690","https://openalex.org/W2098365734","https://openalex.org/W4239547604","https://openalex.org/W2563053295","https://openalex.org/W2012280197","https://openalex.org/W2698227159"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}