{"id":"https://openalex.org/W4285284969","doi":"https://doi.org/10.1109/access.2022.3186097","title":"A 2-Stage Approach for the Nurse Rostering Problem","display_name":"A 2-Stage Approach for the Nurse Rostering Problem","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4285284969","doi":"https://doi.org/10.1109/access.2022.3186097"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3186097","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09805588.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09805588.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069629393","display_name":"Say Leng Goh","orcid":"https://orcid.org/0000-0003-4562-2519"},"institutions":[{"id":"https://openalex.org/I161371597","display_name":"Universiti of Malaysia Sabah","ror":"https://ror.org/040v70252","country_code":"MY","type":"education","lineage":["https://openalex.org/I161371597"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Say Leng Goh","raw_affiliation_strings":["Optimisation Research Group, Faculty of Computing and Informatics, Universiti Malaysia Sabah Labuan International Campus, Labuan, Malaysia"],"affiliations":[{"raw_affiliation_string":"Optimisation Research Group, Faculty of Computing and Informatics, Universiti Malaysia Sabah Labuan International Campus, Labuan, Malaysia","institution_ids":["https://openalex.org/I161371597"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079542102","display_name":"San Nah Sze","orcid":"https://orcid.org/0000-0002-4981-6292"},"institutions":[{"id":"https://openalex.org/I41461413","display_name":"Universiti Malaysia Sarawak","ror":"https://ror.org/05b307002","country_code":"MY","type":"education","lineage":["https://openalex.org/I41461413"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"San Nah Sze","raw_affiliation_strings":["Faculty of Computer Science &","Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan, Sarawak, Malaysia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan, Sarawak, Malaysia","institution_ids":["https://openalex.org/I41461413"]},{"raw_affiliation_string":"Faculty of Computer Science &","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050621611","display_name":"Nasser R. Sabar","orcid":"https://orcid.org/0000-0002-0276-4704"},"institutions":[{"id":"https://openalex.org/I196829312","display_name":"La Trobe University","ror":"https://ror.org/01rxfrp27","country_code":"AU","type":"education","lineage":["https://openalex.org/I196829312"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Nasser R. Sabar","raw_affiliation_strings":["Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I196829312"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100702092","display_name":"Salwani Abdullah","orcid":"https://orcid.org/0000-0003-0037-841X"},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Salwani Abdullah","raw_affiliation_strings":["Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074319022","display_name":"Graham Kendall","orcid":"https://orcid.org/0000-0003-2006-5103"},"institutions":[{"id":"https://openalex.org/I155043079","display_name":"University of Nottingham Malaysia Campus","ror":"https://ror.org/04mz9mt17","country_code":"MY","type":"education","lineage":["https://openalex.org/I142263535","https://openalex.org/I155043079"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Graham Kendall","raw_affiliation_strings":["University of Nottingham Malaysia Campus, Jalan Broga, Semenyih, Selangor, Malaysia"],"affiliations":[{"raw_affiliation_string":"University of Nottingham Malaysia Campus, Jalan Broga, Semenyih, Selangor, Malaysia","institution_ids":["https://openalex.org/I155043079"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850,"provenance":"doaj"},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850,"provenance":"doaj"},"fwci":2.447,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":13,"citation_normalized_percentile":{"value":0.999895,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"69591","last_page":"69604"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9709,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9009,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.62885976},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.6252341},{"id":"https://openalex.org/keywords/nurse-scheduling-problem","display_name":"Nurse scheduling problem","score":0.45928785},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.41288337}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7068175},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.62885976},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6252341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5724184},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.45928785},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.43108875},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.41288337},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3945759},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.32254642},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26347688},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.26143056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17807105},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.12030843},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3186097","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09805588.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":false,"landing_page_url":"https://doaj.org/article/ceca8c36e8d546069c90355dd29648fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_2-stage_Approach_for_the_Nurse_Rostering_Problem/20399310","pdf_url":"https://figshare.com/articles/journal_contribution/A_2-stage_Approach_for_the_Nurse_Rostering_Problem/20399310/1/files/36468654.pdf","source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":["University of Illinois Chicago"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3186097","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09805588.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"score":0.79,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"grants":[{"funder":"https://openalex.org/F4320323704","funder_display_name":"Universiti Malaysia Sabah","award_id":"SGA0040-2019"}],"datasets":[],"versions":[],"referenced_works_count":45,"referenced_works":["https://openalex.org/W1840071604","https://openalex.org/W1981097545","https://openalex.org/W2007328050","https://openalex.org/W2016721869","https://openalex.org/W2018880500","https://openalex.org/W2039508948","https://openalex.org/W2041762122","https://openalex.org/W2047937685","https://openalex.org/W2052673110","https://openalex.org/W2057865045","https://openalex.org/W2065601237","https://openalex.org/W2067091385","https://openalex.org/W2095560557","https://openalex.org/W2126316555","https://openalex.org/W2139397089","https://openalex.org/W2149929637","https://openalex.org/W2307258525","https://openalex.org/W2523385593","https://openalex.org/W2541012042","https://openalex.org/W2606708515","https://openalex.org/W2619921747","https://openalex.org/W2622844814","https://openalex.org/W2677624263","https://openalex.org/W2738071030","https://openalex.org/W2753985874","https://openalex.org/W2792868737","https://openalex.org/W2898604737","https://openalex.org/W2943465456","https://openalex.org/W2951243164","https://openalex.org/W2998440189","https://openalex.org/W3004539422","https://openalex.org/W3012931649","https://openalex.org/W3014233015","https://openalex.org/W3025350644","https://openalex.org/W3045980855","https://openalex.org/W3081867316","https://openalex.org/W3082067997","https://openalex.org/W3119314341","https://openalex.org/W3186106104","https://openalex.org/W3186677729","https://openalex.org/W3194152491","https://openalex.org/W3217161237","https://openalex.org/W4224914487","https://openalex.org/W4242301326","https://openalex.org/W4285292539"],"related_works":["https://openalex.org/W90886653","https://openalex.org/W4252370918","https://openalex.org/W4237368524","https://openalex.org/W2305572622","https://openalex.org/W2123829500","https://openalex.org/W2114712485","https://openalex.org/W2045456468","https://openalex.org/W1548986920","https://openalex.org/W1537780499","https://openalex.org/W1533229056"],"abstract_inverted_index":{"In":[0,15,65,97],"this":[1],"paper,":[2],"we":[3,99],"are":[4,27,130],"addressing":[5],"the":[6,36,60,68,84,95,107,120,138,149,152],"NP-hard":[7],"nurse":[8],"rostering":[9],"problem":[10],"utilizing":[11],"a":[12,31,41,101],"2-stage":[13],"approach.":[14],"stage":[16,66],"one,":[17],"Monte":[18],"Carlo":[19],"Tree":[20],"Search":[21,77],"(MCTS)":[22],"and":[23,50,54,134,140],"Hill":[24],"Climbing":[25],"(HC)":[26],"hybridized":[28],"in":[29,59],"finding":[30],"feasible":[32,69],"solution":[33,70],"(satisfying":[34],"all":[35],"hard":[37],"constraints).":[38],"We":[39,88],"propose":[40,100],"new":[42],"constant":[43],"C":[44],"value":[45],"(which":[46],"balances":[47],"search":[48,86,108],"diversification":[49],"intensification":[51],"of":[52,63,151],"MCTS)":[53],"tree":[55],"policy/node":[56],"selection":[57,61],"function":[58],"procedure":[62],"MCTS.":[64],"two,":[67],"is":[71,117,161],"further":[72],"improved":[73],"using":[74],"Iterated":[75],"Local":[76],"(ILS)":[78],"with":[79],"Variable":[80],"Neighbourhood":[81],"Descent":[82],"as":[83],"local":[85,112],"component.":[87],"introduce":[89],"several":[90],"unique":[91],"neighbourhood":[92],"structures":[93],"for":[94,132,137],"ILS.":[96],"addition,":[98],"novel":[102],"perturbation":[103],"strategy":[104],"to":[105,109,157],"allow":[106],"escape":[110],"from":[111],"optimum.":[113],"The":[114],"proposed":[115,153],"methodology":[116,154],"tested":[118],"on":[119,148],"Shift":[121],"Scheduling":[122],"dataset":[123],"(24":[124],"benchmark":[125],"instances).":[126],"New":[127],"best":[128],"results":[129],"reported":[131],"seven":[133],"two":[135],"instances":[136],"10":[139],"60":[141],"minutes":[142],"run":[143],"respectively.":[144],"An":[145],"in-depth":[146],"discussion":[147],"attributes":[150],"that":[155],"lead":[156],"its":[158],"good":[159],"performance":[160],"provided.":[162]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4285284969","counts_by_year":[{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2025-01-08T08:57:08.048720","created_date":"2022-07-14"}