{"id":"https://openalex.org/W2041182086","doi":"https://doi.org/10.1109/coase.2014.6899382","title":"Home health care crew scheduling and routing problem with stochastic service times","display_name":"Home health care crew scheduling and routing problem with stochastic service times","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2041182086","doi":"https://doi.org/10.1109/coase.2014.6899382","mag":"2041182086"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2014.6899382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2014.6899382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Automation Science and Engineering (CASE)","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/A5039310090","display_name":"Biao Yuan","orcid":"https://orcid.org/0000-0002-3100-5993"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Biao Yuan","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, PR China","Department of Industrial Engineering and Management, Shanghai Jiao Tong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, PR China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101711741","display_name":"Ran Liu","orcid":"https://orcid.org/0000-0002-7922-8969"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ran Liu","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, PR China","Department of Industrial Engineering and Management, Shanghai Jiao Tong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, PR China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011681810","display_name":"Zhibin Jiang","orcid":"https://orcid.org/0000-0002-9241-0212"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhibin Jiang","raw_affiliation_strings":["Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, PR China","Department of Industrial Engineering and Management, Shanghai Jiao Tong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai, PR China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Department of Industrial Engineering and Management, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":3.3987,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.92190265,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"564","last_page":"569"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10567","display_name":"Vehicle Routing Optimization Methods","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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/column-generation","display_name":"Column generation","score":0.8769097328186035},{"id":"https://openalex.org/keywords/crew-scheduling","display_name":"Crew scheduling","score":0.8568129539489746},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6800118088722229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.63542240858078},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6012942790985107},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5565961003303528},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.5517320036888123},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5081195831298828},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.47529327869415283},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4533710479736328},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4220014214515686},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.40419715642929077},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3371121287345886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21305638551712036},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09808754920959473},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08684557676315308}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.8769097328186035},{"id":"https://openalex.org/C2776986690","wikidata":"https://www.wikidata.org/wiki/Q1139830","display_name":"Crew scheduling","level":3,"score":0.8568129539489746},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6800118088722229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.63542240858078},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6012942790985107},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5565961003303528},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.5517320036888123},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5081195831298828},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.47529327869415283},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4533710479736328},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4220014214515686},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40419715642929077},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3371121287345886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21305638551712036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09808754920959473},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08684557676315308},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2014.6899382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2014.6899382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W162144624","https://openalex.org/W1988434338","https://openalex.org/W1993061064","https://openalex.org/W2021533552","https://openalex.org/W2029341065","https://openalex.org/W2029570945","https://openalex.org/W2033740998","https://openalex.org/W2036969993","https://openalex.org/W2054151210","https://openalex.org/W2086991060","https://openalex.org/W2096171214","https://openalex.org/W2096305430","https://openalex.org/W2099391941","https://openalex.org/W2135680984","https://openalex.org/W2397141287","https://openalex.org/W6647331482"],"related_works":["https://openalex.org/W2408706507","https://openalex.org/W825094129","https://openalex.org/W1979086645","https://openalex.org/W2117466569","https://openalex.org/W2158354221","https://openalex.org/W2978976313","https://openalex.org/W2499699449","https://openalex.org/W596388258","https://openalex.org/W2383016926","https://openalex.org/W2587401452"],"abstract_inverted_index":{"The":[0,30,72],"home":[1],"health":[2],"care":[3],"crew":[4],"scheduling":[5],"and":[6,45,62,81,105,113],"routing":[7],"problem":[8,52,60,67],"with":[9,22,68],"stochastic":[10,19],"service":[11],"times":[12],"is":[13,24,43,53,74,84,100,109,118],"studied":[14],"in":[15],"this":[16],"paper.":[17],"A":[18],"programming":[20],"model":[21],"recourse":[23],"constructed":[25],"to":[26,48],"describe":[27],"the":[28,34,51,77,82,96,121],"problem.":[29],"approximate":[31],"formulation":[32],"for":[33,37],"expected":[35],"penalty":[36],"late":[38],"arrival":[39],"at":[40],"a":[41,56,103],"customer":[42],"obtained":[44],"analyzed.":[46],"According":[47],"its":[49],"features,":[50],"transformed":[54],"into":[55],"classical":[57],"set":[58],"partitioning":[59],"(SPP)":[61],"an":[63,87],"elementary":[64],"shortest":[65],"path":[66],"resource":[69],"constraints":[70],"(ESPPRC).":[71],"SPP":[73],"solved":[75,85],"by":[76,86,120],"column":[78,97],"generation":[79,98],"algorithm,":[80],"ESPPRC":[83],"effective":[88],"label":[89],"algorithm.":[90],"To":[91],"get":[92],"integer":[93],"feasible":[94],"solutions,":[95],"procedure":[99],"embedded":[101],"within":[102],"branch":[104,112],"bound":[106],"framework,":[107],"which":[108],"also":[110],"called":[111],"price":[114],"approach.":[115],"Its":[116],"effectiveness":[117],"validated":[119],"numerical":[122],"experiment.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}