Image de couverture de livre

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Shuguang, Wen, Zhenxin, Wei, Jing
Format:	Preprint
Publié:	2025
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

Improved online load balancing with known makespan
par: Böhm, Martin, et autres
Publié: (2024)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
par: Harris, David G.
Publié: (2023)

Scheduling two types of jobs with minimum makespan
par: Cao, Song, et autres
Publié: (2024)

Parallel batch queries on dynamic trees: algorithms and experiments
par: Ikram, Humza, et autres
Publié: (2025)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
par: Fischer, David, et autres
Publié: (2022)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
par: Armbruster, Alexander, et autres
Publié: (2025)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
par: Mestel, David, et autres
Publié: (2024)

An online joint replenishment problem combined with single machine scheduling
par: Györgyi, Péter, et autres
Publié: (2022)

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
par: Vakhania, Nodari, et autres
Publié: (2024)

Speed-robust scheduling revisited
par: Minařík, Josef, et autres
Publié: (2024)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
par: Rajabi-Alni, Fatemeh, et autres
Publié: (2014)

Faster PBWT prefix-array access via batching
par: Gagie, Travis
Publié: (2026)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
par: Papadopoulos, Kleitos
Publié: (2024)

Online busy time scheduling with flexible jobs
par: Albers, Susanne, et autres
Publié: (2024)

A simpler QPTAS for scheduling jobs with precedence constraints
par: Das, Syamantak, et autres
Publié: (2025)

Stochastic scheduling with Bernoulli-type jobs through policy stratification
par: Antoniadis, Antonios, et autres
Publié: (2025)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
par: Tu, Sijing, et autres
Publié: (2025)

Real Time Proportional Throughput Maximization: How much advance notice should you give your scheduler?
par: Mottu, Nadim A.
Publié: (2025)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
par: Karczmarz, Adam, et autres
Publié: (2024)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
par: Blomer, Valentin, et autres
Publié: (2026)

Approximating maximum properly colored forests via degree bounded independent sets
par: Bai, Yuhang, et autres
Publié: (2025)

Improved approximation algorithms for the EPR Hamiltonian
par: Ju, Nathan, et autres
Publié: (2025)

The clustered Sparrow algorithm
par: Dumitrescu, Cristian
Publié: (2018)

Brief announcement: A special case of maximum flow over time with network changes
par: Chawla, Shuchi, et autres
Publié: (2026)

Streaming algorithms for products of probabilities
par: Lohrey, Markus, et autres
Publié: (2025)

Parameterized algorithms for $k$-Inversion
par: Antony, Dhanyamol, et autres
Publié: (2026)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
par: Jennings, David, et autres
Publié: (2023)

Improved Directed Expander Decompositions
par: Fleischmann, Henry, et autres
Publié: (2025)

An efficient heuristic for approximate maximum flow computations
par: Qian, Jingyun, et autres
Publié: (2024)

Perpetual maintenance of machines with different urgency requirements
par: Gąsieniec, Leszek, et autres
Publié: (2022)

A practical algorithm for 3-admissibility
par: Awofeso, Christine, et autres
Publié: (2025)

New algorithms for girth and cycle detection
par: Roditty, Liam, et autres
Publié: (2025)

Engineering Semi-streaming DFS algorithms
par: Bhagavan, Kancharla Nikhilesh, et autres
Publié: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
par: Leonhardt, Alexander, et autres
Publié: (2024)

Practical algorithms for Hierarchical overlap graphs
par: Talera, Saumya, et autres
Publié: (2024)

Approximate minimization of interpretations in fuzzy description logics under the Gödel semantics
par: Nguyen, Linh Anh
Publié: (2025)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
par: Kobayashi, Yasuaki, et autres
Publié: (2023)