{"id":"https://openalex.org/W1908901187","doi":"https://doi.org/10.1142/s1793830915500214","title":"Online and semi-online scheduling to minimize makespan on single machine with an availability constraint","display_name":"Online and semi-online scheduling to minimize makespan on single machine with an availability constraint","publication_year":2015,"publication_date":"2015-04-17","ids":{"openalex":"https://openalex.org/W1908901187","doi":"https://doi.org/10.1142/s1793830915500214","mag":"1908901187"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830915500214","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500214","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5035090837","display_name":"Qiang Gao","orcid":"https://orcid.org/0000-0002-6303-9573"},"institutions":[{"id":"https://openalex.org/I143593769","display_name":"East China University of Science and Technology","ror":"https://ror.org/01vyrm377","country_code":"CN","type":"education","lineage":["https://openalex.org/I143593769"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qiang Gao","raw_affiliation_strings":["Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China","institution_ids":["https://openalex.org/I143593769"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114833643","display_name":"Ganggang Li","orcid":"https://orcid.org/0000-0002-5670-3499"},"institutions":[{"id":"https://openalex.org/I143593769","display_name":"East China University of Science and Technology","ror":"https://ror.org/01vyrm377","country_code":"CN","type":"education","lineage":["https://openalex.org/I143593769"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ganggang Li","raw_affiliation_strings":["Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China","institution_ids":["https://openalex.org/I143593769"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100708139","display_name":"Xiwen Lu","orcid":"https://orcid.org/0000-0002-4728-6048"},"institutions":[{"id":"https://openalex.org/I143593769","display_name":"East China University of Science and Technology","ror":"https://ror.org/01vyrm377","country_code":"CN","type":"education","lineage":["https://openalex.org/I143593769"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiwen Lu","raw_affiliation_strings":["Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China","institution_ids":["https://openalex.org/I143593769"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035090837"],"corresponding_institution_ids":["https://openalex.org/I143593769"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.06530765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"07","issue":"03","first_page":"1550021","last_page":"1550021"},"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.9951000213623047,"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.8925807476043701},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.8620336055755615},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7961491942405701},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7284978628158569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.63944411277771},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5996643900871277},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5778769254684448},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5084249377250671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49271753430366516},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.48585936427116394},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.355562686920166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27739977836608887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18875423073768616},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08722174167633057},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.0665375292301178}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8925807476043701},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8620336055755615},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7961491942405701},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7284978628158569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.63944411277771},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5996643900871277},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5778769254684448},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5084249377250671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49271753430366516},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.48585936427116394},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.355562686920166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27739977836608887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18875423073768616},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08722174167633057},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0665375292301178},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830915500214","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500214","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"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":12,"referenced_works":["https://openalex.org/W1985841699","https://openalex.org/W1994566591","https://openalex.org/W1999566861","https://openalex.org/W2016371955","https://openalex.org/W2036497325","https://openalex.org/W2043605162","https://openalex.org/W2045895304","https://openalex.org/W2046781886","https://openalex.org/W2048358792","https://openalex.org/W2063400071","https://openalex.org/W2079294538","https://openalex.org/W2611886938"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2752015945","https://openalex.org/W3135987664","https://openalex.org/W2051209951","https://openalex.org/W4390203503","https://openalex.org/W1493790977","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W1908901187"],"abstract_inverted_index":{"Online":[0],"and":[1,110],"semi-online":[2,74,100,108],"scheduling":[3],"problems":[4,75],"on":[5],"a":[6],"single":[7],"machine":[8,19],"with":[9],"an":[10,67],"availability":[11],"constraint":[12],"are":[13],"considered":[14],"in":[15,24,76,96],"this":[16],"paper.":[17],"The":[18,38],"has":[20],"one":[21],"unavailable":[22],"interval":[23],"which":[25,77],"jobs":[26],"cannot":[27],"be":[28],"processed.":[29],"Preemption":[30],"is":[31,40,66,94],"not":[32],"allowed.":[33],"Jobs":[34],"arrive":[35],"over":[36],"time.":[37],"objective":[39],"to":[41],"minimize":[42],"makespan.":[43],"First":[44],"we":[45,58,71,102],"discuss":[46],"the":[47,51,78,82,86,91],"online":[48],"version":[49],"of":[50],"problem.":[52],"After":[53],"giving":[54],"its":[55],"lower":[56,105],"bound,":[57],"prove":[59,111],"that":[60],"Earliest":[61],"Release":[62],"Date":[63],"(ERD)":[64],"algorithm":[65],"optimal":[68,92],"algorithm.":[69],"Then":[70],"study":[72],"some":[73],"largest":[79,87],"processing":[80,84],"time,":[81,85],"total":[83],"release":[88],"date,":[89],"or":[90],"makespan":[93],"known":[95],"advance.":[97],"For":[98],"these":[99],"problems,":[101],"give":[103],"their":[104,112],"bounds,":[106],"design":[107],"algorithms":[109],"competitive":[113],"ratios,":[114],"respectively.":[115]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}