{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:14:08Z","timestamp":1760710448226,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030675394"},{"type":"electronic","value":"9783030675400"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67540-0_7","type":"book-chapter","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T13:12:57Z","timestamp":1611234777000},"page":"112-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A MOEAD-Based Approach to Solving the Staff Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Feng","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,22]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"104945","DOI":"10.1016\/j.cor.2020.104945","volume":"120","author":"P Strandmark","year":"2020","unstructured":"Strandmark, P., Yi, Q., Curtois, T.: First-order linear programming in a column generation based heuristic approach to the nurse rostering problem. Comput. Oper. Res. 120, 104945 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10951-020-00639-6","volume":"23","author":"B Akbarzadeh","year":"2020","unstructured":"Akbarzadeh, B., Moslehi, G., Reisi-Nafchi, M., Maenhout, B.: A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering. J. Schedul. 23(2), 265\u2013288 (2020). https:\/\/doi.org\/10.1007\/s10951-020-00639-6","journal-title":"J. Schedul."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Maenhout, B., Vanhoucke, M.: An exact algorithm for an integrated project staffing problem with a homogeneous workforce. Kluwer Academic Publishers (2016)","DOI":"10.1007\/s10951-015-0443-z"},{"key":"7_CR4","unstructured":"Augustine, L., Faer, M., Kavountzis, A., Patel, R.: A brief study of the nurse scheduling problem (NSP). University of Pittsburgh Medical Center (2009)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Solos, I.P., Tassopoulos, I.X., Beligiannis, G.N.: A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (2013)","DOI":"10.3390\/a6020278"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tre.2016.12.011","volume":"99","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Liu, J., Zhang, Y., Gan, X.: A multi-objective evolutionary algorithm for multi-period dynamic emergency resource scheduling problems. Transp. Res. Part E Logs Transp. Rev. 99, 77\u201395 (2017)","journal-title":"Transp. Res. Part E Logs Transp. Rev."},{"issue":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773\u2013791 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2012.2204264","volume":"17","author":"R Wang","year":"2013","unstructured":"Wang, R., Purshouse, R.C., Fleming, P.J.: Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans. Evol. Comput. 17(4), 474\u2013494 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"pt.21","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/246543","volume":"2014","author":"K Leksakul","year":"2014","unstructured":"Leksakul, K., Phetsawat, S.: Nurse scheduling using genetic algorithm,\". Mathematical Problems in Engineering 2014(pt.21), 1\u201316 (2014)","journal-title":"Mathematical Problems in Engineering"},{"issue":"5","key":"7_CR12","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U Aickelin","year":"2004","unstructured":"Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse-scheduling problem. Comput. Oper. Res. 31(5), 761\u2013778 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"Z L\u00fc","year":"2011","unstructured":"L\u00fc, Z., Hao, J.-K., Glover, F.: Neighborhood analysis: a case study on curriculum-based course timetabling. J. Heurist. 17(2), 97\u2013118 (2011)","journal-title":"J. Heurist."},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/TSMCA.2012.2210404","volume":"43","author":"N Todorovic","year":"2012","unstructured":"Todorovic, N., Petrovic, S.: Bee colony optimization algorithm for nurse rostering. IEEE Trans. Syst. Man Cybern.: Syst. 43(2), 467\u2013473 (2012)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"2","key":"7_CR15","first-page":"77","volume":"40","author":"JP Howell","year":"1966","unstructured":"Howell, J.P.: Cyclical scheduling of nursing personnel. Hospitals 40(2), 77 (1966)","journal-title":"Hospitals"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ejor.2017.08.033","volume":"269","author":"SM Pour","year":"2018","unstructured":"Pour, S.M., Drake, J.H., Ejlertsen, L.S., Rasmussen, K.M., Burke, E.K.: A hybrid constraint programming\/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem. Eur. J. Oper. Res. 269(1), 341\u2013352 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1177\/0954411919889560","volume":"234","author":"M Hamid","year":"2020","unstructured":"Hamid, M., Tavakkoli-Moghaddam, R., Golpaygani, F., Vahedi-Nouri, B.: A multi-objective model for a nurse scheduling problem by emphasizing human factors. Proc. Inst. Mech. Eng. Part H: J. Eng. Med. 234(2), 179\u2013199 (2020)","journal-title":"Proc. Inst. Mech. Eng. Part H: J. Eng. Med."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"124431","DOI":"10.1016\/j.jhydrol.2019.124431","volume":"581","author":"Z Zhang","year":"2020","unstructured":"Zhang, Z., Qin, H., Yao, L., Liu, Y., Jiang, Z., Feng, Z., Ouyang, S.: Improved multi-objective moth-flame optimization algorithm based on r-domination for cascade reservoirs operation. J. Hydrol. 581, 124431 (2020)","journal-title":"J. Hydrol."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Yu, X., Yao, X., Wang, Y., Zhu, L., Filev, D.: Domination-based ordinal regression for expensive multi-objective optimization. In: 2019 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 2058\u20132065. IEEE (2019)","DOI":"10.1109\/SSCI44817.2019.9002828"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.asoc.2017.04.005","volume":"57","author":"WK Mashwani","year":"2017","unstructured":"Mashwani, W.K., Salhi, A., Yeniay, O., Jan, M.A., Khanum, R.A.: Hybrid adaptive evolutionary algorithm based on decomposition. Appl. Soft Comput. 57, 363\u2013378 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"7_CR21","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TEVC.2017.2749619","volume":"22","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Cheng, F., Jin, Y.: An indicator-based multiobjective evolutionary algorithm with reference point adaptation for better versatility. IEEE Trans. Evol. Comput. 22(4), 609\u2013622 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"10","key":"7_CR22","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1109\/TCYB.2014.2367526","volume":"45","author":"S Jiang","year":"2014","unstructured":"Jiang, S., Zhang, J., Ong, Y.-S., Zhang, A.N., Tan, P.S.: A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm. IEEE Trans. Cybern. 45(10), 2202\u20132213 (2014)","journal-title":"IEEE Trans. Cybern."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.swevo.2017.11.004","volume":"39","author":"J Luo","year":"2018","unstructured":"Luo, J., Yang, Y., Li, X., Liu, Q., Chen, M., Gao, K.: A decomposition-based multi-objective evolutionary algorithm with quality indicator. Swarm Evol. Comput. 39, 339\u2013355 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"7_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5579-4","volume-title":"Introduction to Analytic Number Theory","author":"TM Apostol","year":"2013","unstructured":"Apostol, T.M.: Introduction to Analytic Number Theory. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4757-5579-4"},{"key":"7_CR25","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-030-52246-9_6","volume-title":"Intelligent Computing","author":"SM Omran","year":"2020","unstructured":"Omran, S.M., El-Behaidy, W.H., Youssif, A.A.A.: Decomposition based multi-objectives evolutionary algorithms challenges and circumvention. In: Arai, K., Kapoor, S., Bhatia, R. (eds.) SAI 2020. AISC, vol. 1229, pp. 82\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52246-9_6"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Fonseca, V.G.D.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67540-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T13:26:48Z","timestamp":1619270808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67540-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030675394","9783030675400"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67540-0_7","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/collaboratecom.eai-conferences.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy+","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}