Title: A near-optimal policy and its comparison with base stock and Kanban policies in a two-stage production and inventory system with advance demand information

Authors: Koichi Nakade; Shizuru Tsuchiya

Addresses: Department of Architecture, Civil Engineering and Industrial Management Engineering, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya 466-8555, Japan ' Department of Architecture, Civil Engineering and Industrial Management Engineering, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya 466-8555, Japan

Abstract: Base stock and (extended) Kanban policies have been analysed as basic and simple production and inventory policies. On the other hand, advance demand information (ADI) is useful for controlling production and inventory systems and the production control with ADI has been discussed in a decade. In addition, if the order and production are made corresponding to the state of the system, more profits are expected to be achieved. To derive a state-dependent dynamic policy, an approach of Markov decision processes can be used. Deriving an optimal policy is difficult for the large-size problem, however, because of the curse of dimensionality. In this paper, two-phase time aggregation algorithm (Arruda and Fragoso (2015), TA-algorithm) is applied to a two-stage production and inventory system with advance demand information. From observation in numerical examples for the small dimension problem, modification of TA algorithm leads to convergence to better near-optimal policies. Numerical results show effectiveness of the modification and the derived near-optimal policies are compared with base stock and extended Kanban policies.

Keywords: Markov decision processes; advance demand information; algorithm; base stock; Kanban; policy iteration; time aggregation.

DOI: 10.1504/AJMSA.2018.098920

Asian Journal of Management Science and Applications, 2018 Vol.3 No.4, pp.321 - 339

Received: 29 Mar 2018
Accepted: 16 Nov 2018

Published online: 04 Apr 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article