{"id":"https://openalex.org/W2017949344","doi":"https://doi.org/10.1007/s10107-002-0361-7","title":"Computing optimal preemptive schedules for parallel tasks: linear programming approaches","display_name":"Computing optimal preemptive schedules for parallel tasks: linear programming approaches","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W2017949344","doi":"https://doi.org/10.1007/s10107-002-0361-7","mag":"2017949344"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-002-0361-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-002-0361-7","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institut f\u00fcr Informatik und praktische Mathematik, Universit\u00e4t zu Kiel, Germany. e-mail: kj@informatik.uni-kiel.de, , , , , , DE","Institut f\u00fcr Informatik und praktische Mathematik, Universit\u00e4t zu Kiel, Germany. e-mail: kj@informatik.uni-kiel.de, DE"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und praktische Mathematik, Universit\u00e4t zu Kiel, Germany. e-mail: kj@informatik.uni-kiel.de, , , , , , DE","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik und praktische Mathematik, Universit\u00e4t zu Kiel, Germany. e-mail: kj@informatik.uni-kiel.de, DE","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033762785","display_name":"Lorant Porkolab","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lorant Porkolab","raw_affiliation_strings":["Department of Computing, Imperial College London, United Kingdom. e-mail: porkolab@doc.ic.ac.uk, , , , , , GB","Department of Computing, Imperial College London, United Kingdom. e-mail: porkolab@doc.ic.ac.uk, , GB"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, United Kingdom. e-mail: porkolab@doc.ic.ac.uk, , , , , , GB","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of Computing, Imperial College London, United Kingdom. e-mail: porkolab@doc.ic.ac.uk, , GB","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.095,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90681948,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"95","issue":"3","first_page":"617","last_page":"630"},"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.9991000294685364,"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.9969000220298767,"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.7004597783088684},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6353490352630615},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6333028078079224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5951456427574158},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5946429967880249},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5934795141220093},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5431514978408813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5388479232788086},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5329257845878601},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5151764154434204},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5013291835784912},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.44686359167099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36633533239364624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3222007751464844}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7004597783088684},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6353490352630615},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6333028078079224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5951456427574158},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5946429967880249},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5934795141220093},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5431514978408813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5388479232788086},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5329257845878601},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5151764154434204},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5013291835784912},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.44686359167099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36633533239364624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3222007751464844},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-002-0361-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-002-0361-7","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1912586891","https://openalex.org/W1966275651","https://openalex.org/W1983471329","https://openalex.org/W1995313677","https://openalex.org/W1998948241","https://openalex.org/W2011039300","https://openalex.org/W2011043187","https://openalex.org/W2042017208","https://openalex.org/W2057913648","https://openalex.org/W2058422149","https://openalex.org/W2059422698","https://openalex.org/W2059453880","https://openalex.org/W2059690437","https://openalex.org/W2073821436","https://openalex.org/W2086190489","https://openalex.org/W2089063368","https://openalex.org/W2100440346","https://openalex.org/W2101848567","https://openalex.org/W2105509427","https://openalex.org/W2110526045","https://openalex.org/W2127960094","https://openalex.org/W2134773842","https://openalex.org/W2135507920","https://openalex.org/W2736018979","https://openalex.org/W3138484722","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2794663421","https://openalex.org/W2158643246","https://openalex.org/W3116890492","https://openalex.org/W2119358936","https://openalex.org/W4367046720","https://openalex.org/W2102938079","https://openalex.org/W2098962655","https://openalex.org/W2124133342","https://openalex.org/W2782953044","https://openalex.org/W4291299514"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}