{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:59:34Z","timestamp":1740182374798,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:00:00Z","timestamp":1723248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:00:00Z","timestamp":1723248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100013406","name":"Aerospace Technology Institute","doi-asserted-by":"publisher","award":["113174","113174","113174"],"award-info":[{"award-number":["113174","113174","113174"]}],"id":[{"id":"10.13039\/100013406","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006041","name":"Innovate UK","doi-asserted-by":"publisher","award":["113174","113174","113174"],"award-info":[{"award-number":["113174","113174","113174"]}],"id":[{"id":"10.13039\/501100006041","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an NP-complete problem. A case study of an aerospace manufacturing company is used to illustrate the TOP which successfully automated the manual process in the company and resulted in significant cost reductions and flexibility in the building process.<\/jats:p>","DOI":"10.1007\/s43069-024-00354-4","type":"journal-article","created":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T07:02:32Z","timestamp":1723273352000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trolley Optimisation for Loading Printed Circuit Board Components"],"prefix":"10.1007","volume":"5","author":[{"given":"Vinod Kumar","family":"Chauhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Bass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajith Kumar","family":"Parlikad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Brintrup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,10]]},"reference":[{"key":"354_CR1","unstructured":"Chapter 8 bin packing. https:\/\/ac.informatik.uni-freiburg.de\/lak_teaching\/ws11_12\/combopt\/notes\/bin_packing.pdf. Accessed 20 Aug 2023"},{"issue":"2","key":"354_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1287\/opre.36.2.176","volume":"36","author":"Javad Ahmadi","year":"1988","unstructured":"Ahmadi Javad, Grotzinger Stephen, Johnson Dennis (1988) Component allocation and partitioning for a dual delivery placement machine. Operations Research 36(2):176\u2013191","journal-title":"Operations Research"},{"key":"354_CR3","doi-asserted-by":"crossref","unstructured":"Nur\u015fen Ayd\u0131n, \u0130brahim Muter, and \u015e\u00a0\u0130lker Birbil. Multi-objective temporal bin packing problem: an application in cloud computing. Computers & Operations Research, 121:104959, 2020","DOI":"10.1016\/j.cor.2020.104959"},{"key":"354_CR4","doi-asserted-by":"crossref","unstructured":"Edmund\u00a0K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender \u00d6zcan, and Rong Qu. Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society, 64(12):1695\u20131724, 2013","DOI":"10.1057\/jors.2013.71"},{"key":"354_CR5","doi-asserted-by":"crossref","unstructured":"Marco Castellani, Sameh Otri, and Duc\u00a0Truong Pham. Printed circuit board assembly time minimisation using a novel bees algorithm. Computers & Industrial Engineering, 133:186\u2013194, 2019","DOI":"10.1016\/j.cie.2019.05.015"},{"key":"354_CR6","doi-asserted-by":"crossref","unstructured":"Vinod\u00a0Kumar Chauhan, Muhannad Alomari, James Arney, Ajith\u00a0Kumar Parlikad, and Alexandra Brintrup. Exploitation of material consolidation trade-offs in multi-tier complex supply networks. Supply Chain Analytics, 4:100050, 2023","DOI":"10.1016\/j.sca.2023.100050"},{"issue":"1","key":"354_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"Maxence Delorme","year":"2016","unstructured":"Delorme Maxence, Iori Manuel, Martello Silvano (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. European Journal of Operational Research 255(1):1\u201320","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"354_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11590-017-1192-z","volume":"12","author":"Maxence Delorme","year":"2018","unstructured":"Delorme Maxence, Iori Manuel, Martello Silvano (2018) BPPLIB: a library for bin packing and cutting stock problems. Optimization Letters 12(2):235\u2013250","journal-title":"Optimization Letters"},{"key":"354_CR9","doi-asserted-by":"crossref","unstructured":"Zvi Drezner and Shimon\u00a0Y Nof. On optimizing bin picking and insertion plans for assembly robots. IIE transactions, 16(3):262\u2013270, 1984","DOI":"10.1080\/07408178408974693"},{"key":"354_CR10","doi-asserted-by":"crossref","unstructured":"Kimberly\u00a0P Ellis and Sudeer Bhoja. Optimization of the assignment of circuit cards to assembly lines in electronics assembly. International Journal of Production Research, 40(11):2609\u20132631, 2002","DOI":"10.1080\/00207540210135604"},{"key":"354_CR11","doi-asserted-by":"crossref","unstructured":"Huijun Gao, Zhengkai Li, Xinghu Yu, and Jianbin Qiu. Hierarchical multiobjective heuristic for PCB assembly optimization in a beam-head surface mounter. IEEE Transactions on Cybernetics, 2021","DOI":"10.1109\/TCYB.2020.3040788"},{"issue":"4\u20136","key":"354_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1504\/IJCAT.2001.000268","volume":"14","author":"Ping Ji","year":"2001","unstructured":"Ji Ping, Wan YF (2001) Planning for printed circuit board assembly: the state-of-the-art review. International Journal of Computer Applications in Technology 14(4\u20136):136\u2013144","journal-title":"International Journal of Computer Applications in Technology"},{"key":"354_CR13","doi-asserted-by":"crossref","unstructured":"Leonid\u00a0V Kantorovich. Mathematical methods of organizing and planning production. Management science, 6(4):366\u2013422, 1960","DOI":"10.1287\/mnsc.6.4.366"},{"key":"354_CR14","doi-asserted-by":"crossref","unstructured":"Jani Koskinen, Csaba Raduly-Baka, Mika Johnsson, and Olli\u00a0S Nevalainen. Rolling horizon production scheduling of multi-model PCBs for several assembly lines. International Journal of Production Research, 58(4):1052\u20131073, 2020","DOI":"10.1080\/00207543.2019.1609708"},{"key":"354_CR15","doi-asserted-by":"crossref","unstructured":"Aline\u00a0AS Leao, Franklina\u00a0MB Toledo, Jos\u00e9\u00a0Fernando Oliveira, Maria\u00a0Ant\u00f3nia Carravilla, and Ram\u00f3n Alvarez-Vald\u00e9s. Irregular packing problems: a review of mathematical models. European Journal of Operational Research, 282(3):803\u2013822, 2020","DOI":"10.1016\/j.ejor.2019.04.045"},{"key":"354_CR16","doi-asserted-by":"crossref","unstructured":"Debiao Li, Tian He, and Sang\u00a0Won Yoon. Clustering-based heuristic to optimize nozzle and feeder assignments for collect-and-place assembly. IEEE Transactions on Automation Science and Engineering, 16(2):755\u2013766, 2018","DOI":"10.1109\/TASE.2018.2855099"},{"issue":"11","key":"354_CR17","doi-asserted-by":"publisher","first-page":"3193","DOI":"10.1080\/00207543.2014.965851","volume":"53","author":"Yi-Kuei Lin","year":"2015","unstructured":"Lin Yi-Kuei, Chang Ping-Chen (2015) Demand satisfaction and decision-making for a PCB manufacturing system with production lines in parallel. International Journal of Production Research 53(11):3193\u20133206","journal-title":"International Journal of Production Research"},{"issue":"2","key":"354_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"Silvano Martello","year":"2000","unstructured":"Martello Silvano, Pisinger David, Vigo Daniele (2000) The three-dimensional bin packing problem. Operations research 48(2):256\u2013267","journal-title":"Operations research"},{"key":"354_CR19","doi-asserted-by":"publisher","first-page":"18685","DOI":"10.1109\/ACCESS.2019.2895954","volume":"7","author":"Jabir Mumtaz","year":"2019","unstructured":"Mumtaz Jabir, Guan Zailin, Yue Lei, Wang Zhengya, Ullah Saif, Rauf Mudassar (2019) Multi-level planning and scheduling for parallel PCB assembly lines using hybrid spider monkey optimization approach. Ieee Access 7:18685\u201318700","journal-title":"Ieee Access"},{"key":"354_CR20","doi-asserted-by":"crossref","unstructured":"Laurent Perron. Operations research and constraint programming at google. In: International conference on principles and practice of constraint programming, pages 2\u20132. Springer, 2011","DOI":"10.1007\/978-3-642-23786-7_2"},{"key":"354_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106115","volume":"138","author":"Wei Qin","year":"2019","unstructured":"Qin Wei, Zhuang Zilong, Liu Yang, Tang Ou (2019) A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Computers & Industrial Engineering 138:106115","journal-title":"Computers & Industrial Engineering"},{"key":"354_CR22","unstructured":"Aaron Stayer. Simulation based sequencing and batch size analysis on a high-mix low-volume production system using DMAIC. State University of New York at Binghamton, 2011"},{"issue":"3","key":"354_CR23","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"Gerhard W\u00e4scher","year":"2007","unstructured":"W\u00e4scher Gerhard, Hau\u00dfner Heike, Schumann Holger (2007) An improved typology of cutting and packing problems. European Journal of Operational Research 183(3):1109\u20131130","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"354_CR24","first-page":"1189","volume":"43","author":"Wu Yongzhong","year":"2009","unstructured":"Yongzhong Wu, Ji Ping (2009) A scheduling problem for PCB assembly: a case with multiple lines. The International Journal of Advanced Manufacturing Technology 43(11):1189\u20131201","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"354_CR25","doi-asserted-by":"publisher","first-page":"108928","DOI":"10.1016\/j.cie.2022.108928","volume":"176","author":"VK Chauhan","year":"2023","unstructured":"Chauhan VK, Mak S, Parlikad AK, Alomari M, Casassa L, Brintrup A (2023) Real-time large-scale supplier order assignments across two-tiers of a supply chain with penalty and dual-sourcing. Computers & Industrial Engineering 176:108928","journal-title":"Computers & Industrial Engineering"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00354-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00354-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00354-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:09:40Z","timestamp":1728565780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00354-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,10]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00354-4","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,8,10]]},"assertion":[{"value":"20 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"72"}}