scientific article; zbMATH DE number 7378626
From MaRDI portal
Publication:5009506
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.14MaRDI QIDQ5009506
Ning Kang, Yu-Hao Zhang, Xiaowei Wu, Zhihao Gavin Tang, Zhi-Yi Huang
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.02207
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Online scheduling with a buffer on related machines
- Minimizing total flow time and total completion time with immediate dispatching
- New algorithms for an ancient scheduling problem.
- Preemptive online scheduling: Optimal algorithms for all speeds
- Semi on-line algorithms for the partition problem
- Preemptive on-line scheduling for two uniform processors
- A lower bound for randomized on-line scheduling algorithms
- Scheduling on identical machines: How good is LPT in an on-line setting?
- On-line scheduling revisited
- New lower and upper bounds for on-line scheduling
- An optimal algorithm for preemptive on-line scheduling
- A lower bound for on-line scheduling on uniformly related machines
- The Power of Reordering for Online Minimum Makespan Scheduling
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- A Better Algorithm for an Ancient Scheduling Problem
- On-Line Load Balancing for Related Machines
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
- Bounds on Multiprocessing Timing Anomalies
- Preemptive Online Scheduling with Reordering
- On-line scheduling on a single machine: Maximizing the number of early jobs
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication:
