Online Algorithms for Multilevel Aggregation
From MaRDI portal
Publication:5130492
DOI10.1287/opre.2019.1847zbMath1445.90019OpenAlexW2997039462WikidataQ126413105 ScholiaQ126413105MaRDI QIDQ5130492
Marcin Bienkowski, Jaroslaw Byrka, Jiří Sgall, Nguyen Kim Thang, Martin Böhm, Pavel Veselý, Łukasz Jeż, Lukáš Folwarczný, Marek Chrobak, Christoph Dürr
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6363/
online algorithmslot sizingalgorithmic aspects of networksscheduling and resource allocationmultistage assembly problem
Related Items (2)
The last dozen of years of or research in Czechia and Slovakia ⋮ New results on multi-level aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the joint replenishment problem with deadlines
- Online algorithms. The state of the art
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- Dynamic Version of the Economic Lot Size Model
- Online Control Message Aggregation in Chain Networks
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- A guessing game and randomized online algorithms
- On-line analysis of the TCP acknowledgment delay problem
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Improved Algorithms for Economic Lot Size Problems
- Dynamic TCP acknowledgment in the LogP model
- Make-to-Order Integrated Scheduling and Distribution
- O(depth)-Competitive Algorithm for Online Multi-level Aggregation
- Online service with delay
- Better Approximation Bounds for the Joint Replenishment Problem
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Dynamic TCP Acknowledgment: Penalizing Long Delays
- Brief announcement
This page was built for publication: Online Algorithms for Multilevel Aggregation
