Abstract
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 \(\mathcal{N}\mathcal{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”.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arbib, C., Flammini, M., & Nardelli, E. (2000). How to survive while visiting a graph. Discrete applied mathematics, 99(1–3), 279–293.
Fertin, G., Rusu, I., & Vialette, S. (2015). Obtaining a triangular matrix by independent row-column permutations. International symposium on algorithms and computation (pp. 165–175). Springer.
Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). W.H. Freeman.
Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.
Hadj Salem, K., Kieffer, Y., & Mancini, M. (2018). Meeting the challenges of optimized memory management in embedded vision systems using operations research (pp. 177–205). Springer International Publishing.
Hadj Salem, K., Kieffer, Y., & Mancini, M. (2016). Formulation and practical solution for the optimization of memory accesses in embedded vision systems, in Proceedings of the 2016 Federated Conference on Computer Science and Information System, FedCSIS 2016, Gdańsk, Poland, September 11–14, 2016, pp. 609–617.
Luss, H. (1982). Operations research and capacity expansion problems: A survey. Operations Research, 30(5), 907–947.
Mitten, L. (1959). Sequencing n jobs on two machines with arbitrary time lags. Management Science, 5(3), 293–298.
Murphy, M. C., & Rotem, D. (1993). Multiprocessor join scheduling. IEEE Transactions on Knowledge and Data Engineering, 5(2), 322–338.
Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems. Springer.
Wilf, H. S. (1993). On crossing numbers, and some unsolved problems, in Combinatorics, geometry and probability, (pp. 557–562) Cambridge.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Hadj Salem, K., Libralesso, L., Jost, V. et al. Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. Ann Oper Res (2024). https://doi.org/10.1007/s10479-024-05890-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10479-024-05890-0