The location routing problem (LRP) integrates operational decisions on vehicle operations with strategic the of facilities or depots from which distribution will take place. In other words, it combines well-known (VRP) facility (FLP). Hence, LRP is an NP-hard combinatorial optimization problem, justifies use metaheuristic approaches whenever large-scale instances need to be solved. this paper, ...

The purpose of this research is to focus on the solution of the resource sizing problem for the real production system. The resource sizing problem is tackled by usage of the mathematical makespan minimization method and comparative simulations of the two different production models. Only two production model simulations were realized due to specificities of the handled production system. Simul...

We consider an extension of the dynamic uncapacitated lot-sizing problem to account for co-production, where multiple products are produced simultaneously in a single production run. We formulate the problem as a mixed-integer linear programming problem. We then show that a variant of the well-known zero-inventory property holds for this problem, and use this property to extend a dynamic progra...

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a pathrelinking intensification procedure ...

A linear description for the economic lot-sizing problem consisting of exponentially many linear inequalities was given by Barany, Van Roy and Wolsey in 1984. Using this formulation we present a dual algorithm for the economic lot-sizing problem, which is of the same complexity as the Wagner and Whitin dynamic programming algorithm. Besides its use in sensitivity analysis the dual algorithm als...

In this paper, a case study is carried out concerning the lot-sizing problem involving a single item production planning in several production centers that do not present capacity constraints. Demand can be met with backlogging or not. This problem results from simplifying practical problems, such as the material requirement planning (MRP) system and also lot-sizing problems with multiple items...

Circuit sizing problem in application specific analog integrated circuit design is in most cases limited to setting MOSFET channel widths and lengths. It is usually performed by hand by an experienced human designer. As the circuit sizing is an optimization process by its nature, optimization methods could be used. They always lead to one of the minima of the cost function while eventual other ...

We study the polyhedral structure of the static probabilistic lot-sizing problem and propose valid inequalities that integrate information from the chance constraint and the binary setup variables. We prove that the proposed inequalities subsume existing inequalities for this problem, and they are facet-defining under certain conditions. In addition, we show that they give the convex hull descr...