Copertina

On scheduling coupled tasks with exact delays to minimize maximum lateness

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Kubiak, Wiesław
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Shared Processor Scheduling of Multiprocessor Jobs
di: Dereniowski, Dariusz, et al.
Pubblicazione: (2018)

An exact approach for the multi-depot electric vehicle scheduling problem
di: Haslinger, Xenia, et al.
Pubblicazione: (2025)

Task scheduling for autonomous vehicles in the Martian environment
di: Burzyński, Wojciech, et al.
Pubblicazione: (2024)

Approximation algorithms for job scheduling with block-type conflict graphs
di: Furmańczyk, Hanna, et al.
Pubblicazione: (2022)

A stochastic programming approach for the scheduling of medical interpreting service under uncertainty
di: Ahmed, Abdulaziz, et al.
Pubblicazione: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
di: Bašić, Milan
Pubblicazione: (2026)

Extended formulations for the maximum weighted co-2-plex problem
di: Dupont-Bouillard, Alexandre, et al.
Pubblicazione: (2025)

An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters
di: Donne, Diego Delle, et al.
Pubblicazione: (2024)

Minimizing breaks by minimizing odd cycle transversals
di: Fujii, Koichi, et al.
Pubblicazione: (2024)

A sequential solution to the density classification task using an intermediate alphabet
di: Perrotin, Pacôme, et al.
Pubblicazione: (2024)

Order acceptance and scheduling in capacitated job shops
di: Linß, Florian, et al.
Pubblicazione: (2024)

A note on the exact partition polytope of Frieze and Teng
di: Narayanan, Krishna, et al.
Pubblicazione: (2026)

The exact value of $c_1(K_{2,n})$
di: Mori, Hiroaki
Pubblicazione: (2026)

Compact formulations and valid inequalities for parallel machine scheduling with conflicts
di: Moura, Phablo F. S., et al.
Pubblicazione: (2023)

Improved lower bounds on the maximum size of graphs with girth 5
di: Goedgebeur, Jan, et al.
Pubblicazione: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
di: Rzążewski, Paweł, et al.
Pubblicazione: (2024)

Complete polyhedral description of chemical graphs of maximum degree at most 3
di: Dusollier, Valentin, et al.
Pubblicazione: (2025)

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
di: Lucci, Mauro, et al.
Pubblicazione: (2021)

On maximum-sum matchings of bichromatic points
di: Chacón-Rivera, Oscar, et al.
Pubblicazione: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
di: Botler, Fábio, et al.
Pubblicazione: (2025)

Extremal minimal bipartite matching covered graphs
di: Mallik, Amit Kumar, et al.
Pubblicazione: (2024)

Multi-machine preventative maintenance scheduling with imperfect interventions: a restless bandit approach
di: Ruiz-Hernandez, Diego, et al.
Pubblicazione: (2024)

A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling
di: Khadivi, Maziyar, et al.
Pubblicazione: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
di: Dailly, Antoine, et al.
Pubblicazione: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
di: Bastida, Sam, et al.
Pubblicazione: (2026)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
di: Bonte, Sébastien, et al.
Pubblicazione: (2025)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
di: Bangerter, Elise, et al.
Pubblicazione: (2026)

A polynomial bound for the minimal excluded minors for a surface
di: Houdaigoui, Sarah, et al.
Pubblicazione: (2026)

A quasi-polynomial bound for the minimal excluded minors for a surface
di: Houdaigoui, Sarah, et al.
Pubblicazione: (2025)

Matroid products via submodular coupling
di: Bérczi, Kristóf, et al.
Pubblicazione: (2024)

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
di: Kutner, David C., et al.
Pubblicazione: (2025)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
di: Bonte, Sébastien, et al.
Pubblicazione: (2025)

On the maximum number of tangencies among $1$-intersecting curves
di: Ackerman, Eyal, et al.
Pubblicazione: (2026)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
di: Pilipczuk, Marcin, et al.
Pubblicazione: (2023)

Scheduling on identical machines with conflicts to minimize the mean flow time
di: Tellache, Nour ElHouda, et al.
Pubblicazione: (2025)

Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
di: Bozóki, Sándor, et al.
Pubblicazione: (2020)

Approximating maximum-size properly colored forests
di: Bai, Yuhang, et al.
Pubblicazione: (2024)

Improved lower bounds for the maximum size of Condorcet domains
di: Karpov, Alexander, et al.
Pubblicazione: (2026)

Testing popularity in linear time via maximum matching
di: Bérczi-Kovács, Erika, et al.
Pubblicazione: (2023)

Stable non-minimal fixed points of threshold-linear networks
di: Geneson, Jesse
Pubblicazione: (2025)