{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:59:27Z","timestamp":1743152367402,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030387518"},{"type":"electronic","value":"9783030387525"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38752-5_24","type":"book-chapter","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T15:02:41Z","timestamp":1578409361000},"page":"302-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single Runway Aircraft Landing Scheduling Using Simulated Annealing and Exact Timing Method"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2796-016X","authenticated-orcid":false,"given":"Abdulrahman","family":"Jassam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4766-8422","authenticated-orcid":false,"given":"Omar Salim","family":"Abdullah","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0037-841X","authenticated-orcid":false,"given":"Salwani","family":"Abdullah","sequence":"additional","affiliation":[]},{"given":"Atheer","family":"Bassel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,8]]},"reference":[{"key":"24_CR1","unstructured":"Al-Betar, M.A., Khader, A.T.: A hybrid harmony search for university course timetabling. In: Proceedings of the 4th Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, pp. 157\u2013179 (2009)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.asoc.2016.04.011","volume":"44","author":"BS Girish","year":"2016","unstructured":"Girish, B.S.: An efficient hybrid particle swarm optimization algorithm in a rolling horizon framework for the aircraft landing problem. Appl. Soft Comput. 44, 200\u2013221 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"JE Beasley","year":"2000","unstructured":"Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling aircraft landings\u2014the static case. Transp. Sci. 34(2), 180\u2013197 (2000)","journal-title":"Transp. Sci."},{"issue":"33","key":"24_CR4","doi-asserted-by":"publisher","first-page":"3080","DOI":"10.1016\/j.cma.2008.02.006","volume":"197","author":"M Fesanghary","year":"2008","unstructured":"Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., Alizadeh, Y.: Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Comput. Methods Appl. Mech. Eng. 197(33), 3080\u20133091 (2008)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10845-014-0869-8","volume":"27","author":"KZ Gao","year":"2016","unstructured":"Gao, K.Z., Suganthan, P.N., Pan, Q.K., Chua, T.J., Cai, T.X., Chong, C.S.: Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intell. Manuf. 27(2), 363\u2013374 (2016)","journal-title":"J. Intell. Manuf."},{"key":"24_CR6","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04317-8_1","volume-title":"Recent Advances in Harmony Search Algorithm","author":"ZW Geem","year":"2010","unstructured":"Geem, Z.W.: State-of-the-art in the structure of harmony search algorithm. In: Geem, Z.W. (ed.) Recent Advances in Harmony Search Algorithm. SCI, vol. 270, pp. 1\u201310. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04317-8_1"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.asoc.2016.12.011","volume":"51","author":"NS Jaddi","year":"2017","unstructured":"Jaddi, N.S., Abdullah, S.: A cooperative-competitive master-slave global-best harmony search for ANN optimization and water-quality prediction. Appl. Soft Comput. 51, 209\u2013224 (2017)","journal-title":"Appl. Soft Comput."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-27242-4_10","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"OM Alia","year":"2011","unstructured":"Alia, O.M., Al-Betar, M.A., Mandava, R., Khader, A.T.: Data clustering using harmony search algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds.) SEMCCO 2011. LNCS, vol. 7077, pp. 79\u201388. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-27242-4_10"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2004.09.040","volume":"171","author":"H Pinol","year":"2006","unstructured":"Pinol, H., Beasley, J.E.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2), 439\u2013462 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"Sabar, N.R., Kendall, G.: An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56, 88\u201398 (2015)","journal-title":"Omega"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cor.2012.06.004","volume":"40","author":"A Salehipour","year":"2013","unstructured":"Salehipour, A., Modarres, M., Naeni, L.M.: An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1), 207\u2013213 (2013)","journal-title":"Comput. Oper. Res."},{"key":"24_CR12","first-page":"5","volume":"2015","author":"W Sun","year":"2015","unstructured":"Sun, W., Chang, X.: An improved harmony search algorithm for power distribution network planning. J. Electr. Comput. Eng. 2015, 5 (2015)","journal-title":"J. Electr. Comput. Eng."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ins.2014.02.084","volume":"272","author":"AM Turky","year":"2014","unstructured":"Turky, A.M., Abdullah, S.: A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf. Sci. 272, 84\u201395 (2014)","journal-title":"Inf. Sci."},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00500-014-1502-7","volume":"20","author":"GG Wang","year":"2016","unstructured":"Wang, G.G., Gandomi, A.H., Zhao, X., Chu, H.C.E.: Hybridizing harmony search algorithm with cuckoo search for global numerical optimization. Soft. Comput. 20(1), 273\u2013285 (2016)","journal-title":"Soft. Comput."},{"issue":"7","key":"24_CR15","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","volume":"13","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H., Yang, J.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13(7), 3259\u20133272 (2013)","journal-title":"Appl. Soft Comput."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.asoc.2015.12.028","volume":"41","author":"B Zeng","year":"2016","unstructured":"Zeng, B., Dong, Y.: An improved harmony search based energy-efficient routing algorithm for wireless sensor networks. Appl. Soft Comput. 41, 135\u2013147 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s00500-014-1556-6","volume":"20","author":"YJ Zheng","year":"2016","unstructured":"Zheng, Y.J., Zhang, M.X., Zhang, B.: Biogeographic harmony search for emergency air transportation. Soft. Comput. 20(3), 967\u2013977 (2016)","journal-title":"Soft. Comput."},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"}],"container-title":["Communications in Computer and Information Science","Applied Computing to Support Industry: Innovation and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38752-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T11:13:47Z","timestamp":1578654827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38752-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030387518","9783030387525"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38752-5_24","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 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACRIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Computing to Support Industry: Innovation and Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ramadi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iraq","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acrit2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acritt.org.uk\/wp\/acrit-conferences\/","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":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"159","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":"38","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":"1","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":"24% - 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)"}}]}}