{"id":"https://openalex.org/W2127293776","doi":"https://doi.org/10.1007/11561071_52","title":"Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays","display_name":"Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2127293776","doi":"https://doi.org/10.1007/11561071_52","mag":"2127293776"},"language":"en","primary_location":{"id":"doi:10.1007/11561071_52","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561071_52","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/A5005932160","display_name":"Aleksei V. Fishkin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Aleksei V. Fishkin","raw_affiliation_strings":["Max-Planck-Institute f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","Max Planck Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max Planck Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institute of Computer Science, University of Kiel, 24118, Kiel, Germany","Institute of Computer Science, University of Kiel, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Kiel, 24118, Kiel, Germany","institution_ids":[]},{"raw_affiliation_string":"Institute of Computer Science, University of Kiel, Kiel, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048266116","display_name":"Sergey Sevastyanov","orcid":"https://orcid.org/0000-0003-0347-1396"},"institutions":[{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Sergey V. Sevastyanov","raw_affiliation_strings":["Sobolev Institute of Mathematics, 630090, Novosibirsk, Russia","Sobolev Institute of Mathematics, Novosibirsk, Russia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sobolev Institute of Mathematics, 630090, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210096862"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics, Novosibirsk, Russia#TAB#","institution_ids":["https://openalex.org/I4210096862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047920456","display_name":"Ren\u00e9 Sitters","orcid":"https://orcid.org/0000-0002-0385-0794"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 Sitters","raw_affiliation_strings":["Max-Planck-Institute f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","Max Planck Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max Planck Institute f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.795,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.93400287,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"580","last_page":"591"},"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.9988999962806702,"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.994700014591217,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6914061903953552},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6597586870193481},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6128487586975098},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.612511157989502},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6018038392066956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5951350331306458},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5622994899749756},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4809512495994568},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42319822311401367},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41565030813217163},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3687448501586914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3234577476978302},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3025142252445221},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2800688147544861}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6914061903953552},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6597586870193481},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6128487586975098},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.612511157989502},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6018038392066956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5951350331306458},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5622994899749756},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4809512495994568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42319822311401367},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41565030813217163},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3687448501586914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3234577476978302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3025142252445221},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2800688147544861},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/11561071_52","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561071_52","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/fcf712b7-9b15-455b-8770-6846e116ef5a","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/fcf712b7-9b15-455b-8770-6846e116ef5a","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":"Fishkin, A V, Jansen, K, Sevastyanov, S V & Sitters, R A 2005, Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. in S Leonardi (ed.), Algorithms - ESA 2005 (Proceedings 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005). Lecture Notes in Computer Science, vol. 3669, Springer, Berlin, pp. 580-591. https://doi.org/10.1007/11561071_52","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:664023","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=664023","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:library.tue.nl:664023","is_oa":false,"landing_page_url":"http://repository.tue.nl/664023","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/fcf712b7-9b15-455b-8770-6846e116ef5a","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/fcf712b7-9b15-455b-8770-6846e116ef5a","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":"Algorithms - ESA 2005 (Proceedings 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005), 580 - 591","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W139407416","https://openalex.org/W964861289","https://openalex.org/W1488422606","https://openalex.org/W1739027797","https://openalex.org/W1975442866","https://openalex.org/W1996641400","https://openalex.org/W2006905044","https://openalex.org/W2011039300","https://openalex.org/W2014071862","https://openalex.org/W2058817479","https://openalex.org/W2066356146","https://openalex.org/W2074798342","https://openalex.org/W2078418199","https://openalex.org/W2084814858","https://openalex.org/W2169878774","https://openalex.org/W2170627077","https://openalex.org/W2576116471","https://openalex.org/W2808376720","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2970302286","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2142195909","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}