Similar Search Results

A block-based layer building approach for the 2D guillotine strip packing problem

Wei, Lijun; Tian, Tian; Zhu, Wenbin; Lim, Andrew - In: European Journal of Operational Research 239 (2014) 1, pp. 58-69

We examine the 2D strip packing problems with guillotine-cut constraint, where the objective is to pack all rectangles … orthogonal rectangular packing problems into a single coherent algorithm: (1) packing a block of rectangles instead of a single …

Persistent link: https://www.econbiz.de/10011097861

Combinatorial Benders' decomposition for the constrained two-dimensional non-guillotine cutting problem with defects

Yao, Shaowen; Zhang, Hao; Liu, Qiang; Leng, Jiewu; Wei, … - In: International journal of production research 62 (2024) 23, pp. 8299-8325

Persistent link: https://www.econbiz.de/10015095415

Minimizing saw cycles on the cutting stock problem with processing times depending on the cutting pattern

Lemos, F. K.; Cherri, A. C.; de Araujo, S. A.; Yanasse, … - In: Journal of the Operational Research Society 74 (2023) 5, pp. 1331-1345

Persistent link: https://www.econbiz.de/10014334982

A stochastic programming approach to the cutting stock problem with usable leftovers

Cherri, Adriana Cristina; Cherri, Luiz Henrique; … - In: European journal of operational research : EJOR 308 (2023) 1, pp. 38-53

Persistent link: https://www.econbiz.de/10014283008

Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns

Cui, Yaodong; Zhao, Zhigang - In: European Journal of Operational Research 231 (2013) 2, pp. 288-298

heuristic algorithm is presented to solve the rectangular two-dimensional single stock size cutting stock problem with two … reducing the number of plates used than a published algorithm and a commercial stock cutting software package. …

Persistent link: https://www.econbiz.de/10010682504

Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost

Silva, Eduardo M.; Melega, Gislaine Mara; Akartunalı, Kerem - In: European journal of operational research : EJOR 304 (2023) 2, pp. 443-460

Persistent link: https://www.econbiz.de/10013534530

Solving robust bin-packing problems with a branch-and-price approach

Schepler, Xavier; Rossi, André; Gurevsky, Evgeny; … - In: European journal of operational research : EJOR 297 (2022) 3, pp. 831-843

Persistent link: https://www.econbiz.de/10013261775

Solving bin packing problems using VRPSolver models

Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo - In: Operations research forum 2 (2021) 2, pp. 1-25

Persistent link: https://www.econbiz.de/10012499193

A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function

Hu, Qian; Zhu, Wenbin; Hu, Qin; Lim, Andrew - In: European journal of operational research : EJOR 260 (2017) 1, pp. 70-80

Persistent link: https://www.econbiz.de/10011697626

A prototype column generation strategy for the multiple container loading problem

Zhu, Wenbin; Huang, Weili; Lim, Andrew - In: European Journal of Operational Research 223 (2012) 1, pp. 27-39

The multiple container loading cost minimization problem (MCLCMP) is a practical and useful problem in the transportation industry, where products of various dimensions are to be loaded into containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally...

Persistent link: https://www.econbiz.de/10010597634