Joint replenishment meets scheduling
From MaRDI portal
Publication:6102849
DOI10.1007/s10951-022-00768-0zbMath1517.90047arXiv2104.09178OpenAlexW3153878287MaRDI QIDQ6102849
Tamás Kis, József Békési, Péter Györgyi, Tímea Tamási
Publication date: 23 June 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.09178
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The submodular joint replenishment problem
- On-line supply chain scheduling problems with preemption
- Approximation algorithms for the joint replenishment problem with deadlines
- Competitive snoopy caching
- Computational complexity of uncapacitated multi-echelon production planning problems
- Competitive randomized algorithms for nonuniform problems
- Scheduling equal-length jobs on identical parallel machines
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- A review of the joint replenishment problem literature: 1989--2005
- Approximation Techniques for Average Completion Time Scheduling
- Single Machine Scheduling with Release Dates
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Make-to-Order Integrated Scheduling and Distribution
- Optimal on-line algorithms for single-machine scheduling
- Minimizing weighted flow time
- Improved Approximation Algorithms for Inventory Problems
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms
- Algorithms for minimizing weighted flow time
- Better Approximation Bounds for the Joint Replenishment Problem
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: Joint replenishment meets scheduling
