Filters








1,207 Hits in 6.7 sec

APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES

TIM NONNER, ALEXANDER SOUZA
2009 Discrete Mathematics, Algorithms and Applications (DMAA)  
The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse.  ...  For this case, we present a randomized 5/3-approximation algorithm. We moreover prove that JRP with deadlines is APX-hard.  ...  Introduction The Joint Replenishment Problem (JRP) is one of the fundamental problems in inventory theory [1] .  ... 
doi:10.1142/s1793830909000130 fatcat:s5ly5i55fzgjjofh3l7pxmxqum

Approximation algorithms for the joint replenishment problem with deadlines

Marcin Bienkowski, Jarosław Byrka, Marek Chrobak, Neil Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Świrszcz, Neal E. Young
2014 Journal of Scheduling  
The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a supplier to retailers.  ...  We study the approximability of JRP-D, the version of JRP with deadlines, where instead of waiting costs the retailers impose strict deadlines.  ...  In JRP, instead of having a deadline, each demand is associated with a Approximation Algorithms for Joint Replenishment Problem with Deadlines 3 delay-cost function that specifies the cost for the delay  ... 
doi:10.1007/s10951-014-0392-y fatcat:uc5n6tj4dvaj5gtcwfemtbl36i

Approximation Algorithms for the Joint Replenishment Problem with Deadlines [chapter]

Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Świrszcz, Neal E. Young
2013 Lecture Notes in Computer Science  
The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods over time from a supplier to retailers.  ...  We study the approximability of JRP with deadlines, where instead of waiting costs the retailers impose strict deadlines.  ...  In JRP, instead of having a deadline, each demand is associated with a Approximation Algorithms for Joint Replenishment Problem with Deadlines 3 delay-cost function that specifies the cost for the delay  ... 
doi:10.1007/978-3-642-39206-1_12 fatcat:ojwlvgkuh5h2nky6kj5r6ltntq

Better Approximation Bounds for the Joint Replenishment Problem [article]

Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Łukasz Jeż, Jiří Sgall
2013 arXiv   pre-print
The Joint Replenishment Problem (JRP) deals with optimizing shipments of goods from a supplier to retailers through a shared warehouse.  ...  In the offline case, we give an algorithm with ratio 1.791, breaking the barrier of 1.8.  ...  This multi-level JRP problem with deadlines was studied by Bechetti et al. [2] , who provided a 2-approximation algorithm. Khanna et al. [7] considered the case of linear waiting costs.  ... 
arXiv:1307.2531v1 fatcat:wvmzr5lugfbmbkc32c32nnpzc4

Scheduling (Dagstuhl Seminar 20081)

Nicole Megow, David Shmoys, Ola Svensson
2020 Dagstuhl Reports  
The seminar focused on the interplay between scheduling problems and problems that arise in the management of transportation and traffic.  ...  Important aspects at the intersection of these two research directions include data-driven approaches in dynamic decision-making, scheduling in combination with routing, shared mobility, and coordination  ...  The authors present a way to transform instances of 1|r j , d j | j p j U j into instances of P 2|prec|C max , and show that an o(log n)-level Sherali-Adams lift does not lead to a (1 + ) approximation  ... 
doi:10.4230/dagrep.10.2.50 dblp:journals/dagstuhl-reports/MegowSS20 fatcat:dtrzez6ogbhdjc56hbnv3hyuhy

Better Approximation Bounds for the Joint Replenishment Problem [chapter]

Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Łukasz Jeż, Dorian Nogneng, Jiří Sgall
2013 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms  
The Joint Replenishment Problem (JRP) deals with optimizing shipments of goods from a supplier to retailers through a shared warehouse.  ...  This ratio can be reduced to ≈ 1.574 for the JRP-D model, where there is no cost for waiting but orders have deadlines.  ...  Introduction The Joint Replenishment Problem (JRP) deals with optimizing shipments of goods from a supplier to a set R of retailers through a shared warehouse.  ... 
doi:10.1137/1.9781611973402.4 dblp:conf/soda/BienkowskiBCJNS14 fatcat:agkjm5fttfcdtdpwvklnzkjxgq

Page 662 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
Summary: “We consider the problem of scheduling n preemptive jobs with deadlines on m identical parallel machines so as to minimize total completion time.  ...  Summary: “We study an assemble-to-order system with stochastic leadtimes for component replenishment.  ... 

Wireless Rechargeable Sensor Networks - Current Status and Future Trends

