{"id":"https://openalex.org/W2909709363","doi":"https://doi.org/10.1007/s10878-019-00381-6","title":"Online interval scheduling on two related machines: the power of lookahead","display_name":"Online interval scheduling on two related machines: the power of lookahead","publication_year":2019,"publication_date":"2019-01-09","ids":{"openalex":"https://openalex.org/W2909709363","doi":"https://doi.org/10.1007/s10878-019-00381-6","mag":"2909709363"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-019-00381-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-019-00381-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-019-00381-6.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-019-00381-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070038804","display_name":"Nicolas Pinson","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Pinson","raw_affiliation_strings":["ENS-Lyon, Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENS-Lyon, Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Frits C. R. Spieksma","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-2547-3782","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052356379"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.4678,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69164099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"1","first_page":"224","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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.9983000159263611,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9965999722480774,"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/computer-science","display_name":"Computer science","score":0.6916317939758301},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6823676824569702},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6254532933235168},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5569528937339783},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5082561373710632},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4912850260734558},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.48536670207977295},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47127148509025574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4213276505470276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34941327571868896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27893608808517456},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2072281837463379}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6916317939758301},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6823676824569702},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6254532933235168},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5569528937339783},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5082561373710632},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4912850260734558},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.48536670207977295},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47127148509025574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4213276505470276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34941327571868896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27893608808517456},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2072281837463379},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s10878-019-00381-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-019-00381-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-019-00381-6.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/a6ee0e94-a517-454f-b38a-578176ab5f4b","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a6ee0e94-a517-454f-b38a-578176ab5f4b","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pinson, N & Spieksma, F C R 2019, 'Online interval scheduling on two related machines : the power of lookahead', Journal of Combinatorial Optimization, vol. 38, no. 1, pp. 224-253. https://doi.org/10.1007/s10878-019-00381-6","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/651237","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/651237","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal Of Combinatorial Optimization, vol. 38 (1), (224-253)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a6ee0e94-a517-454f-b38a-578176ab5f4b","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a6ee0e94-a517-454f-b38a-578176ab5f4b","pdf_url":"https://research.tue.nl/nl/publications/a6ee0e94-a517-454f-b38a-578176ab5f4b","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 38(1), 224 - 253. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:908127","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=908127","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-019-00381-6","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-019-00381-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:library.tue.nl:908127","is_oa":false,"landing_page_url":"http://repository.tue.nl/908127","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"}],"best_oa_location":{"id":"doi:10.1007/s10878-019-00381-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-019-00381-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-019-00381-6.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6200000047683716,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321651","display_name":"Technische Universiteit Eindhoven","ror":"https://ror.org/02c2kyt77"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2909709363.pdf","grobid_xml":"https://content.openalex.org/works/W2909709363.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W186322937","https://openalex.org/W622298118","https://openalex.org/W1825385201","https://openalex.org/W1980135493","https://openalex.org/W1997595976","https://openalex.org/W1999560225","https://openalex.org/W2019355540","https://openalex.org/W2022187611","https://openalex.org/W2032691644","https://openalex.org/W2046446291","https://openalex.org/W2055364146","https://openalex.org/W2058681277","https://openalex.org/W2072356737","https://openalex.org/W2089078077","https://openalex.org/W2094561371","https://openalex.org/W2095781441","https://openalex.org/W2110171203","https://openalex.org/W2136149017","https://openalex.org/W2136848105","https://openalex.org/W2138081211","https://openalex.org/W2179639784","https://openalex.org/W2249768568","https://openalex.org/W2343981918","https://openalex.org/W2592843708","https://openalex.org/W2754548199","https://openalex.org/W3122013344","https://openalex.org/W3122778354","https://openalex.org/W4212970931"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W1908901187","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W2797898895","https://openalex.org/W2016555341","https://openalex.org/W4390203503"],"abstract_inverted_index":{"We":[0,131],"consider":[1,141],"an":[2,52,95,100,128,142],"online":[3,101,129],"interval":[4],"scheduling":[5],"problem":[6,126],"on":[7,145],"two":[8,89,109],"related":[9],"machines.":[10],"If":[11],"one":[12],"machine":[13],"is":[14,44,59,94,121],"at":[15,74],"least":[16],"as":[17,19,21],"twice":[18],"fast":[20],"the":[22,27,32,57,79,88,105,108,125],"other":[23],"machine,":[24],"we":[25,84,113],"say":[26],"machines":[28,33,90,110],"are":[29,34,91,111],"distinct;":[30],"otherwise":[31],"said":[35],"to":[36,60,103,123,135],"be":[37],"similar.":[38],"Each":[39],"job":[40,71],"$$j":[41],"\\in":[42],"J$$":[43],"characterized":[45],"by":[46],"a":[47,65],"length":[48],"$$p_j$$":[49],",":[50],"and":[51,140],"arrival":[53,76],"time":[54],"$$t_j$$":[55],";":[56],"question":[58],"determine":[61],"whether":[62],"there":[63,93],"exists":[64],"feasible":[66],"schedule":[67],"such":[68],"that":[69,86,115],"each":[70],"starts":[72],"processing":[73],"its":[75],"time.":[77,149],"For":[78],"case":[80],"of":[81,97,119],"unit-length":[82],"jobs,":[83],"prove":[85],"when":[87],"distinct,":[92],"amount":[96,118],"lookahead":[98,120],"allowing":[99],"algorithm":[102],"solve":[104,124],"problem.":[106],"When":[107],"similar,":[112],"show":[114],"no":[116],"finite":[117],"sufficient":[122],"in":[127],"fashion.":[130],"extend":[132],"these":[133],"results":[134],"jobs":[136],"having":[137],"arbitrary":[138],"lengths,":[139],"extension":[143],"focused":[144],"minimizing":[146],"total":[147],"waiting":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}