Saved in:
| Main Authors: | Hsieh, Yi-Ting, Kao, Mong-Jen, Liu, Jhong-Yun, Wang, Hung-Lung |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.15434 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Scheduling Jobs with Work-Inefficient Parallel Solutions
by: Kuszmaul, William, et al.
Published: (2024)
by: Kuszmaul, William, et al.
Published: (2024)
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
by: Haas, Niklas, et al.
Published: (2025)
by: Haas, Niklas, et al.
Published: (2025)
Scheduling Multi-Server Jobs is Not Easy
by: Vaze, Rahul
Published: (2024)
by: Vaze, Rahul
Published: (2024)
Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
by: Joshi, Amit
Published: (2025)
by: Joshi, Amit
Published: (2025)
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)
by: An, Hyung-Chan, et al.
Published: (2025)
Online Makespan Scheduling under Scenarios
by: Ergen, Ekin
Published: (2025)
by: Ergen, Ekin
Published: (2025)
A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
by: Jansen, Klaus, et al.
Published: (2026)
by: Jansen, Klaus, et al.
Published: (2026)
Approximation algorithms for Job Scheduling with reconfigurable resources
by: Bergé, Pierre, et al.
Published: (2023)
by: Bergé, Pierre, et al.
Published: (2023)
Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
by: Mendoza-Cadena, Mirabel, et al.
Published: (2026)
by: Mendoza-Cadena, Mirabel, et al.
Published: (2026)
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)
by: Kaul, Matthias, et al.
Published: (2024)
Energy-Efficient Scheduling with Predictions
by: Balkanski, Eric, et al.
Published: (2024)
by: Balkanski, Eric, et al.
Published: (2024)
A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)
by: Huang, Xin, et al.
Published: (2023)
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
by: Jäger, Sven, et al.
Published: (2024)
by: Jäger, Sven, et al.
Published: (2024)
Weighted Chairman Assignment and Flow-Time Scheduling
by: Liu, Siyue, et al.
Published: (2025)
by: Liu, Siyue, et al.
Published: (2025)
Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
Fixed Order Scheduling with Deadlines
by: Berger, Andre, et al.
Published: (2024)
by: Berger, Andre, et al.
Published: (2024)
Crane Scheduling Problem with Energy Saving
by: Gao, Yixiong, et al.
Published: (2025)
by: Gao, Yixiong, et al.
Published: (2025)
Non-Clairvoyant Scheduling with Progress Bars
by: Benomar, Ziyad, et al.
Published: (2025)
by: Benomar, Ziyad, et al.
Published: (2025)
Approximation Algorithms for Fair Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2025)
by: Hermelin, Danny, et al.
Published: (2025)
Engineering Optimal Parallel Task Scheduling
by: Akram, Matthew, et al.
Published: (2024)
by: Akram, Matthew, et al.
Published: (2024)
Scheduling on a Stochastic Number of Machines
by: Buchem, Moritz, et al.
Published: (2024)
by: Buchem, Moritz, et al.
Published: (2024)
Public Event Scheduling with Busy Agents
by: Li, Bo, et al.
Published: (2024)
by: Li, Bo, et al.
Published: (2024)
Revoke vs. Restart in Unweighted Throughput Scheduling
by: He, Changdao
Published: (2025)
by: He, Changdao
Published: (2025)
Finite Pinwheel Scheduling: the k-Visits Problem
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
An Empirical Study of Online Packet Scheduling Algorithms
by: Sakr, Nourhan, et al.
Published: (2016)
by: Sakr, Nourhan, et al.
Published: (2016)
Root-to-Leaf Scheduling in Write-Optimized Trees
by: Chung, Christopher, et al.
Published: (2024)
by: Chung, Christopher, et al.
Published: (2024)
Total Completion Time Scheduling Under Scenarios
by: Bosman, Thomas, et al.
Published: (2024)
by: Bosman, Thomas, et al.
Published: (2024)
Online Drone Scheduling for Last-mile Delivery
by: Jana, Saswata, et al.
Published: (2024)
by: Jana, Saswata, et al.
Published: (2024)
Scheduling two types of jobs with minimum makespan
by: Cao, Song, et al.
Published: (2024)
by: Cao, Song, et al.
Published: (2024)
Coloring 3-Colorable Graphs with Low Threshold Rank
by: Hsieh, Jun-Ting
Published: (2025)
by: Hsieh, Jun-Ting
Published: (2025)
Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021)
by: Hermelin, Danny, et al.
Published: (2021)
LLM Query Scheduling with Prefix Reuse and Latency Constraints
by: Dexter, Gregory, et al.
Published: (2025)
by: Dexter, Gregory, et al.
Published: (2025)
Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)
by: Rohwedder, Lars, et al.
Published: (2024)
Online Flexible Busy Time Scheduling on Heterogeneous Machines
by: Calinescu, Gruia, et al.
Published: (2024)
by: Calinescu, Gruia, et al.
Published: (2024)
A k-swap Local Search for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)
by: Rohwedder, Lars, et al.
Published: (2024)
Structural Results for High-Multiplicity Scheduling on Uniform Machines
by: Brinkop, Hauke, et al.
Published: (2022)
by: Brinkop, Hauke, et al.
Published: (2022)
Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)
by: Döring, Michelle, et al.
Published: (2026)
Correcting matrix products over the ring of integers
by: Wu, Yu-Lun, et al.
Published: (2023)
by: Wu, Yu-Lun, et al.
Published: (2023)
Scheduling on Identical Machines with Setup Time and Unknown Execution Time
by: Kawase, Yasushi, et al.
Published: (2025)
by: Kawase, Yasushi, et al.
Published: (2025)
Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
by: Das, Rathish, et al.
Published: (2025)
by: Das, Rathish, et al.
Published: (2025)
Similar Items
-
Scheduling Jobs with Work-Inefficient Parallel Solutions
by: Kuszmaul, William, et al.
Published: (2024) -
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
by: Haas, Niklas, et al.
Published: (2025) -
Scheduling Multi-Server Jobs is Not Easy
by: Vaze, Rahul
Published: (2024) -
Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
by: Joshi, Amit
Published: (2025) -
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)