Yuanyuan Yang, Cong Wang, Ji Li
2015 Journal of Communications  
Recent advances in wireless energy transfer have opened up a new dimension to resolve the network lifetime problem.  ...  We also show how this novel technology can be integrated with typical sensing applications and envision future directions in this area.  ...  By taking reasonable approximations, the Orienteering Problem can be approximated by a Knapsack problem and dynamic programming solutions are available to solve the problem efficiently.  ... 
doi:10.12720/jcm.10.9.696-706 fatcat:2thwp2urpzfmhc5np2ren5qwoq

Scheduling aperiodic tasks in dynamic priority systems

Marco Spuri, Giorgio Buttazzo
1996 Real-time systems  
In this paper we present ve new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm  ...  Let J (t) be the set of the current active periodic instances (ready but not yet completed) and the future periodic instances. The new task J is scheduled together with the tasks in J (t).  ...  At t i m e t = 0, the aperiodic capacities C 6 S (with deadline 6), C 8 S1 (with deadline 8) and C 12 S2 (with deadline 12) are set to 3, 0 and 0.  ... 
doi:10.1007/bf00360340 fatcat:6xrgpbemtfdqnebbcesercg2ru

O(depth)-Competitive Algorithm for Online Multi-level Aggregation [article]

Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon
2017 arXiv   pre-print
It is also related to the well studied TCP-acknowledgement problem and the online joint replenishment problem.  ...  In this problem requests arrive over time at the nodes of the tree, and each request specifies a deadline.  ...  The aggregation problem for trees of depth 2 is known as the Joint Replenishment Problem in supplychain management.  ... 
arXiv:1701.01936v1 fatcat:cuv7q56k4jfpddyntowrysxhfq

Deadline-Driven Multi-node Mobile Charging [article]

Xunpeng Rao, Panlong Yang, Haipeng Dai, Tao Wu, Hao Zhou, Jing Zhao, Linlin Chen, Peng-Jun Wan
2018 arXiv   pre-print
In this paper, we study mobile charger scheduling problem for multi-node recharging with deadline-series.  ...  1/2 -approximation greedy algorithm.  ...  Most of existing researches [5] [8] study the mobile charger scheduling with single-node mode, and then formulate the problem into the typical traveling salesman problem or orienteering problem.  ... 
arXiv:1810.12385v1 fatcat:lriww3nwx5cz3f47s6uojn6cbi

Multi-vehicle Coordination for Wireless Energy Replenishment in Sensor Networks

Cong Wang, Ji Li, Fan Ye, Yuanyuan Yang
2013 2013 IEEE 27th International Symposium on Parallel and Distributed Processing  
We formulate the optimization problem into a Multiple Traveling Salesman Problem with Deadlines (m-TSP with Deadlines), which is NP-hard.  ...  Mobile vehicles equipped with wireless energy transmission technology can recharge sensor nodes over the air.  ...  Then we find that the EROMS problem can be formulated as a Multiple Traveling Salesmen Problem with Deadlines (m-TSP with Deadlines) [24] , which is NP-hard.  ... 
doi:10.1109/ipdps.2013.22 dblp:conf/ipps/WangLYY13 fatcat:fbygllk2rbfkjccf52j3mpxoci

Management Insights

2011 Production and operations management  
The authors investigated the joint shelf space allocation and inventory control problem taking into account these two factors.  ...  Optimal Control of Replenishment and Substitution in an Inventory System with Nonstationary Batch Demand He Xu, David D.  ... 
doi:10.1111/j.1937-5956.2011.01184.x fatcat:jgwvuuiudrgetpcxocw5fcq5ue

Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System

Yalçin Akçay, Susan H. Xu
2004 Management science  
We also use the sample average approximation method to determine the optimal base-stock levels and compare it with two variations of the equal fractile heuristic.  ...  We show that the component allocation problem is a general multidimensional knapsack problem (MDKP) and is NP-hard.  ...  We believe that for the ATO system with batch product demands, this performance measure reflects the true meaning of service from customers' perspective. 2.  ... 
doi:10.1287/mnsc.1030.0167 fatcat:5qbxzbyeangh7hcgx5m5ihpdge

Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms

Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
2013 Operations Research  
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental role in broader planning  ...  We also prove a lower bound of approximately 2.64 on the competitiveness of any deterministic online algorithm for the problem.  ...  Acknowledgements: We thank Andreas Wächter for his great help in using his non-linear programming solver IPOPT [17] and Grzegorz Swirszcz for finding several errors in the exposition of the lower bound  ... 
doi:10.1287/opre.2013.1188 fatcat:w6dmb4luujgdhaoh3xrivi7zy4
« Previous Showing results 1 — 15 out of 1,207 results