{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:33:49Z","timestamp":1776976429442,"version":"3.51.4"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030904241","type":"print"},{"value":"9783030904258","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-90425-8_9","type":"book-chapter","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T07:05:02Z","timestamp":1635923102000},"page":"109-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ant-Based Generation Constructive 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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3902-5582","authenticated-orcid":false,"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"issue":"3","key":"9_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":"9_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":"9_CR3","doi-asserted-by":"publisher","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","DOI":"10.1007\/BF00940554"},{"key":"9_CR4","unstructured":"Gregory, P., Miller, A., Prosser, P.: Solving the rehearsal problem with planning and with model checking. Eur. Conf. Artif. Intell. 16, 157\u2013171 (2004)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Liu, Y., Sun, Q., Zhang, X., Wu, Y.: Research on the scheduling problem of movie scenes. Discret. Dyn. Nat. Soc. 2019, 1\u20138 (2019). Article ID 3737105","DOI":"10.1155\/2019\/3737105"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Long, X., Jinxing, Z.: Scheduling problem of movie scenes based on three meta-heuristic algorithms. IEEE Access PP, 59091\u201359099 (2020)","DOI":"10.1109\/ACCESS.2020.2982664"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18(1), 50\u201360 (1947)","journal-title":"Ann. Math. Stat."},{"key":"9_CR8","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":"9_CR9","doi-asserted-by":"crossref","unstructured":"Sakulsom, N., Tharmmaphornphilas, W.: Scheduling a music rehearsal problem with unequal music piece length. Comput. Ind. Eng. 70, 20\u201330 (2014)","DOI":"10.1016\/j.cie.2013.12.017"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Singh, E., Pillay, N.: A comparison of ant-based pheromone spaces for generation constructive hyper-heuristics. Under Review (2021)","DOI":"10.2139\/ssrn.4156569"},{"key":"9_CR11","unstructured":"Singh, E., Pillay, N.: Haco: Supplementary material (2021). https:\/\/drive.google.com\/file\/d\/1DHtMBkwTfT-h4sEIYsqa7-Nx9rD31sMZ\/view?usp=sharing"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Singh, E., Pillay, N.: Ant-based hyper-heuristics for the movie scene scheduling problem. In: Proceedings 2021 ICAISC International Conference for Artificial Intelligence and Soft Computing (To appear June 2021)","DOI":"10.1007\/978-3-030-87897-9_31"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90425-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:14:28Z","timestamp":1710242068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90425-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904241","9783030904258"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90425-8_9","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":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tsukuba","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/tpnc2020-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"14","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":"9","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":"64% - 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":"2","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)"}}]}}