Log in

Relevant bibliographies by topics / Joint replenishment problem (JRP) / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Joint replenishment problem (JRP).

Dissertations / Theses on the topic 'Joint replenishment problem (JRP)'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 22 dissertations / theses for your research on the topic 'Joint replenishment problem (JRP).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Rahmouni, Mouna. "Optimisation combinée des approvisionnements et du transport dans une chaine logistique." Thesis, Aix-Marseille, 2015. http://www.theses.fr/2015AIXM4329.

Full text

Abstract:

Le problème d’approvisionnement conjoint (JDP) proposé est un problème de planification des tournées de livraisons sur un horizon de temps décomposé en périodes élémentaires, l’horizon de temps étant la période commune de livraison de tous les produits,. La donnée de ces paramètres permet d’obtenir une formulation linéaire du problème, avec des variables de décision binaires. Le modèle intègre aussi des contraintes de satisfaction de la demande à partir des stocks et des quantités livrées, des contraintes sur les capacités de stockage et de transport.Afin de résoudre aussi le problème de choix

APA, Harvard, Vancouver, ISO, and other styles

2

Canlas, Michael T. Jang Wooseung. "A practical approach to the cyclic multi-bin joint replenishment problem." Diss., Columbia, Mo. : University of Missouri--Columbia, 2009. http://hdl.handle.net/10355/6573.

Full text

Abstract:

The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Title from PDF of title page (University of Missouri--Columbia, viewed on October 21, 2009). Thesis advisor: Dr. W. Jang. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

3

