116676
PTDC/EGE-GES/116676/2010
FCT - Fundação para a Ciência e a Tecnologia, I.P.
Portugal
5876-PPCDTI
85,200.00 €
2012-04-16
2015-09-15
In this paper, we address the elementary shortest path problem with 2-dimensional loading constraints. The aim is to find the path with the smallest cost on a graph where the nodes represent clients whose items may have different heights and widths. Beyond its practical relevance, this problem appears as a subproblem in vehicle routing problems with loading constraints where feasible routes have to be generated...
In this paper, we address a variant of the cutting stock problem that considers the scheduling of the cutting operations over time. The problem combines the standard objective of cutting stock problems, which is the minimization of the raw material usage, together with a scheduling term penalizing tardiness. There is tardiness whenever the last instance of an item is cut after its given due date. This problem h...
In this paper, we address the integrated planning and scheduling problem on parallel machines in which a set of jobs with release and due-dates have to be assigned first to consecutive time periods within the planning horizon, and then scheduled on the available machines. We explore in particular different alternative low complexity heuristics. The importance of job sequencing in the performance of these heuris...
In this work we propose a computational study of a column generation based heuristic prototype for the vehicle routing problem with two-dimensional loading constraints. This prototype was recently proposed in literature (Pinto et al., 2013) and it relies in a column generation algorithm whose subproblem is relaxed. After solving the subproblem, the feasibility of the routes is verified using lower bounds and th...
In this paper, a capacitated vehicle routing problem with mixed linehauls and backhauls is presented. The addressed problem belongs to the subclass of pickup and delivery problems. Loading and sequencing constraints are also considered. These constraints arise in many realworld situations, and can improve efficiency since backhaul customers do not need to be delayed in a route when it is possible to load their ...
Despite other variants of the standard knapsack problem, very few solution approaches have been devised for the multiscenario max-min knapsack problem. The problem consists in finding the subset of items whose total profit is maximized under the worst possible scenario. In this paper, we describe an exact solution method based on column generation and branch-and-bound for this problem. Our approach relies on a ...
The integrated location routing scheduling problem is a variant of the well-known location routing problem. The location routing problem consists in selecting a set of depots to open and in building a set of routes from these depots, to serve a set of customers at minimum cost. In this variant, a vehicle can perform more than a single route in the planning period. As a consequence, the routes have to be schedul...
The resolution of planning and scheduling problems in a coordinated way within the supply chain is very challenging. In this paper, we address the integration of medium-term production planning and short-term scheduling models. We particularly focus on a specific problem defined on parallel machines that has recently been explored in the literature. The problem is characterized by a set of jobs that can be proc...
Tese de Doutoramento em Engenharia Industrial e de Sistemas; A resolução de problemas de optimização de processos no domínio da gestão de cadeias de abastecimento tende cada vez mais a ser feita numa perspectiva integrada. O objectivo é obter uma solução global que seja melhor do que aquela que é obtida quando os problemas são resolvidos de forma independente. Atendendo a este facto, esta tese tem como objectiv...
The efficient solution of practical problems combining both cutting stock and scheduling aspects has motivated the development of several approaches described recently in the literature. These problems consist in determining a cutting plan that minimises both the waste generated by cutting the stock rolls and the tardiness related to the delivery of items later than their specified due date. In this paper, we r...
<script type="text/javascript">
<!--
document.write('<div id="rcaap-widget"></div>');
document.write('<script type="text/javascript" src="https://www.rcaap.pt/snippet?resource=documents&project=FCT%2F5876-PPCDTI%2F116676&fields=id,titles,creators,issueDate,link,descriptions"></script>');
-->
</script>