Joint replenishment meets scheduling
From MaRDI portal
Abstract: In this paper we consider a combination of the joint replenishment problem (JRP) and single machine scheduling with release dates. There is a single machine and one or more item types. Each job has a release date, a positive processing time, and it requires a subset of items. A job can be started at time only if all the required item types were replenished between the release date of the job and time point . The ordering of item types for distinct jobs can be combined. The objective is to minimize the total ordering cost plus a scheduling criterion, such as total weighted completion time or maximum flow time, where the cost of ordering a subset of items simultaneously is the sum of a joint ordering cost, and an additional item ordering cost for each item type in the subset. We provide several complexity results for the offline problem, and competitive analysis for online variants with min-sum and min-max criteria, respectively.
Recommendations
- Joint Replenishment in Multi-Item Inventory Systems
- Scheduling the replenishment of just-in-time supermarkets in assembly plants
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- Cyclical schedules for the joint replenishment problem with dynamic demands
- Supply chain scheduling
- A new method for joint replenishment problems
- Coordinating supply chain inventories through common replenishment epochs
- scientific article; zbMATH DE number 5773643
- A joint replenishment inventory-location model
- scientific article; zbMATH DE number 6830871
Cites work
- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
- A constant approximation algorithm for the one-warehouse multiretailer problem
- A review of the joint replenishment problem literature: 1989--2005
- Algorithms for minimizing weighted flow time
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- Approximation techniques for average completion time scheduling
- Better Approximation Bounds for the Joint Replenishment Problem
- Competitive randomized algorithms for nonuniform problems
- Competitive snoopy caching
- Computational complexity of uncapacitated multi-echelon production planning problems
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1834660 (Why is no real title available?)
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
- Improved approximation algorithms for inventory problems
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Latency-constrained aggregation in sensor networks
- Make-to-order integrated scheduling and distribution
- Minimizing weighted flow time
- On-line supply chain scheduling problems with preemption
- Online make-to-order joint replenishment model: primal-dual competitive algorithms
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Optimal on-line algorithms for single-machine scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Scheduling equal-length jobs on identical parallel machines
- Single machine scheduling with release dates
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- The submodular joint replenishment problem
Cited in
(4)
This page was built for publication: Joint replenishment meets scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102849)