Narayanan, Arunachalam. "Improved formulations, heuristics and metaheuristics for the dynamic demand coordinated lot-sizing problem." [College Station, Tex. : Texas A&M University, 2006. http://hdl.handle.net/1969.1/ETD-TAMU-1802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Telha, Cornejo Claudio (Claudio A. ). "Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/70446.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 107-110).<br>In the first part of this thesis we present a new, geometric interpretation of the jump number problem on 2-dimensional 2-colorable (2D2C) partial order. We show that the jump number of a 2D2C poset is equivalent to the maximum cardinality of an independent set in a properly defined collection of rectangles in the plane. We then model the geometric problem as a linear program. Even

APA, Harvard, Vancouver, ISO, and other styles

5

Balcik, Burcu. "Multi Item Integrated Location/inventory Problem." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/4/1093640/index.pdf.

Full text

Abstract:

In this study, the design of a three-level distribution system is considered in which a single supplier ships a number of items to the retailers via a set of distribution centers (DC) and stochastic demand is observed at the retailers. The problem is to specify the number and location of the DCs, and the assignment of the retailers to the DCs in such a way that total facility, transportation, safety stock, and joint ordering and average inventory costs are minimized, and customer service requirements are satisfied. Single source constraints are imposed on the assignment of the retailers to the

APA, Harvard, Vancouver, ISO, and other styles

6

Jhe-Yi, Jiang, and 江哲儀. "Solving and Analysis of Joint Replenishment Problem." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/04241539051932475377.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>100<br>Joint replenishment problem has been proposed for 40 years. S.K. Goyal tried to get global optimal solution by local optimal. RAND found the relations between global optimal frequency and K_i. This research proposed another heuristic method for the JRP. This heuristic method directly gets the best K_i under the total cost without the association with frequency. Because RAND has best ability in solving JRP, it is a standard solution in this research. This research analyses the heuristic method proposed in this research, S.K. Goyal（1974）and E.A.Silver（19

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Chun-chin, and 陳鈞智. "The Joint Replenishment Problem of Perishable Commodity." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/99286977846553181252.

Full text

Abstract:

碩士<br>雲林科技大學<br>工業工程與管理研究所碩士班<br>96<br>In order to reduce total inventory costs, an enterprise can use consolidation to save transportation cost and order process cost when it requires multiple products. The consolidation of order multiple products is also called “The Joint Replenishment Problem (JRP)”. The JRP model assumes the planning horizon is infinite. However, many products’ life time is finite in reality. If the inventory replenishment is planned according to this assumption, it will cause some inventories can’t be sold before their expired dates. In order to solve this problem, the st

APA, Harvard, Vancouver, ISO, and other styles

8

Lee, Yi-Chieh, and 李依潔. "The Joint Replenishment Problem Considering Container Transportation Cost." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/66184325211724899163.

Full text

Abstract:

碩士<br>國立交通大學<br>運輸科技與管理學系<br>99<br>Researchers are interested in studying the joint replenishment Problem due to its applications in the globalization of markets and products diversification. Also, the practitioners are motivated to reduce the total costs by replenishing products jointly. The costs in the traditional Joint Replenishment Problem are composed of three parts：(1) major setup cost, (2) minor setup cost and (3) inventory holding cost. This study focused on additionally taking into account the transportation cost subject to using a fixed basic period for the planning of replenishment

APA, Harvard, Vancouver, ISO, and other styles

9

Yeh, Su-Wei, and 葉書瑋. "Integrated Routing Cost With The Joint Replenishment Problem." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/80331854308356347081.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>100<br>Traditional joint replenishment problem is based on a second-order supply chain, which is for the multiple retailers and a suppliers common replenishment. In the past, joint replenishment problem and transport routing problem have always been the separate problems but in fact these two problems are inseparable. Thus the research we have here is trying to combine two different NP-hard problem which is ‘Joint Replenishment Problem，JRP’ and ‘traveling salesman problem，TSP’ each accordingly. The result comes out with us using Goyal’s systematic concept of

APA, Harvard, Vancouver, ISO, and other styles

10

Yeh, Che-Cheng, and 葉哲誠. "Integrated transportation planning with the joint replenishment problem." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/15585242786983472718.

Full text

Abstract:

碩士<br>雲林科技大學<br>工業工程與管理研究所碩士班<br>96<br>In two echelon distribution system, common replenishment of single-supplier and multi-retailer is so-called Joint Replenishment Problem (JRP). In traditional distribution system, replenishment decision and transportation planning are decided separately. That means inventory cost and transportation cost are calculated separately - replenishment decision minimizes inventory cost (ordering cost and holding cost) and transportation planning minimizes transportation cost. As oil price increased, the transportation cost raised. The replenishment policy is made

APA, Harvard, Vancouver, ISO, and other styles

11

Lee, Cheng-Han, and 李承翰. "Using Particle Swarm Optimization for Joint Replenishment Problem." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/15203306830018157967.

Full text

Abstract:

碩士<br>國立勤益科技大學<br>工業工程與管理系<br>101<br>Because of the increasing concern in global warming, oil price soaring and eco-awareness, biking has become very popular. With the fashionable trend of bikes, factories in Taiwan are expanding productions in the original field and are enhancing their technologies. Moreover, parts companies and R&;D departments are also developing new products and technologies to meet customer demands. In the age of green energy industry, the development of bikes currently focuses on the durability of frame, customization, delicacy and easiness of carrying, and e-bike will b

APA, Harvard, Vancouver, ISO, and other styles

12

Lin, Yen-Fei, and 林晏妃. "The Joint Replenishment Problem with Warehouse-Space Restriction." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/61939675595710042352.

Full text

Abstract:

碩士<br>東海大學<br>工業工程與經營資訊學系<br>92<br>This study is an extension of the Joint Replenishment Problem (JRP) that takes into accounts the warehouse-space restrictions. The focus of this study is to determine the lot sizes of each product under power-of-two policy to minimize the total costs per unit time and to generate a feasible replenishment schedule of multiple products without exceeding the available warehouse-space. In order to test the feasibility of any given solution, we propose a new heuristic, namely, Proc FT. Also, we propose a search algorithm and a genetic algorithm to secure the optim

APA, Harvard, Vancouver, ISO, and other styles

13

Chang, Jian-Zhao, and 張建朝. "Joint Replenishment Problem in a Two-Echelon Supply Chain." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/16632648804251143668.

Full text

Abstract:

碩士<br>東海大學<br>工業工程學系<br>90<br>In this study, we investigate a Joint Replenishment Problem (JRP) for two-echelon supply chain systems. The decision maker determines the lot sizing and scheduling for one central warehouse (CW) and multiple retailers. We mathematically formulate an objective function which includes 4 categories of cost terms: the ordering cost and the holding cost of CW, as well as the ordering cost and the holding cost of all the retailers. In order to secure the optimal replenishment frequencies for the CW and all the retailers, we solve the two-echelon JRP using three approach

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, Sheng-Wun, and 王聖文. "The analysis of joint replenishment problem with quantity discounts." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/95683281538130346988.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>101<br>There are many scholars provide their opinions for joint replenishment problem. Replenishment problem is very important for businesses. In order to maximize the order cost effect; there are a lot of researches discuss joint replenishment of different items. But most of researches don’t take into consideration of quantity discounts. In reality, the suppliers usually offer quantity discounts to increase sales. The discount is offered when order quantity achieves a certain number. Quantity discount is considered in this study. In literature review, the co

APA, Harvard, Vancouver, ISO, and other styles

15

Hsin-I, Chen, and 陳欣毅. "The Analysis of Joint Replenishment Problem with Marginal Quantity Discounts." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/65200107655062665980.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>工業工程與管理系<br>103<br>Problem of Joint replenishment in businesses is very important, and the number of order will affect the cost, and how we determine the order with supplier, and therefore we expect to mitigate relevant risks of cost when ordering. In order to minimize the cost under our expectation, we aimed to study different production of replenishment cycle. However, in most of the studies, we found marginal quantity discounts are not being considered, and this is not reasonable in the real situation. As a result, under the precondition of Joint replenishment, I would lik

APA, Harvard, Vancouver, ISO, and other styles

16

Sung, June-Chun, and 宋振昌. "An Integrated Production-Inventory System Joint Replenishment Problem with Imperfect Production Process." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/34954991835261189161.

Full text

Abstract:

博士<br>中原大學<br>工業工程研究所<br>96<br>The classical Economic Ordering Quantity (EOQ) model and the Economic Production Quantity (EPQ) model are the most frequently adopted inventory control models for material purchasing and product manufacturing. Numerous research efforts have been undertaken over the past few decades to extend both models by relaxing various idealistic assumptions so that the models can resemble the real industry situations closely. One of those extensions for solving the inventory problem of the finished product and its input raw materials simultaneously was the integrated product

APA, Harvard, Vancouver, ISO, and other styles

17

Chen, Yu-Chia, and 陳昱嘉. "The Analysis of Joint Replenishment Problem Under the Limitation of Transport Capacity." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/70016970360485753457.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>100<br>To the enterprises in general, besides of expanding sales market, how to control one’s operating costs so as to improve one enterprise’s competitiveness is as well a key-point of what an enterprise most concerns about. Inventory cost usually plays a key role in the operating costs. And about the strategy a company usually use on inventory replenishment is by using the concept of economic order quantity (EOQ) to indent proposed by Harris【1915】. The EOQ strategy on the inventory replenishment is quite effective, but to those diverse products, this kind o

APA, Harvard, Vancouver, ISO, and other styles

18

Hsu, Chih-Hsin, and 許之馨. "On the joint replenishment problem with quantity discounts under power-of-two policies." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/22315239909289958409.

Full text

Abstract:

碩士<br>國立交通大學<br>運輸與物流管理學系<br>102<br>The joint replenishment problem (JRP) determines the replenishment cycle time and lot size of each item so as to minimize the total costs per unit time. In this study, we consider the joint replenishment problem with quantity discount under power-of-two policies (JRPQD-PoT). Because of the quantity discount, the purchasing cost isn’t constant any more. The objective of the JRPQD-PoT is to minimize the total costs incurred per unit time. The costs considered generally include setup costs, inventory holding costs and purchasing cost. In this study, we propose

APA, Harvard, Vancouver, ISO, and other styles

19

Chen, Jiun-Yi, and 陳均宜. "On the Joint Replenishment Problem Considering Transportation Costs and Material Handling Capacity Constraints." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/98710353707176093505.

Full text

Abstract:

碩士<br>國立交通大學<br>運輸與物流管理學系<br>101<br>The conventional Joint Replenishment Problem (JRP) considers the following cost terms: (1) major setup cost, (2) minor setup cost and (3) holding cost. This study focuses on the extension of the JRP by taking into account the container transportation cost and the capacity constraints of the material handling facilities. We formulate a mathematical model for the concerned problem. Also, we conduct theoretical analysis for the transportation cost with respect to the number of required containers and the value of the basic period. Our theoretical results facili

APA, Harvard, Vancouver, ISO, and other styles

20

Lee, Fang-Chuan, and 李芳娟. "A Global Optimum Search Algorithm for the Joint Replenishment Problem under Power-of-Two Policy." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/16030425895654530441.

Full text

Abstract:

碩士<br>東海大學<br>工業工程學系<br>89<br>In this study, we perform theoretical analysis and derive a global optimum search algorithm for the Joint Replenishment Problem (JRP) under Power-of-Two (PoT) policy. The JRP models concern how to determine lot sizes and to schedule replenishment times for products so as to minimize the total costs per unit time. PoT policy requires replenishment frequency of each product, denoted by ki, to be a PoT integer, i.e., ki = 2p where p = 0, 1, 2, …. By utilizing a 10-product example, we graphically present the curve of the optimal total cost with respect to the values o

APA, Harvard, Vancouver, ISO, and other styles

21

Cheng, Wei-Ting, and 鄭偉廷. "A Tabu Search Approach based on a Hybrid Grouping Strategy to the Joint Replenishment Problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/73450424705608395624.

Full text

Abstract:

碩士<br>逢甲大學<br>工業工程與系統管理學研究所<br>95<br>The Joint Replenishment Problem (JRP) deals with the problem of determining a replenishment policy that minimizes that total cost of replenishing multiple products from a single supplier. The total cost considered in the JRP consists of a major ordering cost which is independent to the number of items in the order, a minor ordering cost depending on the items in the order, and the holding cost. In this study a concept of Direct Grouping Strategy (DGS) will be employed to solve the JRP. For a DGS, each type of item will be assigned with a group number. The i

APA, Harvard, Vancouver, ISO, and other styles

22

Liou, Syuan-Hong, and 劉選泓. "The Periodic Vehicle Routing Problem with the Joint Replenishment Planning under Two-Echelon Supply Chain Environment." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/41317703639311233137.

Full text

Abstract:

碩士<br>雲林科技大學<br>工業工程與管理研究所碩士班<br>98<br>This study fries to integrate the joint replenishment problem and the periodic vehicle routing problem under two-echelon supply chain environment. A mathematical model is first developed to minimize the total operating costs which includes inventory cost, ordering cost, and transportation cost. A heuristic algorithm based on the tabu search is then constructed to find the best combination of vehicle service types. The model and solution algorithm are verified by numerical examples. Finally, a sensitively analysis is also conducted by testing different veh

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!