{"id":"https://openalex.org/W2343814109","doi":"https://doi.org/10.5220/0005757503300339","title":"Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints","display_name":"Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2343814109","doi":"https://doi.org/10.5220/0005757503300339","mag":"2343814109"},"language":"en","primary_location":{"id":"doi:10.5220/0005757503300339","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005757503300339","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 5th the International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005757503300339","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050832542","display_name":"Wasakorn Laesanklang","orcid":"https://orcid.org/0000-0003-4203-3452"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Wasakorn Laesanklang","raw_affiliation_strings":["The University of Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037965570","display_name":"Dario Landa-Silva","orcid":"https://orcid.org/0000-0002-9499-6827"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dario Landa-Silva","raw_affiliation_strings":["The University of Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110455250","display_name":"J. Arturo Castillo-Salazar","orcid":null},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J. Arturo Castillo-Salazar","raw_affiliation_strings":["The University of Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"330","last_page":"339"},"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.9993000030517578,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9970999956130981,"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/integer-programming","display_name":"Integer programming","score":0.7564218640327454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.675299882888794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5978394746780396},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5506104230880737},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5434702634811401},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.5204475522041321},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5112249851226807},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5026412010192871},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4571516215801239},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.456408828496933},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4544716775417328},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4385651648044586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2776726484298706}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7564218640327454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.675299882888794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5978394746780396},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5506104230880737},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5434702634811401},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.5204475522041321},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5112249851226807},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5026412010192871},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4571516215801239},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.456408828496933},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4544716775417328},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4385651648044586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2776726484298706},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5220/0005757503300339","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005757503300339","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 5th the International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.nottingham.ac.uk:32122","is_oa":true,"landing_page_url":"http://eprints.nottingham.ac.uk/32122/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402014","display_name":"Nottingham ePrints (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:nottingham-repository.worktribe.com:978472","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/978472","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"doi:10.5220/0005757503300339","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005757503300339","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 5th the International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1497691682","https://openalex.org/W1967965037","https://openalex.org/W1990520230","https://openalex.org/W1995813347","https://openalex.org/W2016959770","https://openalex.org/W2020590524","https://openalex.org/W2029970827","https://openalex.org/W2038507294","https://openalex.org/W2064104291","https://openalex.org/W2094070748","https://openalex.org/W2096305430","https://openalex.org/W2249595199","https://openalex.org/W2527940417"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3119129187","https://openalex.org/W3024185138","https://openalex.org/W4402156642"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,38,48,81],"mixed":[3,100],"integer":[4,101],"programming":[5,102],"decomposition":[6,27,42],"approach":[7,94],"to":[8,51,75,80,95,104],"tackle":[9,105],"workforce":[10],"scheduling":[11],"and":[12,32,43,69,108],"routing":[13],"problems":[14],"(WSRP)":[15],"that":[16,87],"involve":[17],"time-dependent":[18],"activities":[19,59],"constraints.":[20],"The":[21],"proposed":[22,78,89],"method":[23,79],"is":[24,91],"called":[25],"repeated":[26],"with":[28],"conflict":[29,52],"repair":[30],"(RDCR)":[31],"it":[33],"consists":[34],"of":[35,40,56,99],"repeatedly":[36],"applying":[37],"phase":[39,49],"problem":[41],"sub-problem":[44],"solving,":[45],"followed":[46],"by":[47],"dedicated":[50],"repair.":[53],"Five":[54],"types":[55],"time":[57],"dependent":[58],"constraints":[60],"are":[61,73],"considered:":[62],"overlapping,":[63],"synchronisation,":[64],"minimum":[65],"difference,":[66,68],"maximum":[67],"minimum-maximum":[70],"difference.":[71],"Experiments":[72],"conducted":[74],"compare":[76],"the":[77,88,97,106],"tailored":[82],"greedy":[83],"heuristic.":[84],"Results":[85],"show":[86],"RDCR":[90],"an":[92],"effective":[93],"harness":[96],"power":[98],"solvers":[103],"difficult":[107],"highly":[109],"constrained":[110],"WSRP":[111],"in":[112],"practical":[113],"computational":[114],"time.":[115]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}