{"id":"https://openalex.org/W2038990377","doi":"https://doi.org/10.1137/s0895480196296823","title":"A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine","display_name":"A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2038990377","doi":"https://doi.org/10.1137/s0895480196296823","mag":"2038990377"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480196296823","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480196296823","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5007204231","display_name":"J.A. Hoogeveen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. A. Hoogeveen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025188423","display_name":"Arjen P.A. Vestjens","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. P. A. Vestjens","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.638,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.95711297,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"1","first_page":"56","last_page":"63"},"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.9997000098228455,"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.9907000064849854,"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/preemption","display_name":"Preemption","score":0.8849178552627563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6464257836341858},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6452640295028687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5404568314552307},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5123594999313354},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.5042120218276978},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5025358200073242},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47254204750061035},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.46561598777770996},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4422631561756134},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43140336871147156},{"id":"https://openalex.org/keywords/approx","display_name":"Approx","score":0.43040966987609863},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3617110550403595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2759704291820526}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8849178552627563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6464257836341858},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6452640295028687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5404568314552307},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5123594999313354},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5042120218276978},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5025358200073242},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47254204750061035},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.46561598777770996},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4422631561756134},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43140336871147156},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.43040966987609863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3617110550403595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2759704291820526},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480196296823","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480196296823","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W36142361","https://openalex.org/W230344389","https://openalex.org/W1565473042","https://openalex.org/W1996869102","https://openalex.org/W2056273707","https://openalex.org/W2086012697","https://openalex.org/W2089269509","https://openalex.org/W2142932691","https://openalex.org/W2148204686","https://openalex.org/W2171563416","https://openalex.org/W2186333639","https://openalex.org/W2576116471","https://openalex.org/W2912168264","https://openalex.org/W4232445964"],"related_works":["https://openalex.org/W1977040436","https://openalex.org/W2607924865","https://openalex.org/W2529680039","https://openalex.org/W2522192761","https://openalex.org/W2042776370","https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W4380884924","https://openalex.org/W2026356916","https://openalex.org/W2046459844"],"abstract_inverted_index":{"We":[0,80,126],"consider":[1],"a":[2,144,149],"single-machine":[3],"on-line":[4,85,146],"scheduling":[5],"problem":[6],"where":[7,24],"jobs":[8,16,33,76],"arrive":[9],"over":[10],"time.":[11],"A":[12],"set":[13],"of":[14,32,123],"independent":[15],"has":[17,131],"to":[18,69],"be":[19],"scheduled":[20],"on":[21,88],"the":[22,30,71,89,95,121],"machine,":[23],"preemption":[25],"is":[26,34,47,68,115],"not":[27,48,116],"allowed":[28],"and":[29,52,58,82,108,137],"number":[31],"unknown":[35],"in":[36,50],"advance.":[37],"Each":[38],"job":[39,104],"becomes":[40,97],"available":[41,98,103],"at":[42,63],"its":[43,53,64,112],"release":[44],"date,":[45],"which":[46,74],"known":[49,62],"advance,":[51],"characteristics,":[54],"i.e.,":[55],"processing":[56,113],"requirement":[57,114],"delivery":[59],"time,":[60],"become":[61],"arrival.":[65],"The":[66],"objective":[67],"minimize":[70],"time":[72],"by":[73],"all":[75],"have":[77],"been":[78],"delivered.":[79],"propose":[81],"analyze":[83],"an":[84,102],"algorithm":[86,130,147],"based":[87],"following":[90],"idea:":[91],"As":[92],"soon":[93],"as":[94],"machine":[96],"for":[99,153],"processing,":[100],"choose":[101],"with":[105,148],"highest":[106],"priority,":[107],"schedule":[109],"it":[110],"if":[111],"too":[117],"large.":[118],"Otherwise,":[119],"postpone":[120],"start":[122],"this":[124,154],"job.":[125],"prove":[127],"that":[128,140],"our":[129],"performance":[132,151],"bound":[133],"$(\\sqrt{5}+1)/2":[134],"\\approx":[135],"1.61803$,":[136],"we":[138],"show":[139],"there":[141],"cannot":[142],"exist":[143],"deterministic":[145],"better":[150],"ratio":[152],"problem.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}