Search Results - subject:"Packing problem"

Online packing of arbitrary sized items into designated and multipurpose bins

Goldberg, Noam; Karhi, Shlomo - In: European journal of operational research : EJOR 279 (2019) 1, pp. 54-67

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

A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids

Birgin, Ernesto Julian Goldberg; Lobato, Rafael Durbano - In: European journal of operational research : EJOR 272 (2019) 2, pp. 447-464

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

Analysis of irregular three-dimensional packing problems in additive manufacturing : a new taxonomy and dataset

Araújo, Luiz J. P.; Özcan, Ender; Atkin, Jason A. D.; … - In: International journal of production research 57 (2019) 18, pp. 5920-5934

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

Integrated optimisation on flow-shop production with cutting stock

Wang, Weihao; Shi, Zhongshun; Shi, Leyuan; Zhao, Qingbin - In: International journal of production research 57 (2019) 19, pp. 5996-6012

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

Dynamic pricing for vehicle ferries : using packing and simulation to optimize revenues

Bayliss, Christopher; Currie, Christine S. M.; Bennell, … - In: European journal of operational research : EJOR 273 (2019) 1, pp. 288-304

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

Quality of strong equilibria for selfish bin packing with uniform cost sharing

Dósa, György; Epstein, Leah - In: Journal of scheduling 22 (2019) 4, pp. 473-485

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

Element-capacity difference algorithm for optimal bin packing

Shah, Deep; Aakash, A.; Samsingh, R. Vimal - In: International journal of services and operations management 34 (2019) 1, pp. 21-32

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

Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem

Kartak, Vadim - 2014

We consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the infinite set of 1CSP instances, with a fixed demand n, into a finite number of equivalence classes. We show up a...

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

Optimal stack layout in a sea container terminal with automated lifting vehicles

Roy, Debjit; Gupta, Akash; Parhi, Sampanna; Koster, René de - 2014

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

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Thomas, Jaya; Chaudhari, Narendra S. - In: Journal of industrial engineering international 10 (2014), pp. 1-16

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists …

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

A service of the

zbw