{"id":"https://openalex.org/W3007318686","doi":"https://doi.org/10.1109/ssci44817.2019.9003132","title":"Scheduling method of maintenance support resource with task timing constraint","display_name":"Scheduling method of maintenance support resource with task timing constraint","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3007318686","doi":"https://doi.org/10.1109/ssci44817.2019.9003132","mag":"3007318686"},"language":"en","primary_location":{"id":"doi:10.1109/ssci44817.2019.9003132","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci44817.2019.9003132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5000047845","display_name":"Chongchong Guan","orcid":null},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chongchong Guan","raw_affiliation_strings":["School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047518945","display_name":"Hui Lu","orcid":"https://orcid.org/0000-0001-9455-4597"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hui Lu","raw_affiliation_strings":["School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronic and Information Engineering, Beihang University, Beijing, P. R. China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33516316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"2698","last_page":"2705"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T13706","display_name":"Management and Optimization Techniques","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7105141282081604},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6446514129638672},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5232203006744385},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.4725216031074524},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.4587464928627014},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.456874281167984},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4214632213115692},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41463702917099},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4112852215766907},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3648208975791931},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.233847975730896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19834700226783752},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10969451069831848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1067655086517334}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7105141282081604},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6446514129638672},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5232203006744385},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.4725216031074524},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.4587464928627014},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.456874281167984},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4214632213115692},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41463702917099},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4112852215766907},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3648208975791931},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.233847975730896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19834700226783752},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10969451069831848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1067655086517334},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci44817.2019.9003132","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci44817.2019.9003132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W253574129","https://openalex.org/W1147962567","https://openalex.org/W1964190459","https://openalex.org/W2006785664","https://openalex.org/W2011039300","https://openalex.org/W2016699485","https://openalex.org/W2020030076","https://openalex.org/W2020807867","https://openalex.org/W2063123613","https://openalex.org/W2101923813","https://openalex.org/W2121265952","https://openalex.org/W2138761185","https://openalex.org/W2145479420","https://openalex.org/W2147336456","https://openalex.org/W2167483411","https://openalex.org/W2579361096","https://openalex.org/W2604593109","https://openalex.org/W2762451727","https://openalex.org/W2889547691","https://openalex.org/W2892397808","https://openalex.org/W3164660163","https://openalex.org/W6796105954"],"related_works":["https://openalex.org/W2026959567","https://openalex.org/W1908901187","https://openalex.org/W2128842633","https://openalex.org/W2393259092","https://openalex.org/W2165635335","https://openalex.org/W2611243239","https://openalex.org/W2610317613","https://openalex.org/W3023229761","https://openalex.org/W1564969975","https://openalex.org/W1498742891"],"abstract_inverted_index":{"Maintenance":[0],"support":[1],"resource":[2,44,47],"scheduling":[3,105,134],"(MSRS)":[4],"problem":[5,119],"has":[6],"attracted":[7],"increasing":[8],"attention":[9],"in":[10,115,141,160],"modern":[11],"battle.":[12],"It":[13],"aims":[14],"to":[15,21,35,87],"allocate":[16],"resources":[17],"from":[18],"multi-supply":[19],"points":[20],"multi-tasks":[22],"with":[23,68,77,101,120,125,136],"the":[24,38,62,90,111,117,126,128,142,149,156],"shortest":[25,63],"time.":[26],"However,":[27],"there":[28],"exists":[29],"various":[30],"constraints":[31],"which":[32],"are":[33,99,164],"difficult":[34],"satisfy":[36],"at":[37],"same":[39],"time,":[40],"such":[41],"as":[42,148],"limited":[43],"reserves,":[45],"different":[46],"requirements,":[48],"complex":[49],"route":[50,69],"conditions":[51],"and":[52,65,71,97,103,130,139,162],"strict":[53],"task":[54,66],"timing.":[55],"As":[56],"a":[57],"result,":[58],"we":[59],"first":[60],"obtain":[61],"routes":[64],"sequence":[67],"planning":[70],"topological":[72],"sorting":[73],"algorithms":[74],"separately.":[75],"Then,":[76],"these":[78],"information,":[79],"an":[80],"integrated":[81],"meta-heuristic":[82],"algorithm":[83],"(IMHA)":[84],"is":[85],"designed":[86],"solve":[88],"all":[89],"constraints.":[91],"Furthermore,":[92],"two":[93],"improved":[94],"algorithms,":[95],"CMHA":[96,131],"GMHA":[98,129,159],"generated":[100],"classical":[102],"greedy":[104],"strategies":[106],"respectively.":[107],"Experiment":[108],"results":[109],"show":[110],"feasibility":[112],"of":[113,151,153,158],"IMHA":[114],"solving":[116],"MSRS":[118],"timing":[121,154],"constraint.":[122],"Besides,":[123],"compared":[124],"IMHA,":[127],"can":[132],"generate":[133],"schemes":[135],"lower":[137],"cost":[138,161],"time":[140,163],"whole":[143],"24":[144],"instances.":[145],"In":[146],"addition,":[147],"increase":[150],"proportion":[152],"tasks,":[155],"advantages":[157],"more":[165],"evident.":[166]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}