{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T21:57:27Z","timestamp":1769551047305,"version":"3.49.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030878962","type":"print"},{"value":"9783030878979","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-87897-9_31","type":"book-chapter","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T17:23:18Z","timestamp":1633454598000},"page":"342-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ant-Based Hyper-Heuristics for the Movie Scene Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8673-2453","authenticated-orcid":false,"given":"Emilio","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3902-5582","authenticated-orcid":false,"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1207\/s15405710pc0403_4","volume":"4","author":"E Aarseth","year":"2006","unstructured":"Aarseth, E.: The culture and business of cross-media productions. Pop. Commun. 4(3), 203\u2013211 (2006). https:\/\/doi.org\/10.1207\/s15405710pc0403_4","journal-title":"Pop. Commun."},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Garcia de la Banda, M., Stuckey, P., Chu, G.: Solving talent scheduling with dynamic programming. INFORMS J. Comput. 23, 120\u2013137 (2011). https:\/\/doi.org\/10.1287\/ijoc.1090.0378","DOI":"10.1287\/ijoc.1090.0378"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF00940554","volume":"79","author":"TCE Cheng","year":"1993","unstructured":"Cheng, T.C.E., Diamond, J., Lin, B.: Optimal scheduling in film production to minimize talent hold cost. J. Optim. Theory Appl. 79, 479\u2013492 (1993). https:\/\/doi.org\/10.1007\/BF00940554","journal-title":"J. Optim. Theory Appl."},{"key":"31_CR4","unstructured":"Gambardella, L.M., Dorigo, M.: Solving symmetric and asymmetric TSPS by ant colonies. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 622\u2013627 (1996)"},{"key":"31_CR5","unstructured":"Gregory, P., Miller, A., Prosser, P.: Solving the rehearsal problem with planning and with model checking. In: European Conference on Artificial Intelligence, vol. 16 (2004)"},{"issue":"6","key":"31_CR6","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.physa.2011.12.004","volume":"391","author":"A Lipowski","year":"2012","unstructured":"Lipowski, A., Lipowska, D.: Roulette-wheel selection via stochastic acceptance. Phys. A 391(6), 2193\u20132196 (2012)","journal-title":"Phys. A"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Liu, Y., Sun, Q., Zhang, X., Wu, Y.: Research on the scheduling problem of movie scenes. Discrete Dyn. Nat. Soc. 2019, 1\u20138 (2019)","DOI":"10.1155\/2019\/3737105"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"59091","DOI":"10.1109\/ACCESS.2020.2982664","volume":"8","author":"X Long","year":"2020","unstructured":"Long, X., Jinxing, Z.: Scheduling problem of movie scenes based on three meta-heuristic algorithms. IEEE Access 8, 59091\u201359099 (2020)","journal-title":"IEEE Access"},{"key":"31_CR9","first-page":"927","volume":"21","author":"A Nordstrom","year":"1994","unstructured":"Nordstrom, A., Tufekci, S.: A genetic algorithm for the talent scheduling problem. Comput. Ind. Eng. 21, 927\u2013940 (1994)","journal-title":"Comput. Ind. Eng."},{"key":"31_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96514-7","volume-title":"Hyper-Heuristics: Theory and Applications","author":"N Pillay","year":"2018","unstructured":"Pillay, N., Qu, R.: Hyper-Heuristics: Theory and Applications. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96514-7"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.cie.2013.12.017","volume":"70","author":"N Sakulsom","year":"2014","unstructured":"Sakulsom, N., Tharmmaphornphilas, W.: Scheduling a music rehearsal problem with unequal music piece length. Comput. Ind. Eng. 70, 20\u201330 (2014)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87897-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T17:35:50Z","timestamp":1633455350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87897-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030878962","9783030878979"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87897-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc2021.icaisc.eu\/","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":"Own Online System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"195","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":"89","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":"0","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":"46% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}