Paper Title:
Single Item Lot Sizing Models with Bounded Inventory and Remanufacturing
  Abstract

Dynamic lot sizing problem for systems with bounded inventory and remanufacturing was addressed. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Two different limited inventory capacities are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present exact, polynomial time dynamic programming algorithm based on the idea of Teunter R, et al. (2006).

  Info
Periodical
Advanced Materials Research (Volumes 102-104)
Edited by
Guozhong Chai, Congda Lu and Donghui Wen
Pages
791-795
DOI
10.4028/www.scientific.net/AMR.102-104.791
Citation
N. M. Wang, Z. W. He, Q. S. Zhang, L. Y. Sun, "Single Item Lot Sizing Models with Bounded Inventory and Remanufacturing", Advanced Materials Research, Vols. 102-104, pp. 791-795, 2010
Online since
March 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Shu Jing Wu, Da Zhong Wang, Shigenori Okubo
Abstract:We can design model following control system (MFCS) with time-delay whose internal states are bounded. Time-delay widely exists among...
1456
Authors: Zhi Bo Hou, Li Mei Li
Chapter 4: Computational Analyze of Nonlinear Systems
Abstract:In this paper, by using an iteration procedure, regularity estimates of the linear semi-groups and a generalized existence theorem of global...
731
Authors: Li Ping Ge, Wen Song
Chapter 5: Signal and Image Processing, Intelligent Recognition, Intelligent Algorithms and Methods, Сomputational Mathematics
Abstract:The paper mainly research incremental sub-gradient method for the non-differentiable optimal problem in Hilbert space. And prove two...
1004