1991
DOI: 10.1080/00207549108930051
|View full text |Cite
|
Sign up to set email alerts
|

On the economic ordering quantity for jointly replenished items

Abstract: A solution procedure is provided for solving the joint replenishment problem using a basic cycle approach. The solution procedure is very simple, and involves comparing possible values between the 'minimum' and 'maximum' cycle times. Extensive simulation demonstrates that this solution procedure is superior to previously known algorithms for solving this problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
56
0
1

Year Published

1992
1992
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 111 publications
(60 citation statements)
references
References 9 publications
2
56
0
1
Order By: Relevance
“…Aunque la caracterización de las soluciones que se han realizado en este trabajo es de tipo teórico, el tener en cuenta la idea de dominancia de soluciones en su implementación práctica puede ahorrar mucho esfuerzo computacional, principalmente en la utilización de heurísticas como es el caso del llamado algoritmo RAND [7] que se utiliza de manera usual, incluso para probar otros métodos. El JRP usualmente ha sido atacado mediante el encontrar los valoresóptimos de K i , i = 1, 2, 3, .…”
Section: Conclusionesunclassified
“…Aunque la caracterización de las soluciones que se han realizado en este trabajo es de tipo teórico, el tener en cuenta la idea de dominancia de soluciones en su implementación práctica puede ahorrar mucho esfuerzo computacional, principalmente en la utilización de heurísticas como es el caso del llamado algoritmo RAND [7] que se utiliza de manera usual, incluso para probar otros métodos. El JRP usualmente ha sido atacado mediante el encontrar los valoresóptimos de K i , i = 1, 2, 3, .…”
Section: Conclusionesunclassified
“…On deterministic models, the main reference is the RAND algorithm, proposed by Kaspi & Rosenblatt (1991). It is a heuristic that divides equally a range of cycle time values among lower and upper bounds and then it applies Silver (1976)'s algorithm (Khouja & Goyal, 2008).…”
Section: ( )mentioning
confidence: 99%
“…Kaspi and Rosenblatt [6][7] proposed two study reports of the testing of different heuristic algorithm, suggesting the optimal solution obtained by using RAND procedure proposed by Kaspi and Rosenblatt is better than the solutions found by using algorithms proposed by other scholars (for details, see Goyal [8], Brown [9], Goyal and Belton [10], and Silver [11]). Unlike the methods proposed by the aforementioned scholars, we applied the game theory in multi-agent joint procurement decision model negotiation algorithm to find out the relatively better order quantity of a certain raw material for chain restaurants participating in joint procurement.…”
Section: Introductionmentioning
confidence: 99%