乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T06:35:13Z","timestamp":1725086113080},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100006242","name":"Universiti Malaysia Sabah","doi-asserted-by":"publisher","award":["SGA0040-2019"],"id":[{"id":"10.13039\/501100006242","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3186097","type":"journal-article","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T19:36:17Z","timestamp":1656099377000},"page":"69591-69604","source":"Crossref","is-referenced-by-count":11,"title":["A 2-Stage Approach for the Nurse Rostering Problem"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4562-2519","authenticated-orcid":false,"given":"Say Leng","family":"Goh","sequence":"first","affiliation":[{"name":"Optimisation Research Group, Faculty of Computing and Informatics, Universiti Malaysia Sabah Labuan International Campus, Labuan, Malaysia"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4981-6292","authenticated-orcid":false,"given":"San Nah","family":"Sze","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Kota Samarahan, Sarawak, Malaysia"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0276-4704","authenticated-orcid":false,"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC, Australia"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0037-841X","authenticated-orcid":false,"given":"Salwani","family":"Abdullah","sequence":"additional","affiliation":[{"name":"Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia"}]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nottingham, Semenyih, Selangor, Malaysia"}]}],"member":"263","reference":[{"key":"ref39","first-page":"69","article-title":"Constraint reformulation for nurse rostering problems","author":"smet","year":"2018","journal-title":"Proc 12th Int Conf Pract Theory Automated Timetabling"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3097778"},{"key":"ref33","first-page":"1","article-title":"INRC2010: An approach using a general constraint optimization solver","author":"nonobe","year":"2010","journal-title":"Proc 1st Int Nurse Rostering Competition (INRC)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.06.005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIE.2010.5668320"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107729"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_12"},{"key":"ref36","first-page":"549","article-title":"A direct MILP approach based on state-expanded network flows and anticipation for multi-stage nurse rostering under uncertainty","author":"r\u00f6mer","year":"2016","journal-title":"Proc 11th Int Conf Pract Theory Automated Timetabling"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09.030"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2013.2263884"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-019-00172-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2546-8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.07.044"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.11591\/ijece.v11i1.pp471-480"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2020058"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/01966324.2019.1570882"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1062-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/17509653.2018.1534619"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90025-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1536-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754766"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105221"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3177280"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03527-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00021-3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104945"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3100613"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2015.7407061"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116224"},{"key":"ref15","article-title":"Computational results on new staff scheduling benchmark instances","author":"curtois","year":"2014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00281-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.04.013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18517\/ijaseit.9.6.10224"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2017.03.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1111\/j.1466-7657.2009.00784.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2076-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref5","first-page":"1","article-title":"A hyper-heuristic combined with a greedy shuffle approach to the nurse rostering competition","author":"bilgin","year":"2010","journal-title":"Proc 5th Int Conf Practice Theory Automated Timetabling (PATAT)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000046076.75950.0b"},{"key":"ref7","first-page":"13","article-title":"An ejection chain method and a branch and price algorithm applied to the instances of the first international nurse rostering competition, 2010","volume":"10","author":"burke","year":"2010","journal-title":"Proc 5th Int Conf Practice Theory Automated Timetabling (PATAT)"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.05.027"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2816-0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.11.029"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.12.042"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1515\/jisys-2017-0150"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-020-00473-x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113943"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106531"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.02.009"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09805588.pdf?arnumber=9805588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T20:23:10Z","timestamp":1659990190000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9805588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3186097","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}