{"id":"https://openalex.org/W2752015945","doi":"https://doi.org/10.1142/s0217595917500221","title":"Online Single Machine Scheduling to Minimize the Maximum Starting Time","display_name":"Online Single Machine Scheduling to Minimize the Maximum Starting Time","publication_year":2017,"publication_date":"2017-09-05","ids":{"openalex":"https://openalex.org/W2752015945","doi":"https://doi.org/10.1142/s0217595917500221","mag":"2752015945"},"language":"en","primary_location":{"id":"doi:10.1142/s0217595917500221","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595917500221","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","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/A5081699183","display_name":"Lingfa Lu","orcid":"https://orcid.org/0000-0002-2561-5613"},"institutions":[{"id":"https://openalex.org/I38877650","display_name":"Zhengzhou University","ror":"https://ror.org/04ypx8c21","country_code":"CN","type":"education","lineage":["https://openalex.org/I38877650"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lingfa Lu","raw_affiliation_strings":["School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China","institution_ids":["https://openalex.org/I38877650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085082654","display_name":"Liqi Zhang","orcid":"https://orcid.org/0000-0002-6421-680X"},"institutions":[{"id":"https://openalex.org/I4750791","display_name":"Henan Agricultural University","ror":"https://ror.org/04eq83d71","country_code":"CN","type":"education","lineage":["https://openalex.org/I4750791"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liqi Zhang","raw_affiliation_strings":["College of Information and Management Science, Henan Agricultural University, Zhengzhou, Henan 450003, P. R. China"],"affiliations":[{"raw_affiliation_string":"College of Information and Management Science, Henan Agricultural University, Zhengzhou, Henan 450003, P. R. China","institution_ids":["https://openalex.org/I4750791"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081699183"],"corresponding_institution_ids":["https://openalex.org/I38877650"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.16405039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"34","issue":"05","first_page":"1750022","last_page":"1750022"},"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.9805999994277954,"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.9627730846405029},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.9320229291915894},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.8868108987808228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6920108199119568},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6508669853210449},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5280780792236328},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.47247976064682007},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4532117545604706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41516974568367004},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3743380904197693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3223961889743805},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.27660199999809265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19800055027008057},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09803983569145203}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.9627730846405029},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9320229291915894},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.8868108987808228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6920108199119568},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6508669853210449},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5280780792236328},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.47247976064682007},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4532117545604706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41516974568367004},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3743380904197693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3223961889743805},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27660199999809265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19800055027008057},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09803983569145203},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0217595917500221","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595917500221","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:apjorx:v:34:y:2017:i:05:n:s0217595917500221","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0217595917500221","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1980008867","https://openalex.org/W2009520441","https://openalex.org/W2028821829","https://openalex.org/W2038990377","https://openalex.org/W2042312329","https://openalex.org/W2046052133","https://openalex.org/W2056273707","https://openalex.org/W2062953948","https://openalex.org/W2064323841","https://openalex.org/W2076671014","https://openalex.org/W2089269509","https://openalex.org/W2115299891","https://openalex.org/W3135987664","https://openalex.org/W4302419487"],"related_works":["https://openalex.org/W2092031801","https://openalex.org/W1908901187","https://openalex.org/W2752015945","https://openalex.org/W2043605162","https://openalex.org/W2064017604","https://openalex.org/W3135987664","https://openalex.org/W2889114784","https://openalex.org/W2094578294","https://openalex.org/W2163017071","https://openalex.org/W3183786176"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,24,44,59],"consider":[4],"the":[5,13,18,21,41,47,56,80],"online":[6,33,64,77],"single":[7],"machine":[8],"scheduling":[9],"problem":[10],"to":[11],"minimize":[12],"maximum":[14],"starting":[15],"time":[16],"of":[17,70,84],"jobs.":[19],"For":[20,40,55],"non-preemptive":[22],"model,":[23,43,58],"show":[25,45,60],"that":[26,46,61],"there":[27],"is":[28],"no":[29],"determined":[30,63],"or":[31],"randomized":[32],"algorithm":[34,65,78],"with":[35,79],"a":[36,67],"bounded":[37],"competitive":[38,68,82],"ratio.":[39],"preemption-resume":[42],"well-known":[48],"SRPT":[49],"rule":[50],"yields":[51],"an":[52,76],"optimal":[53],"schedule.":[54],"preemption-restart":[57],"any":[62],"has":[66],"ratio":[69,83],"at":[71],"least":[72],"2":[73],"and":[74],"present":[75],"best-possible":[81],"2.":[85]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}