We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool management methods solve these problems independently using a two-level optimization approach. Thus, we not only improve the overall solution by exploiting the interactions a...

Lot-sizing is one of the many issues arising in the context of production planning. Its main objective is to determine the timing and level of production so as to reach the best possible trade-off between minimizing setup and inventory holding costs and satisfying customer demand. When a limited production capacity and a deterministic time-varying demand rate are assumed, lot-sizing leads to th...

Waste accumulation in landfills, global warming and the need to preserve finite raw materials push governments industries shift towards a circular economy. Industrial symbiosis represents sustainable way of sharing resources converting unavoidable production residues into useful added-value products. In this context, we introduce new planning problem arisen between two units (PU) within an indu...

We explore a fixed-route vehicle refueling problem as a special case of the inventorycapacitated lot-sizing problem, and present a linear-time greedy algorithm for finding optimal refueling policies.

This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one in which stock is not conserved. That is, the stock in inventory undergoes a transformation in each period that is independent of the period in which the item was produced. A 0 1 mixed integer programming formulation o...

We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-Whitin costs.

The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of discrete stochastic demands under periodic review and finite time horizon. A closely related problem is the single-period newsvendor model. It is well known that the newsvendor problem admits a closed formula for the optimal order quantity whenever the revenue and salvage values are lin...

We consider a capacitated production-inventory problem in both discreteand continuous-time, stationary settings. In the discretetime setting we analyze the infinite horizon capacitated dynamic lot-sizing problem, find the optimal solution and characterize its properties. For the continuous-time setting we formulate a new problem, which we claim to be an appropriate counterpart of the above disc...