{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T10:46:39Z","timestamp":1760438799967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876715"},{"type":"electronic","value":"9783030876722"}],"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-87672-2_1","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Integrated Planning, Scheduling, Yard Allocation and Berth Allocation Problem in Bulk Ports: Model and Heuristics"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o Luiz Marques","family":"de Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo Campos","family":"Menezes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cie.2010.12.018","volume":"60","author":"VH Barros","year":"2011","unstructured":"Barros, V.H., Costa, T.S., Oliveira, A.C., Lorena, L.A.: Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Comput. Ind. Eng. 60(4), 606\u2013613 (2011). https:\/\/doi.org\/10.1016\/j.cie.2010.12.018","journal-title":"Comput. Ind. Eng."},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Cheimanoff, N., Fontane, F., Kitri, M.N., Tchernev, N.: A reduced vns based approach for the dynamic continuous berth allocation problem in bulk terminals with tidal constraints. Expert Syst. Appl. 168,(2021). https:\/\/doi.org\/10.1016\/j.eswa.2020.114215","DOI":"10.1016\/j.eswa.2020.114215"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.eswa.2017.06.010","volume":"87","author":"AD de Le\u00f3n","year":"2017","unstructured":"de Le\u00f3n, A.D., Lalla-Ruiz, E., Meli\u00e1n-Batista, B., Marcos Moreno-Vega, J.: A machine learning-based system for berth scheduling at bulk terminals. Expert Syst. Appl. 87, 170\u2013182 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.06.010","journal-title":"Expert Syst. Appl."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"de Le\u00f3n, A.D., Lalla-Ruiz, E., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: A simulation-optimization framework for enhancing robustness in bulk berth scheduling. Eng. Appl. Artif. Intell. 103,(2021). https:\/\/doi.org\/10.1016\/j.engappai.2021.104276","DOI":"10.1016\/j.engappai.2021.104276"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Ernst, A.T., O\u011fuz, C., Singh, G., Taherkhani, G.: Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 1\u201315 (2017). https:\/\/doi.org\/10.1007\/s10951-017-0510-8","DOI":"10.1007\/s10951-017-0510-8"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23\u201347 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0395-5","DOI":"10.1007\/s10107-003-0395-5"},{"key":"1_CR7","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI (1995)"},{"issue":"11","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1080\/0951192X.2012.684707","volume":"25","author":"D Hu","year":"2012","unstructured":"Hu, D., Yao, Z.: Stacker-reclaimer scheduling in a dry bulk terminal. Int. J. Comput. Integr. Manuf. 25(11), 1047\u20131058 (2012). https:\/\/doi.org\/10.1080\/0951192X.2012.684707","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2016.04.007","volume":"97","author":"GC Menezes","year":"2016","unstructured":"Menezes, G.C., Mateus, G.R., Ravetti, M.G.: A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal. Comput. Ind. Eng. 97, 1\u201314 (2016). https:\/\/doi.org\/10.1016\/j.cie.2016.04.007","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1016\/j.ejor.2016.08.073","volume":"258","author":"GC Menezes","year":"2017","unstructured":"Menezes, G.C., Mateus, G.R., Ravetti, M.G.: A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports. Eur. J. Oper. Res. 258(3), 926\u2013937 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.08.073","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2013.08.015","volume":"235","author":"T Robenek","year":"2014","unstructured":"Robenek, T., Umang, N., Bierlaire, M., Ropke, S.: A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. Eur. J. Oper. Res. 235(2), 399\u2013411 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.08.015","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Rocha de Paula, M., Boland, N., Ernst, A.T., Mendes, A., Savelsbergh, M.: Throughput optimisation in a coal export system with multiple terminals and shared resources. Comput. Ind. Eng. 134, 37\u201351 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.05.021","DOI":"10.1016\/j.cie.2019.05.021"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","volume":"31","author":"R Sadykov","year":"2019","unstructured":"Sadykov, R., Vanderbeck, F., Pessoa, A., Tahiri, I., Uchoa, E.: Primal heuristics for branch and price: the assets of diving methods. INFORMS J. Comput. 31(2), 251\u2013267 (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0822","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1080\/0740817X.2015.1063791","volume":"48","author":"L Tang","year":"2016","unstructured":"Tang, L., Sun, D., Liu, J.: Integrated storage space allocation and ship scheduling problem in bulk cargo terminals. IIE Trans. 48(5), 428\u2013439 (2016). https:\/\/doi.org\/10.1080\/0740817X.2015.1063791","journal-title":"IIE Trans."},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Umang, N., Bierlaire, M., Vacca, I.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. Part E: Logistics Transp. Rev. 54 (07 2013). https:\/\/doi.org\/10.1016\/j.tre.2013.03.003","DOI":"10.1016\/j.tre.2013.03.003"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Unsal, O.: Reclaimer scheduling in dry bulk terminals. IEEE Access 1 (05 2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2997739","DOI":"10.1109\/ACCESS.2020.2997739"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Unsal, O., O\u011fuz, C.: An exact algorithm for integrated planning of operations in dry bulk terminals. Transp. Res. Part E: Logistics Transp. Rev. 126, 103\u2013121 (2019). https:\/\/doi.org\/10.1016\/j.tre.2019.03.018","DOI":"10.1016\/j.tre.2019.03.018"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:04:13Z","timestamp":1632258253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","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":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"111","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":"42","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":"38% - 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":"2.5","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)"}}]}}