{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T14:29:25Z","timestamp":1773239365290,"version":"3.50.1"},"reference-count":67,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cor.2026.107424","type":"journal-article","created":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T00:56:27Z","timestamp":1770684987000},"page":"107424","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The two-dimensional orthogonal packing problem with item fragmentation: Formulation and local search-based algorithms (applications on tank-farm layout planning)"],"prefix":"10.1016","volume":"190","author":[{"given":"Hamid","family":"Salamati-Hormozi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6004-6882","authenticated-orcid":false,"given":"Ali","family":"Husseinzadeh Kashan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8472-6244","authenticated-orcid":false,"given":"Bakhtiar","family":"Ostadi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107424_b0005","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.autcon.2018.11.021","article-title":"Dynamic facilities planning model for large scale construction projects","volume":"98","author":"Al Hawarneh","year":"2019","journal-title":"Autom. Constr."},{"key":"10.1016\/j.cor.2026.107424_b0010","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cie.2014.11.018","article-title":"Heuristic and genetic approach for nesting of two-dimensional rectangular shaped parts with common cutting edge concept for laser cutting and profile blanking processes","volume":"80","author":"Anand","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0015","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1007\/s10845-020-01603-z","article-title":"3D facility layout problem","volume":"32","author":"Besbes","year":"2021","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107424_b0020","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.2011.6","article-title":"Generating unconstrained two-dimensional non-guillotine cutting patterns by a recursive partitioning algorithm","volume":"63","author":"Birgin","year":"2012","journal-title":"J. Oper. Res. Soc."},{"issue":"24","key":"10.1016\/j.cor.2026.107424_b0025","doi-asserted-by":"crossref","first-page":"7339","DOI":"10.1080\/00207543.2014.930534","article-title":"A new MILP approach for the facility process-layout design problem with rectangular and L\/T shape departments","volume":"52","author":"Bukchin","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107424_b0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2013.12.008","article-title":"Mathematical programming algorithms for bin packing problems with item fragmentation","volume":"46","author":"Casazza","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107424_b0035","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.endm.2016.10.016","article-title":"Column generation for the variable cost and size bin packing problem with fragmentation","volume":"55","author":"Casazza","year":"2016","journal-title":"Electron Notes Discrete Math."},{"key":"10.1016\/j.cor.2026.107424_b0040","series-title":"Applied Integer Programming: Modeling and Solution","author":"Chen","year":"2011"},{"issue":"4","key":"10.1016\/j.cor.2026.107424_b0045","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0229358","article-title":"Positions and covering: a two-stage methodology to obtain optimal solutions for the 2d-bin packing problem","volume":"15","author":"Cid-Garcia","year":"2020","journal-title":"PLoS One"},{"key":"10.1016\/j.cor.2026.107424_b0050","unstructured":"C\u00f4t\u00e9, J.-F., Haouari, M., & Iori, M. (2019). A primal decomposition algorithm for the two-dimensional bin packing problem. arXiv preprint arXiv:1909.06835."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0055","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ejor.2014.06.032","article-title":"Sequential heuristic for the two-dimensional bin-packing problem","volume":"240","author":"Cui","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107424_b0060","article-title":"An adaptive large neighborhood search metaheuristic for the generalized bin packing problem with incompatible categories","volume":"185","author":"de Abreu Rodrigues","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107424_b0065","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.arcontrol.2007.04.001","article-title":"Facility layout problems: a survey","volume":"31","author":"Drira","year":"2007","journal-title":"Annu. Rev. Control."},{"issue":"2","key":"10.1016\/j.cor.2026.107424_b0070","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"Eur. J. Oper. Res."},{"issue":"31","key":"10.1016\/j.cor.2026.107424_b0075","doi-asserted-by":"crossref","first-page":"10482","DOI":"10.1021\/acs.iecr.8b00260","article-title":"Optimization-based approach for process plant layout","volume":"57","author":"Ejeh","year":"2018","journal-title":"Ind. Eng. Chem. Res."},{"key":"10.1016\/j.cor.2026.107424_b0080","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.cherd.2018.07.018","article-title":"Optimal multi-floor process plant layout with production sections","volume":"137","author":"Ejeh","year":"2018","journal-title":"Chem. Eng. Res. Des."},{"key":"10.1016\/j.cor.2026.107424_b0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105113","article-title":"Bin packing problem with conflicts and item fragmentation","volume":"126","author":"Ekici","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0090","doi-asserted-by":"crossref","DOI":"10.1155\/2022\/1382558","article-title":"A mixed integer linear formulation and a grouping league championship algorithm for a multiperiod\u2010multitrip order picking system with product replenishment to minimize total tardiness","volume":"2022","author":"Farhadi Sartangi","year":"2022","journal-title":"Complexity"},{"key":"10.1016\/j.cor.2026.107424_b0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106687","article-title":"An effective approach to the two-dimensional rectangular packing problem in the manufacturing industry","volume":"148","author":"F\u0131rat","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0100","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s00170-019-03569-6","article-title":"Laser cutting path optimization using simulated annealing with an adaptive large neighborhood search","volume":"103","author":"Hajad","year":"2019","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107424_b0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105140","article-title":"Adaptive large neighborhood search for solving the circle bin packing problem","volume":"127","author":"He","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0110","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00170-017-0895-8","article-title":"Classification of facility layout problems: a review study","volume":"94","author":"Hosseini-Nasab","year":"2018","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"10.1016\/j.cor.2026.107424_b0115","first-page":"307","article-title":"A simulated annealing algorithm for unequal area dynamic facility layout problems with flexible bay structure","volume":"9","author":"Hunagund","year":"2018","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0120","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2015.02.049","article-title":"A semidefinite optimization-based approach for global optimization of multi-row facility layout","volume":"245","author":"Hungerl\u00e4nder","year":"2015","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107424_b0125","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2020.06.050","article-title":"Exact solution techniques for two-dimensional cutting and packing","volume":"289","author":"Iori","year":"2021","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107424_b0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.heliyon.2023.e16714","article-title":"Shipyard facility layout optimization through the implementation of a sequential structure of algorithms","volume":"9","author":"Junior","year":"2023","journal-title":"Heliyon"},{"key":"10.1016\/j.cor.2026.107424_b0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109022","article-title":"2-Dimensional packing on a variable size rectangular interface","volume":"177","author":"Kacem","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"9","key":"10.1016\/j.cor.2026.107424_b0140","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1016\/j.apm.2014.11.001","article-title":"Grouping evolution strategies: an effective approach for grouping problems","volume":"39","author":"Kashan","year":"2015","journal-title":"App. Math. Model."},{"issue":"3","key":"10.1016\/j.cor.2026.107424_b0145","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TEM.2015.2437195","article-title":"Dynamic facility layout problem: a new bilevel formulation and some metaheuristic solution methods","volume":"62","author":"Kheirkhah","year":"2015","journal-title":"IEEE Trans. Eng. Manag."},{"issue":"3","key":"10.1016\/j.cor.2026.107424_b0150","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1080\/17445302.2013.783454","article-title":"Optimal module layout for a generic offshore LNG liquefaction process of LNG-FPSO","volume":"9","author":"Ku","year":"2014","journal-title":"Ships Offshore Struct."},{"issue":"8","key":"10.1016\/j.cor.2026.107424_b0155","doi-asserted-by":"crossref","first-page":"5032","DOI":"10.3390\/app13085032","article-title":"Facility layout problem with alternative facility variants","volume":"13","author":"Kubal\u00edk","year":"2023","journal-title":"Appl. Sci."},{"issue":"7","key":"10.1016\/j.cor.2026.107424_b0160","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1080\/0305215X.2014.933825","article-title":"A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems","volume":"47","author":"Kulturel-Konak","year":"2015","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2026.107424_b0165","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.compchemeng.2017.05.022","article-title":"Process plant layout optimization with uncertainty and considering risk","volume":"106","author":"Latifi","year":"2017","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0170","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.tcs.2015.08.005","article-title":"Bin packing with fragmentable items: presentation and approximations","volume":"602","author":"LeCun","year":"2015","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0175","article-title":"Research on dynamic facility layout problem of manufacturing unit considering human factors","volume":"2018","author":"Li","year":"2018","journal-title":"Math. Probl. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0180","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1057\/s41274-017-0186-7","article-title":"A column generation-based heuristic for the three-dimensional bin packing problem with rotation","volume":"69","author":"Mahvash","year":"2018","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"10.1016\/j.cor.2026.107424_b0185","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0898-1221(98)00087-X","article-title":"Complexity of fragmentable object bin packing and an application","volume":"35","author":"Mandal","year":"1998","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.cor.2026.107424_b0190","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2024.06.001","article-title":"On the automatic generation of metaheuristic algorithms for combinatorial optimization problems","author":"Mart\u00edn-Santamar\u00eda","year":"2024","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0195","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2009.02.028","article-title":"Heuristics for the dynamic facility layout problem with unequal-area departments","volume":"201","author":"McKendall","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107424_b0200","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.compchemeng.2014.05.019","article-title":"A mathematical programming model for optimal layout considering quantitative risk analysis","volume":"68","author":"Medina-Herrera","year":"2014","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0205","doi-asserted-by":"crossref","unstructured":"Menakerman, N., & Rom, R. (2001). Bin packing with item fragmentation. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125, pp.313-324. Springer, Berlin, Germany.","DOI":"10.1007\/3-540-44634-6_29"},{"issue":"2","key":"10.1016\/j.cor.2026.107424_b0210","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10033-017-0073-9","article-title":"Performance analysis of intelligent robust facility layout design","volume":"30","author":"Moslemipour","year":"2017","journal-title":"Chin. J. Mech. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0215","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s00170-011-3614-x","article-title":"A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems","volume":"60","author":"Moslemipour","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"10.1016\/j.cor.2026.107424_b0220","doi-asserted-by":"crossref","first-page":"3238","DOI":"10.1111\/itor.13236","article-title":"An introduction to the two\u2010dimensional rectangular cutting and packing problem","volume":"30","author":"Oliveira","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0225","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-010-0204-5","article-title":"A branch-and-bound algorithm for the single-row equidistant facility layout problem","volume":"34","author":"Palubeckis","year":"2012","journal-title":"OR Spectr."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0230","first-page":"56","article-title":"An efficient algorithm for unequal area facilities layout planning with input and output points","volume":"57","author":"Park","year":"2019","journal-title":"INFOR: Inf. Syst. Operat. Res."},{"key":"10.1016\/j.cor.2026.107424_b0235","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1007\/s11814-018-0019-7","article-title":"Risk based 3-dimensional and multifloor plant layout optimization for liquefied natural gas (LNG) liquefaction process","volume":"35","author":"Park","year":"2018","journal-title":"Korean J. Chem. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0240","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102432","article-title":"Mathematical models for a cutting problem in the glass manufacturing industry","volume":"103","author":"Parre\u00f1o","year":"2021","journal-title":"Omega"},{"issue":"12","key":"10.1016\/j.cor.2026.107424_b0245","doi-asserted-by":"crossref","first-page":"3777","DOI":"10.1080\/00207543.2021.1897176","article-title":"Facility layout planning. an extended literature review","volume":"59","author":"P\u00e9rez-Gosende","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107424_b0250","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1080\/00207543.2023.2168308","article-title":"A bottom-up multi-objective optimisation approach to dynamic facility layout planning","volume":"62","author":"P\u00e9rez-Gosende","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107424_b0255","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2020.102311","article-title":"Just-in-time two-dimensional bin packing","volume":"102","author":"Polyakovskiy","year":"2021","journal-title":"Omega"},{"issue":"8","key":"10.1016\/j.cor.2026.107424_b0260","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1007\/s42452-019-0865-x","article-title":"Developing a mathematical model for the dynamic facility layout problem considering material handling system and optimizing it using cloud theory-based simulated annealing algorithm","volume":"1","author":"Pournaderi","year":"2019","journal-title":"SN Appl. Sci."},{"issue":"18","key":"10.1016\/j.cor.2026.107424_b0265","doi-asserted-by":"crossref","first-page":"5633","DOI":"10.1080\/00207543.2021.1967500","article-title":"Robust facility layout design for flexible manufacturing: a doe-based heuristic","volume":"60","author":"Pourvaziri","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107424_b0270","doi-asserted-by":"crossref","first-page":"4625","DOI":"10.1016\/j.matpr.2020.10.280","article-title":"Higher order block heuristics for 2D pallet loading problems with multiple box inputs","volume":"46","author":"Prasad","year":"2021","journal-title":"Mater. Today Proc."},{"issue":"6","key":"10.1016\/j.cor.2026.107424_b0275","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1080\/00207543.2019.1617449","article-title":"Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets","volume":"58","author":"Ranjbaran","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0280","article-title":"Hybridizing beam search with tabu search for the irregular packing problem","volume":"2021","author":"Rao","year":"2021","journal-title":"Math. Probl. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0285","first-page":"98","article-title":"Advances in cutting & packing problems: a systematic literature review and future directions","volume":"5","author":"Rebah","year":"2024","journal-title":"Asian J. Manage. Commerce"},{"key":"10.1016\/j.cor.2026.107424_b0290","doi-asserted-by":"crossref","unstructured":"Salamati-Hormozi, H., Husseinzadeh Kashan, A., & Ostadi, B. (2024). A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem. 4OR, 22, 483-536.","DOI":"10.1007\/s10288-024-00576-6"},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107424_b0295","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1111\/itor.12099","article-title":"The pallet loading problem: a review of solution methods and computational experiments","volume":"23","author":"Silva","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107424_b0300","doi-asserted-by":"crossref","first-page":"1604","DOI":"10.3390\/app8091604","article-title":"On GPU implementation of the island model genetic algorithm for solving the unequal area facility layout problem","volume":"8","author":"Sun","year":"2018","journal-title":"Appl. Sci."},{"key":"10.1016\/j.cor.2026.107424_b0305","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.jmsy.2015.09.003","article-title":"A new linear adjacency approach for facility layout problem with unequal area departments","volume":"37","author":"Tari","year":"2015","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107424_b0310","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109038","article-title":"A sequential space syntax approach for healthcare facility layout design","volume":"177","author":"Teran-Somohano","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107424_b0315","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109004","article-title":"A simulated annealing approach for the circle bin packing problem with rectangular items","volume":"176","author":"Tole","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2026.107424_b0320","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1080\/00207543.2020.1847342","article-title":"A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances","volume":"60","author":"Wan","year":"2022","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107424_b0325","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1111\/j.1475-3995.2009.00715.x","article-title":"The pinwheel pattern and its application to the manufacturer's pallet\u2010loading problem","volume":"16","author":"Yi","year":"2009","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107424_b0330","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105826","article-title":"Adaptive simulated annealing with greedy search for the circle bin packing problem","volume":"144","author":"Yuan","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107424_b0335","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3390\/pr12010201","article-title":"Workshop facility layout optimization based on deep reinforcement learning","volume":"12","author":"Zhao","year":"2024","journal-title":"Processes"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000420?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T18:35:16Z","timestamp":1773167716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":67,"alternative-id":["S0305054826000420"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107424","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The two-dimensional orthogonal packing problem with item fragmentation: Formulation and local search-based algorithms (applications on tank-farm layout planning)","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107424","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107424"}}