{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:56:00Z","timestamp":1742961360578,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030595050"},{"type":"electronic","value":"9783030595067"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-59506-7_11","type":"book-chapter","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T23:07:55Z","timestamp":1602112075000},"page":"129-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Genetic Optimization Approach to Construct Schedule for Service Staff"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4185-0397","authenticated-orcid":false,"given":"Dalia","family":"\u010calneryt\u0117","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrius","family":"Kri\u0161\u010di\u016bnas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rimantas","family":"Barauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,8]]},"reference":[{"key":"11_CR1","unstructured":"Abdennadher, S., Schlenker, H.: Nurse scheduling using constraint logic programming. In: Sixth National Conference on Artificial Intelligence, AAAI, pp. 838\u2013843 (1999)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cie.2017.05.027","volume":"110","author":"Z Zheng","year":"2017","unstructured":"Zheng, Z., Liu, X., Gong, X.: A simple randomized variable neighbourhood search for nurse rostering. Comput. Ind. Eng. 110, 165\u2013174 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"11_CR3","first-page":"151","volume":"2018","author":"CC Lin","year":"2017","unstructured":"Lin, C.C., Hung, L.P., Liu, W.Y., Tsai, M.C.: Jointly rostering, routing, and rerostering for home health care services: a harmony search approach with genetic, saturation, inheritance, and immigrant schemes. Comput. Ind. Eng. 2018, 151\u2013166 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"846","DOI":"10.3923\/jas.2013.846.853","volume":"13","author":"M Ayob","year":"2013","unstructured":"Ayob, M., Hadwan, M., Nazri, M.Z.A., Ahmad, Z.: Enhanced harmony search algorithm for nurse rostering problems. J Appl Sci. 13(6), 846\u2013853 (2013)","journal-title":"J Appl Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.sbspro.2012.09.783","volume":"54","author":"L Xie","year":"2012","unstructured":"Xie, L., Kliewer, N., Suhl, L.: Integrated driver rostering problem in public bus transit. Procedia Soc. Behav. Sci. 54, 656\u2013665 (2012)","journal-title":"Procedia Soc. Behav. Sci."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ejor.2017.11.046","volume":"267","author":"T Doi","year":"2017","unstructured":"Doi, T., Nishi, T., Vo\u00df, S.: Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time. Eur. J. Oper. Res. 267, 428\u2013438 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.ejor.2010.11.017","volume":"210","author":"P Brucker","year":"2011","unstructured":"Brucker, P., Qu, R., Burke, E.: Personnel scheduling: models and complexity. Eur. J. Oper. Res. 210(3), 467\u2013473 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ejor.2014.01.035","volume":"237","author":"SW Lin","year":"2014","unstructured":"Lin, S.W., Ying, K.C.: Minimizing shifts for personnel task scheduling problems: a three-phase algorithm. Eur. J. Oper. Res. 237(1), 323\u2013334 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2015.08.025","volume":"249","author":"P Smet","year":"2016","unstructured":"Smet, P., Brucker, P., De Causmaecker, P., Vanden, B.G.: Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1), 67\u201375 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A Ernst","year":"2004","unstructured":"Ernst, A., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3\u201327 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0377-2217(03)00387-4","volume":"158","author":"I Bl\u00f6chliger","year":"2004","unstructured":"Bl\u00f6chliger, I.: Modeling staff scheduling problems. A tutorial. Eur. J. Oper. Res. 158(3), 533\u2013542 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2016.05.016","volume":"76","author":"P Smet","year":"2016","unstructured":"Smet, P., Ernst, A.T., Vanden, B.G.: Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. Comput. Oper. Res. 76, 60\u201372 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.tre.2009.11.008","volume":"46","author":"R Stolletz","year":"2010","unstructured":"Stolletz, R.: Operational workforce planning for check-in counters at airports. Transp. Res. Part E Logist. Transp. Rev. 46(3), 414\u2013425 (2010)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"1\u20134","key":"11_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1018992120116","volume":"72","author":"D Dowling","year":"1997","unstructured":"Dowling, D., Krishnamoorthy, M., Macketizie, H., Sier, D.: Staff rostering at a large international airport. Ann. Oper. Res. 72(1\u20134), 125\u2013147 (1997)","journal-title":"Ann. Oper. Res."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Xue, N., Landa-Silva, D., Triguero, I., Figueredo, G.P.: A genetic algorithm with composite chromosome for shift assignment of part-time employees. In: 2018 IEEE Congress on Evolutionary Computation CEC 2018 \u2013 Proceedings, pp. 1\u20138 (2018)","DOI":"10.1109\/CEC.2018.8477818"},{"issue":"2","key":"11_CR16","first-page":"241","volume":"5","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Suhl, L., Thiel, M.P.: Solving the airline crew recovery problem by a genetic algorithm with local improvement. Oper. Res. 5(2), 241\u2013259 (2005)","journal-title":"Oper. Res."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2007.10.065","volume":"199","author":"N Souai","year":"2009","unstructured":"Souai, N., Teghem, J.: Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem. Eur. J. Oper. Res. 199(3), 674\u2013683 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.omega.2015.04.002","volume":"58","author":"M Defraeye","year":"2016","unstructured":"Defraeye, M., Van Nieuwenhuyse, I.: Staffing and scheduling under nonstationary demand for service: a literature review. Omega 58, 4\u201325 (2016)","journal-title":"Omega"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59506-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T23:09:33Z","timestamp":1602112173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59506-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030595050","9783030595067"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59506-7_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Software Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaunas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","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":"15 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icist2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icist.ktu.edu\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"23","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":"7","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":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}