Reinaldo Morabito In this paper, we address an extension of the classical two-dimensional bin packing (2BPP) that considers the spread of customer orders (2BPP-OS). The 2BPP-OS addresses a set of rectangular items, required from different customer orders, to be cut from a set of rectangular bins. All the items of a customer order are dispatched together to … Read more
In this paper, we address the three-dimensional open-dimension rectangular packing problem (3D-ODRPP). This problem addresses a set of rectangular boxes of given dimensions and a rectangular container of open dimensions. The objective is to pack all boxes orthogonally into the container while minimizing the container volume. Real-world applications of the 3D-ODRPP arise in production systems … Read more
We address three variants of the two-dimensional cutting stock problem in which the guillotine cutting of large objects produces a set of demanded items. The characteristics of the variants are: the rectangular shape of the objects and items; the number of two or three orthogonal guillotine stages; and, a sequencing constraint that limits the number … Read more
The Vehicle Allocation Problem (VAP) consists of repositioning empty vehicles across a set of terminals over a given planning horizon so as to maximize the profits generated from serving demand for transportation of goods between pair of terminals. This problem has been classically modeled using an extended space-time network which captures the staging of the … Read more
In this paper, we address a two-stage integrated lot-sizing, scheduling and cutting stock problem with sequence-dependent setup times and setup costs. In production stage one, a cutting machine is used to cut large objects into smaller pieces, in which cutting patterns are generated and used to cut the pieces, and should be sequenced in order … Read more
We address two variants of the two-dimensional guillotine cutting problem that appear in different manufacturing settings that cut defective objects. Real-world applications include the production of flat glass in the glass industry and the cutting of wooden boards with knotholes in the furniture industry. These variants assume that there are several defects in the object, … Read more
In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the object’s walls and generate two cuboid sub-blocks, and there is … Read more
In this paper, we address the Constrained Two-dimensional Guillotine Cutting Problem (C2GCP) and the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP). These problems consist of cutting a rectangular two-/three-dimensional object with orthogonal guillotine cuts to produce ordered rectangular two-/three-dimensional items seeking the most valuable subset of items cut. They often appear in manufacturing settings that cut … Read more
The Vehicle Allocation Problem (VAP) consists of allocating a fleet of vehicles to attend to the expected demand for freight transportation between terminals along a finite multiperiod planning horizon. The objective is to maximize the profits generated for the completed services. The previous deterministic and stochastic approaches used heuristic procedures and approximations for solving large-scale … Read more
This paper addresses a real-life short-term rescheduling problem of helicopter flights from one onshore airport to several maritime units in the context of the oil industry. This is a complex and challenging problem to solve because of the particular characteristics observed in practice, such as pending flights transferred from previous days with different recovering priorities, … Read more