{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:57:48Z","timestamp":1743091068168,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496615"},{"type":"electronic","value":"9783031496622"}],"license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49662-2_2","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:03:00Z","timestamp":1702558980000},"page":"26-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the Non-value Task Times: A Pickup and Delivery Problem with Two-Dimensional Bin-Packing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6076-6612","authenticated-orcid":false,"given":"B\u00e1rbara","family":"Romeira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4687-2747","authenticated-orcid":false,"given":"Ana","family":"Moura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Romeira, B., Moura, A.: Optimizing route planning for minimising the non-added-value tasks times: a simultaneous pickup-and-delivery problem. In: 11th International Conference on Operations Research and Enterprise Systems, pp. 153\u201360 (2022). https:\/\/doi.org\/10.5220\/0010821000003117","DOI":"10.5220\/0010821000003117"},{"key":"2_CR2","first-page":"268","volume":"51","author":"N Wang","year":"2021","unstructured":"Wang, N., Wang, J.-S., Zhang, Y.-X., Li, T.-Z.: Two-dimensional Bin-packing problem with rectangular and circular regions solved by genetic algorithm. Int. J. Appl. Math. 51, 268\u2013278 (2021)","journal-title":"Int. J. Appl. Math."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle. T.: 1-Introduction. In: Stochastic Local Search, pp. 13\u201359. Morgan Kaufmann, Burlington (2005)","DOI":"10.1016\/B978-155860872-6\/50018-4"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/S00291-020-00610-Z","volume":"43","author":"Q Zhang","year":"2020","unstructured":"Zhang, Q., Liu, S., Zhang, R., Qin, S.: Column generation algorithms for mother plate design in steel plants. OR Spectr. 43, 127\u2013153 (2020). https:\/\/doi.org\/10.1007\/S00291-020-00610-Z","journal-title":"OR Spectr."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/J.EJOR.2020.09.023","volume":"291","author":"C Arbib","year":"2021","unstructured":"Arbib, C., Marinelli, F., Pizzuti, A.: Number of bins and maximum lateness minimization in two-dimensional bin packing. Eur. J. Oper. Res. 291, 101\u2013113 (2021). https:\/\/doi.org\/10.1016\/J.EJOR.2020.09.023","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A Lodi","year":"2004","unstructured":"Lodi, A., Martello, S., Vigo, D.: Models and bounds for two-dimensional level packing problems. J. Comb. Optim. 8, 363\u2013379 (2004). https:\/\/doi.org\/10.1023\/B:JOCO.0000038915.62826.79","journal-title":"J. Comb. Optim."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/J.IJPE.2013.04.040","volume":"145","author":"JA Bennell","year":"2013","unstructured":"Bennell, J.A., Soon Lee, L., Potts, C.N.: A genetic algorithm for two-dimensional bin packing with due dates. Int. J. Prod. Econ. 145, 547\u2013560 (2013). https:\/\/doi.org\/10.1016\/J.IJPE.2013.04.040","journal-title":"Int. J. Prod. Econ."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/J.EJOR.2017.10.046","volume":"266","author":"S Polyakovskiy","year":"2018","unstructured":"Polyakovskiy, S., M\u2019Hallah, R.: A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur. J. Oper. Res. 266, 819\u2013839 (2018). https:\/\/doi.org\/10.1016\/J.EJOR.2017.10.046","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/MNSC.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manage. Sci. 44, 388\u2013399 (1998). https:\/\/doi.org\/10.1287\/MNSC.44.3.388","journal-title":"Manage. Sci."},{"key":"2_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/S11081-021-09673-5","author":"PRV de Carvalho","year":"2021","unstructured":"de Carvalho, P.R.V., Elhedhli, S.: A data-driven approach for mixed-case palletization with support. Optim. Eng. (2021). https:\/\/doi.org\/10.1007\/S11081-021-09673-5","journal-title":"Optim. Eng."},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/S00291-021-00628-X","author":"K He\u00dfler","year":"2021","unstructured":"He\u00dfler, K., Irnich, S., Kreiter, T., Pferschy, U.: Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR Spectr. (2021). https:\/\/doi.org\/10.1007\/S00291-021-00628-X","journal-title":"OR Spectr."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/J.EJOR.2019.08.024","volume":"281","author":"L Wei","year":"2020","unstructured":"Wei, L., Lai, M., Lim, A., Hu, Q.: A branch-and-price algorithm for the two-dimensional vector packing problem. Eur. J. Oper. Res. 281, 25\u201335 (2020). https:\/\/doi.org\/10.1016\/J.EJOR.2019.08.024","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/J.OMEGA.2014.07.004","volume":"50","author":"Q Hu","year":"2015","unstructured":"Hu, Q., Lim, A., Zhu, W.: The two-dimensional vector packing problem with piecewise linear cost function. Omega 50, 43\u201353 (2015). https:\/\/doi.org\/10.1016\/J.OMEGA.2014.07.004","journal-title":"Omega"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/J.DISOPT.2005.01.002","volume":"2","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D., Sigurd, M.: The two-dimensional bin packing problem with variable bin sizes and costs. Discret. Optim. 2, 154\u2013167 (2005). https:\/\/doi.org\/10.1016\/J.DISOPT.2005.01.002","journal-title":"Discret. Optim."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/J.EJOR.2021.10.011","volume":"300","author":"T Wang","year":"2022","unstructured":"Wang, T., Hu, Q., Lim, A.: An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs. Eur. J. Oper. Res. 300, 20\u201334 (2022). https:\/\/doi.org\/10.1016\/J.EJOR.2021.10.011","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/JORS.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38, 423\u2013429 (1987). https:\/\/doi.org\/10.1057\/JORS.1987.70","journal-title":"J. Oper. Res. Soc."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1093\/COMJNL\/25.3.353","volume":"25","author":"BE Bengtsson","year":"1982","unstructured":"Bengtsson, B.E.: Packing rectangular pieces\u2014a heuristic approach. Comput. J. 25, 353\u2013357 (1982). https:\/\/doi.org\/10.1093\/COMJNL\/25.3.353","journal-title":"Comput. J."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/OPRE.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25, 30\u201344 (1977). https:\/\/doi.org\/10.1287\/OPRE.25.1.30","journal-title":"Oper. Res."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/JORS.1985.51","volume":"36","author":"JE Beasley","year":"2017","unstructured":"Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36, 297\u2013306 (2017). https:\/\/doi.org\/10.1057\/JORS.1985.51","journal-title":"J. Oper. Res. Soc."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret. Appl. Math. 111, 231\u2013262 (2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00267-5","journal-title":"Discret. Appl. Math."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/J.EJOR.2013.08.011","volume":"233","author":"C Alves","year":"2014","unstructured":"Alves, C., De Carvalho, J.V., Clautiaux, F., Rietz, J.: Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur. J. Oper. Res. 233, 43\u201363 (2014). https:\/\/doi.org\/10.1016\/J.EJOR.2013.08.011","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"5266","DOI":"10.1016\/J.ESWA.2013.03.037","volume":"40","author":"R Masson","year":"2013","unstructured":"Masson, R., Vidal, T., Michallet, J., Penna, P.H.V., Petrucci, V., Subramanian, A., et al.: An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst. Appl. 40, 5266\u20135275 (2013). https:\/\/doi.org\/10.1016\/J.ESWA.2013.03.037","journal-title":"Expert Syst. Appl."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/J.COR.2016.06.009","volume":"76","author":"M Buljuba\u0161i\u0107","year":"2016","unstructured":"Buljuba\u0161i\u0107, M., Vasquez, M.: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput. Oper. Res. 76, 12\u201321 (2016). https:\/\/doi.org\/10.1016\/J.COR.2016.06.009","journal-title":"Comput. Oper. Res."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/J.EJOR.2016.12.021","volume":"260","author":"Q Hu","year":"2017","unstructured":"Hu, Q., Zhu, W., Qin, H., Lim, A.: A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. Eur. J. Oper. Res. 260, 70\u201380 (2017). https:\/\/doi.org\/10.1016\/J.EJOR.2016.12.021","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/IJOC.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11, 345\u2013357 (1999). https:\/\/doi.org\/10.1287\/IJOC.11.4.345","journal-title":"INFORMS J. Comput."},{"key":"2_CR26","unstructured":"Romeira, B., Cunha, F., Moura, A.: Development and application of an e-Kanban system in the automotive industry. In: IEOM Monterrey 2021 Conference, pp. 613\u2013624 (2021)"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49662-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:03:29Z","timestamp":1702559009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49662-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"ISBN":["9783031496615","9783031496622"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49662-2_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icores.scitevents.org\/?y=2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}