Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling. The fundamental task is to ...

The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local Search (Jul., 2004), pp. 705-716 (12 pages) The Bin Packing Problem and the Cutting Stock Problem are two ...

The Journal of the Operational Research Society, Vol. 69, No. 3 (MARCH 2018), pp. 402-415 (14 pages) This paper presents a heuristic for the guillotine two-dimensional bin packing problem, where a set ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

Abstract: The present work deals with a complex topic of physical flow; it includes the dimensioning of logistics human resources in the productions lines. This involves modeling then measuring and ...