We consider a production system where demand can be met by manufacturing new products and remanufacturing returned products, and address the economic lot sizing problem therein. The system faces stochastic and time-varying demands and returns over a finite planning horizon. The problem is to match supply with demand, while minimizing the total expected cost which is comprised of fixed production costs and inventory (holding and backordering) costs. We introduce heuristic policies for this problem which offer different levels of flexibility with respect to production decisions. We present computational methods for these policies based on convex optimization and certainty equivalent mixed integer programming, and numerically assess their cost...
textabstractThe lot-sizing problem concerns a manufacturer that needs to solve a production planning...
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single ite...
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single ite...
We consider a production system where demand can be met by manufacturing new products and remanufact...
In this paper, we address the stochastic economic lot sizing problem with remanufacturing under serv...
textabstractWe consider a single item, uncapacitated stochastic lot-sizing problem motivated by a Du...
In this paper, we consider a lot-sizing problem with the remanufacturing option under parameter unce...
We consider the economic lot sizing problem with remanufacturing, an NP-hard problem which appears i...
Due to the stricter government regulations on end-of-life product treatment and the increasing publi...
In this paper, we propose a decomposition procedure for constructing robust optimal production plans...
AbstractThis paper addresses the single-item, dynamic lot-sizing problem for systems with remanufact...
In this paper we address the single-item, single-stocking point, non-stationary stochastic lot-sizin...
We consider the economic lot sizing problem with remanufacturing, an NP-hard problem which appears i...
[[abstract]]This article presents an algebraic approach for solving realistic production lot-size pr...
textabstractThe lot-sizing problem concerns a manufacturer that needs to solve a production planning...
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single ite...
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single ite...
We consider a production system where demand can be met by manufacturing new products and remanufact...
In this paper, we address the stochastic economic lot sizing problem with remanufacturing under serv...
textabstractWe consider a single item, uncapacitated stochastic lot-sizing problem motivated by a Du...
In this paper, we consider a lot-sizing problem with the remanufacturing option under parameter unce...
We consider the economic lot sizing problem with remanufacturing, an NP-hard problem which appears i...
Due to the stricter government regulations on end-of-life product treatment and the increasing publi...
In this paper, we propose a decomposition procedure for constructing robust optimal production plans...
AbstractThis paper addresses the single-item, dynamic lot-sizing problem for systems with remanufact...
In this paper we address the single-item, single-stocking point, non-stationary stochastic lot-sizin...
We consider the economic lot sizing problem with remanufacturing, an NP-hard problem which appears i...
[[abstract]]This article presents an algebraic approach for solving realistic production lot-size pr...
textabstractThe lot-sizing problem concerns a manufacturer that needs to solve a production planning...
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single ite...
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single ite...