Image de couverture de livre

Total Completion Time Scheduling Under Scenarios

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bosman, Thomas, van Ee, Martijn, Ergen, Ekin, Imreh, Csanad, Marchetti-Spaccamela, Alberto, Skutella, Martin, Stougie, Leen
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Makespan Scheduling under Scenarios
par: Ergen, Ekin
Publié: (2025)

String Sanitization Under Edit Distance: Improved and Generalized
par: Mieno, Takuya, et autres
Publié: (2020)

Online Flow Time Minimization with Gradually Revealed Jobs
par: Lindermayr, Alexander, et autres
Publié: (2026)

When is String Reconstruction using de Bruijn Graphs Hard?
par: Bals, Ben, et autres
Publié: (2025)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
par: Amanatidis, Georgios, et autres
Publié: (2021)

Integer and Unsplittable Multiflows in Series-Parallel Digraphs
par: Almoghrabi, Mohammed Majthoub, et autres
Publié: (2024)

Unsplittable Transshipments
par: Debgupta, Srinwanti, et autres
Publié: (2026)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
par: Hermelin, Danny, et autres
Publié: (2025)

Temporal Routing in Static Networks: The Schedule Completion Problem
par: Döring, Michelle, et autres
Publié: (2026)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
par: Sinhal, Anay, et autres
Publié: (2026)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
par: Kawase, Yasushi, et autres
Publié: (2025)

Weighted Chairman Assignment and Flow-Time Scheduling
par: Liu, Siyue, et autres
Publié: (2025)

Online Flexible Busy Time Scheduling on Heterogeneous Machines
par: Calinescu, Gruia, et autres
Publié: (2024)

Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
par: Erlebach, Thomas, et autres
Publié: (2026)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
par: Haas, Niklas, et autres
Publié: (2025)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
par: Gupta, Anupam, et autres
Publié: (2026)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
par: Chen, Qingyun, et autres
Publié: (2024)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
par: Lindermayr, Alexander, et autres
Publié: (2026)

A $(4/3+\varepsilon)$-Approximation for Preemptive Scheduling with Batch Setup Times
par: Deppert, Max A., et autres
Publié: (2025)

Tight Bounds for Sorting Under Partial Information
par: van der Hoog, Ivor, et autres
Publié: (2024)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
par: Mendoza-Cadena, Mirabel, et autres
Publié: (2026)

Last Truck Scheduling for Middle-mile Next-day Delivery Coverage
par: Benidis, Konstantinos, et autres
Publié: (2023)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
par: Hsieh, Yi-Ting, et autres
Publié: (2025)

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
par: Li, Shi
Publié: (2024)

Collision-Free Robot Scheduling
par: Adamson, Duncan, et autres
Publié: (2024)

Fixed Order Scheduling with Deadlines
par: Berger, Andre, et autres
Publié: (2024)

Crane Scheduling Problem with Energy Saving
par: Gao, Yixiong, et autres
Publié: (2025)

Engineering Optimal Parallel Task Scheduling
par: Akram, Matthew, et autres
Publié: (2024)

Non-Clairvoyant Scheduling with Progress Bars
par: Benomar, Ziyad, et autres
Publié: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

Scheduling on a Stochastic Number of Machines
par: Buchem, Moritz, et autres
Publié: (2024)

Public Event Scheduling with Busy Agents
par: Li, Bo, et autres
Publié: (2024)

Scenario-Based Robust Optimization of Tree Structures
par: Angelopoulos, Spyros, et autres
Publié: (2024)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
par: Aggarwal, Divesh, et autres
Publié: (2024)

An Empirical Study of Online Packet Scheduling Algorithms
par: Sakr, Nourhan, et autres
Publié: (2016)

Root-to-Leaf Scheduling in Write-Optimized Trees
par: Chung, Christopher, et autres
Publié: (2024)

Revoke vs. Restart in Unweighted Throughput Scheduling
par: He, Changdao
Publié: (2025)

Online Drone Scheduling for Last-mile Delivery
par: Jana, Saswata, et autres
Publié: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
par: Kuszmaul, William, et autres
Publié: (2024)

Finite Pinwheel Scheduling: the k-Visits Problem
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)