115. Joint replenishment meets scheduling
Invited abstract in session FB-3: Approximation algorithms for scheduling problems, stream Approximation algorithms.
Friday, 10:15 - 11:45Room: C 104
Authors (first author is the speaker)
| 1. | Tamas Kis
|
| Institute for Computer Science and Control | |
| 2. | Péter Györgyi
|
| Institute for Computer Science and Control | |
| 3. | Timea Tamasi
|
| Institute for Computer Science and Control |
Abstract
In the talk I give an overview on the joint replenishment problem combined with machine scheduling.
In the joint replenishment problem a set of requests must be satisfied by ordering the corresponding items. Each request has a release date, and specifies an item type. Ordering an item incurs a fixed cost, which depends only on the item type. Requests for the same item can be fulfilled together to save ordering costs, but there is a penalty for late fulfillment. There are several variants of this classic O.R. problem, but its combination with machine scheduling has only recently begun to be investigated.
In the combined problem, after ordering some items, they have to be processed on a machine to fulfill the requests.
I will summarize complexity results, and describe approximation as well as online algorithms for different cost functions under various conditions.
Keywords
- Analysis and engineering of optimization algorithms
- Complexity and efficiency of optimization algorithms
- Optimization in industry, business and finance
Status: accepted
Back to the list of papers