Imagen de Portada

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kaul, Matthias, Mnich, Matthias, Molter, Hendrik
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Treewidth Parameterized by Feedback Vertex Number
por: Molter, Hendrik, et al.
Publicado: (2025)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
por: Heeger, Klaus, et al.
Publicado: (2024)

Fairness in Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2021)

Algorithmic Aspects of Temporal Betweenness
por: Buß, Sebastian, et al.
Publicado: (2020)

Temporal Graph Realization With Bounded Stretch
por: Mertzios, George B., et al.
Publicado: (2025)

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
por: Heeger, Klaus, et al.
Publicado: (2024)

The Complexity of Transitively Orienting Temporal Graphs
por: Mertzios, George B., et al.
Publicado: (2021)

Pinwheel Scheduling with Real Periods
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

Cuts and Gauges for Submodular Width
por: Lanzinger, Matthias
Publicado: (2026)

Discrepancy Minimization via Regularization
por: Pesenti, Lucas, et al.
Publicado: (2022)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
por: Bentert, Matthias, et al.
Publicado: (2024)

When does FTP become FPT?
por: Bentert, Matthias, et al.
Publicado: (2025)

Fault-Tolerant Matroid Bases
por: Bentert, Matthias, et al.
Publicado: (2025)

Parameterized Complexity of Submodular Minimization under Uncertainty
por: Kakimura, Naonori, et al.
Publicado: (2024)

Fast Makespan Minimization via Short ILPs
por: Hermelin, Danny, et al.
Publicado: (2026)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
por: Bentert, Matthias, et al.
Publicado: (2026)

On the Number of Non-equivalent Parameterized Squares in a String
por: Hamai, Rikuya, et al.
Publicado: (2024)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
por: Fomin, Fedor V., et al.
Publicado: (2024)

A Unified Approach to Minimizing Symmetric Submodular Functions
por: Iwata, Satoru, et al.
Publicado: (2026)

Updating Lower and Upper Bounds for the Job-Shop Scheduling Problem Test Instances
por: Graviers, Marc-Emmanuel Coupvent des, et al.
Publicado: (2025)

Hardness of Burning Number Problem on Regular Graphs
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Constructive l2-Discrepancy Minimization with Additive Deviations
por: Dutta, Kunal
Publicado: (2025)

Tree Independence Number IV. Even-hole-free Graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

The Days On Days Off Scheduling Problem
por: Nießen, Fabien, et al.
Publicado: (2024)

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

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

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)

Circular-arc graphs and the Helly property
por: Derbisz, Jan, et al.
Publicado: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Detecting Disjoint Shortest Paths in Linear Time and More
por: Akmal, Shyan, et al.
Publicado: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

Deterministic counting from coupling independence
por: Chen, Xiaoyu, et al.
Publicado: (2024)

Stability in Graphs with Matroid Constraints
por: Fomin, Fedor V., et al.
Publicado: (2024)

Generalizing Roberts' characterization of unit interval graphs
por: Martínez, Virginia Ardévol, et al.
Publicado: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
por: Kakimura, Naonori, et al.
Publicado: (2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
por: Disser, Yann, et al.
Publicado: (2024)

Nearly Tight Bounds on Testing of Metric Properties
por: Bao, Yiqiao, et al.
Publicado: (2024)