Advanced search
Publication Cover
IIE Transactions Volume 40, 2008 - Issue 1
Submit an article Journal homepage
1,153
Views
11
CrossRef citations to date
0
Altmetric
ORIGINAL ARTICLES

A note on the can-order policy for the two-item stochastic joint-replenishment problem

Enis Kayiş Department of Industrial Engineering, Boğaziçi University, Bebek, 34342, İstanbul, Turkey
,
Taner Bilgiç Department of Industrial Engineering, Boğaziçi University, Bebek, 34342, İstanbul, Turkey
&
Deniz Karabulut Department of Industrial Engineering, Boğaziçi University, Bebek, 34342, İstanbul, Turkey
Pages 84-92 | Received 01 Aug 2002, Accepted 01 Mar 2005, Published online: 06 Nov 2007

Citations (11)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Ann M. Noblesse, Nikki Sonenberg, Robert N. Boute, Marc R. Lambrecht & Benny Van Houdt. (2022) A joint replenishment production-inventory model as an MMAP[K]/PH[K]/1 queue. Stochastic Models 38:3, pages 390-415.
Read now

Articles from other publishers (10)

Hyungjun Park, Dong Gu Choi & Daiki Min. (2023) Adaptive inventory replenishment using structured reinforcement learning by exploiting a policy structure. International Journal of Production Economics 266, pages 109029.
Crossref
Jiseong Noh. (2023) Reinforcement Learning for Optimizing Can-Order Policy with the Rolling Horizon Method. Systems 11:7, pages 350.
Crossref
Lu Peng, Lin Wang & Sirui Wang. (2022) A review of the joint replenishment problem from 2006 to 2022. Management System Engineering 1:1.
Crossref
Stefan Creemers & Robert Boute. (2022) The joint replenishment problem: Optimal policy and exact evaluation method. European Journal of Operational Research 302:3, pages 1175-1188.
Crossref
Rym M’Hallah, Lakdere Benkherouf & Ahmad Al-Kandari. (2020) Optimal inventory policies for a two-dimensional stochastic inventory model: A numerical investigation. Computers & Operations Research 119, pages 104939.
Crossref
Jiseong Noh, Jong Soo Kim & Seung-June Hwang. (2020) A Multi-Item Replenishment Problem with Carbon Cap-and-Trade under Uncertainty. Sustainability 12:12, pages 4877.
Crossref
Silvia Valeria Padilla Tinoco, Stefan Creemers & Robert N. Boute. (2017) Collaborative shipping under different cost-sharing agreements. European Journal of Operational Research 263:3, pages 827-837.
Crossref
Leonardo dos Santos Lourenço Bastos, Matheus Lopes Mendes, Denilson Ricardo de Lucena Nunes, André Cristiano Silva Melo & Mariana Pereira Carneiro. (2017) A systematic literature review on the joint replenishment problem solutions: 2006-2015. Production 27:0.
Crossref
Keisuke Nagasawa, Takashi Irohara, Yosuke Matoba & Shuling Liu. (2015) Applying Genetic Algorithm for Can-Order Policies in the Joint Replenishment Problem. Industrial Engineering and Management Systems 14:1, pages 1-10.
Crossref
Adam N Elmachtoub & Yehua Wei. (2015) Retailing with Opaque Products. SSRN Electronic Journal.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.