{"id":"https://openalex.org/W1993909624","doi":"https://doi.org/10.1016/s0167-6377(02)00179-7","title":"Optimal preemptive semi-online scheduling to minimize makespan on two related machines","display_name":"Optimal preemptive semi-online scheduling to minimize makespan on two related machines","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W1993909624","doi":"https://doi.org/10.1016/s0167-6377(02)00179-7","mag":"1993909624"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(02)00179-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00179-7","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5023269343","display_name":"Leah Epstein","orcid":"https://orcid.org/0000-0002-6761-8521"},"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":"Leah Epstein","raw_affiliation_strings":["School of Computer Science, The Interdisciplinary Center, Herzliya, Israel","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"]},{"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/A5023065140","display_name":"Lene M. Favrholdt","orcid":"https://orcid.org/0000-0003-3054-2997"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lene M. Favrholdt","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023269343"],"corresponding_institution_ids":["https://openalex.org/I138898306"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":8.2378,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.97280348,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"4","first_page":"269","last_page":"275"},"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.9994999766349792,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9937000274658203,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7835668325424194},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7223830223083496},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6920823454856873},{"id":"https://openalex.org/keywords/idle","display_name":"Idle","score":0.6791337728500366},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6510496139526367},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5619865655899048},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5579965114593506},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5114420652389526},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4643552303314209},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.44869449734687805},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3265012502670288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3047446012496948},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.27856528759002686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2000860869884491},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1361388862133026},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06967878341674805}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7835668325424194},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7223830223083496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6920823454856873},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.6791337728500366},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6510496139526367},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5619865655899048},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5579965114593506},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5114420652389526},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4643552303314209},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.44869449734687805},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3265012502670288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3047446012496948},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27856528759002686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2000860869884491},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1361388862133026},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06967878341674805},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0167-6377(02)00179-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00179-7","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:publications/5ed08980-6fcf-11db-81a9-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/5ed08980-6fcf-11db-81a9-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Epstein, L & Favrholdt, L M 2002, 'Optimal Preemptive Semi-Online Scheduling to Minimize Makespan on Two Related Machines', Operations Research Letters, vol. 30, no. 4, pp. 269-275. https://doi.org/10.1016/s0167-6377(02)00179-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.3306","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.3306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~lea/semi.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488585910","https://openalex.org/W1969305723","https://openalex.org/W1982084418","https://openalex.org/W1986282189","https://openalex.org/W1990290269","https://openalex.org/W1999476761","https://openalex.org/W2036711992","https://openalex.org/W2046608953","https://openalex.org/W2060023372","https://openalex.org/W2071788993","https://openalex.org/W2079055947","https://openalex.org/W2085716075","https://openalex.org/W2089269509","https://openalex.org/W2104680817","https://openalex.org/W2112475567","https://openalex.org/W2119226317","https://openalex.org/W2160030032","https://openalex.org/W2179639784","https://openalex.org/W6633955711"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2752015945","https://openalex.org/W2950803469","https://openalex.org/W3135987664","https://openalex.org/W2051209951","https://openalex.org/W1493790977"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}