Copertina

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hertrich, Christoph, Weiß, Christian, Ackermann, Heiner, Heydrich, Sandy, Krumke, Sven O.
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Online Flexible Busy Time Scheduling on Heterogeneous Machines
di: Calinescu, Gruia, et al.
Pubblicazione: (2024)

An Empirical Study of Online Packet Scheduling Algorithms
di: Sakr, Nourhan, et al.
Pubblicazione: (2016)

Flow Shop Scheduling with Stochastic Reentry
di: von Aspern, Maximilian, et al.
Pubblicazione: (2026)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
di: Das, Rathish, et al.
Pubblicazione: (2025)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
di: Chen, Qingyun, et al.
Pubblicazione: (2024)

Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
di: Jeang, John, et al.
Pubblicazione: (2026)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
di: Ghaffari, Mohsen, et al.
Pubblicazione: (2025)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
di: Sinhal, Anay, et al.
Pubblicazione: (2026)

A $(4/3+\varepsilon)$-Approximation for Preemptive Scheduling with Batch Setup Times
di: Deppert, Max A., et al.
Pubblicazione: (2025)

Efficient Matroid Intersection via a Batch-Update Auction Algorithm
di: Blikstad, Joakim, et al.
Pubblicazione: (2024)

Scheduling on a Stochastic Number of Machines
di: Buchem, Moritz, et al.
Pubblicazione: (2024)

Online Makespan Scheduling under Scenarios
di: Ergen, Ekin
Pubblicazione: (2025)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
di: Hertrich, Christoph, et al.
Pubblicazione: (2021)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
di: Geng, Yutong, et al.
Pubblicazione: (2025)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
di: Bringmann, Karl, et al.
Pubblicazione: (2026)

Online Drone Scheduling for Last-mile Delivery
di: Jana, Saswata, et al.
Pubblicazione: (2024)

Approximation Algorithms for Fair Repetitive Scheduling
di: Hermelin, Danny, et al.
Pubblicazione: (2025)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
di: Jäger, Sven, et al.
Pubblicazione: (2024)

Weighted Chairman Assignment and Flow-Time Scheduling
di: Liu, Siyue, et al.
Pubblicazione: (2025)

Singing a MIS
di: Irani, Sandy, et al.
Pubblicazione: (2025)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
di: Haas, Niklas, et al.
Pubblicazione: (2025)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
di: Jäger, Sven, et al.
Pubblicazione: (2022)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
di: Cole, Richard, et al.
Pubblicazione: (2023)

Cycle Basis Algorithms for Reducing Maximum Edge Participation
di: Wang, Fan, et al.
Pubblicazione: (2025)

Structural Results for High-Multiplicity Scheduling on Uniform Machines
di: Brinkop, Hauke, et al.
Pubblicazione: (2022)

Risk-Sensitive Online Algorithms
di: Christianson, Nicolas, et al.
Pubblicazione: (2024)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
di: Gupta, Anupam, et al.
Pubblicazione: (2026)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
di: Grus, Josef, et al.
Pubblicazione: (2024)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
di: Chen, Chi-Yeh
Pubblicazione: (2025)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
di: Lindermayr, Alexander, et al.
Pubblicazione: (2026)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
di: Kawase, Yasushi, et al.
Pubblicazione: (2025)

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
di: Chen, Chi-Yeh
Pubblicazione: (2026)

Online Algorithms with Randomly Infused Advice
di: Emek, Yuval, et al.
Pubblicazione: (2023)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
di: Bhimaraju, Akhil, et al.
Pubblicazione: (2023)

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
di: Brinkop, Hauke, et al.
Pubblicazione: (2025)

Smaller and More Flexible Cuckoo Filters
di: Schmitz, Johanna Elena, et al.
Pubblicazione: (2025)

Dynamic Pricing Algorithms for Online Set Cover
di: Bender, Max, et al.
Pubblicazione: (2024)

Optimal Learning-Augmented Algorithm for Online Bidding
di: Lee, Changyeol, et al.
Pubblicazione: (2026)

Batched Ranged Random Integer Generation
di: Brackett-Rozinsky, Nevin, et al.
Pubblicazione: (2024)