Image de couverture de livre

Single machine rescheduling for new orders: properties and complexity results

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rener, Elena, Salassa, Fabio, T'kindt, Vincent
Format:	Preprint
Publié:	2023
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A new proof of Delahan's induced-universality result
par: Chappelon, Jonathan
Publié: (2026)

On the parameterized complexity of computing tree-partitions
par: Bodlaender, Hans L., et autres
Publié: (2022)

ELECTRE TRI-nB, pseudo-disjunctive: axiomatic and combinatorial results
par: Bouyssou, Denis, et autres
Publié: (2024)

An orderly algorithm for generation of Condorcet Domains
par: Zhou, Bei, et autres
Publié: (2025)

Ergodic properties of concurrent systems
par: Abbes, Samy, et autres
Publié: (2025)

Majority Boolean networks classifying density: structural characterization and complexity
par: Perrot, Kévin, et autres
Publié: (2026)

Axiomatic characterizations of dissimilarity orderings and distances between sets
par: Marchant, Thierry, et autres
Publié: (2025)

CAZAC sequence generation of any length with iterative projection onto unit circle: principle and first results
par: Amis, Karine, et autres
Publié: (2025)

A Systematic Study of Single-Anchor Logical Gadgets
par: Güngör, Fikret H.
Publié: (2025)

More results on the $z$-chromatic number of graphs
par: Khaleghi, Abbas, et autres
Publié: (2023)

Neighborhood complexity of planar graphs
par: Joret, Gwenaël, et autres
Publié: (2023)

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
par: Elbassioni, Khaled
Publié: (2024)

Revisiting Linear Width: Rethinking the Relationship between Single Ideal and Linear Obstacle
par: Fujita, Takaaki
Publié: (2023)

Computational complexity of covering regular trees
par: Bok, Jan, et autres
Publié: (2025)

Distribution of codewords on the faces of a hypercube and new combinatorial identities
par: Abdurakhmanov, Jamolidin K.
Publié: (2025)

Cyclic ordering of split matroids
par: Bérczi, Kristóf, et autres
Publié: (2024)

Odd coloring graphs with linear neighborhood complexity
par: Davies, James, et autres
Publié: (2025)

The complexity of computing the period and the exponent of a digraph
par: Kiefer, Stefan, et autres
Publié: (2024)

Labeling and folding multi-labeled trees
par: Moulton, Vincent, et autres
Publié: (2025)

Boundary rigidity of finite CAT(0) cube complexes
par: Chalopin, Jérémie, et autres
Publié: (2023)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
par: Hörsch, Florian, et autres
Publié: (2024)

On the order-diameter ratio of girth-diameter cages
par: Cambie, Stijn, et autres
Publié: (2025)

Subdivisions in dicritical digraphs with large order or digirth
par: Picasarri-Arrieta, Lucas, et autres
Publié: (2024)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
par: Botler, Fábio, et autres
Publié: (2024)

Erd\H os--Ko--Rado type results for partitions via spread approximations
par: Kupavskii, Andrey
Publié: (2023)

Note about the complexity of the acyclic orientation with parity constraint problem
par: Gravier, Sylvain, et autres
Publié: (2025)

Tree decompositions with small width, spread, order and degree
par: Wood, David R.
Publié: (2025)

List coloring ordered graphs with forbidden induced subgraphs
par: Piecyk, Marta, et autres
Publié: (2025)

Contact graphs of boxes with unidirectional contacts
par: Gonçalves, Daniel, et autres
Publié: (2023)

Relations between monotone complexity measures based on decision tree complexity
par: Byramji, Farzan, et autres
Publié: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
par: Beaudou, Laurent, et autres
Publié: (2025)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
par: Soltani, Hossein, et autres
Publié: (2018)

Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination
par: Das, Sandip, et autres
Publié: (2026)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
par: Pépin, Martin, et autres
Publié: (2023)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
par: Dukes, Mark, et autres
Publié: (2023)

Closure property of contraction-depth of matroids
par: Brianski, Marcin, et autres
Publié: (2023)

Planar induced paths via a decomposition into non-crossing ordered graphs
par: Duron, Julien, et autres
Publié: (2025)

A bound for the cops and robber problem in terms of 2-component order connectivity
par: Jain, Suryaansh, et autres
Publié: (2024)

Aircraft routing: periodicity and complexity
par: Meunier, Frédéric, et autres
Publié: (2025)