Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2024

Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization

Résumé

This paper addresses the triangle width problem, which generalizes the classic two-machine flexible job-shop problem (FJSP) with tooling constraints. This new problem can be studied from three different angles: scheduling, matrix visualization, and vertex ordering in hypergraphs. We prove the equivalence of the different formulations of the problem and use them to establish the N P-Hardness and polynomiality of several of its subcases. This problem allows us to find more elegant (and probably shorter) proofs for several combinatorial problems in our analysis setting. Our study provides an elegant generalization of Johnson’s argument for the two-machine flow shop. It also shows the relation between the question: “Is a matrix triangular?” and the “k-visit of a graph”
Fichier non déposé

Dates et versions

hal-04509707 , version 1 (18-03-2024)

Identifiants

Citer

Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray. Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. Annals of Operations Research, 2024, ⟨10.1007/s10479-024-05890-0⟩. ⟨hal-04509707⟩

Collections

UNIV-TOURS CNRS
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More