Factorization and job scheduling: A connection via companion based matrix functions
From MaRDI portal
Publication:2564926
DOI10.1016/0024-3795(95)00163-8zbMath0862.15018OpenAlexW2114329276MaRDI QIDQ2564926
Publication date: 28 May 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1765/14334
rational functionfactorizationjob schedulingtwo machine flow shop problemzero polynomialcompanion based matrix functionspole polynomial
Factorization of matrices (15A23) Deterministic scheduling theory in operations research (90B35) Factorization theory (including Wiener-Hopf and spectral factorizations) of linear operators (47A68) Matrices over function rings in one or more variables (15A54)
Related Items
Quasicomplete factorizations of rational matrix functions, Minimizing functions of infeasibilities in a two-machine flow shop, Quasicomplete factorization and the two machine flow shop problem
Cites Work
- Complementary triangular forms of pairs of matrices, realizations with prescribed main matrices, and complete factorization of rational matrix functions
- Upper triangularization of matrices by lower triangular similarities
- Minimal factorization of matrix and operator functions
- Fast projection methods for minimal design problems in linear system theory
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- Companion based matrix functions: Description and minimal factorization
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Simultaneous reduction to companion and triangular forms of sets of matrices
- Factorizations of Transfer Functions
- Mathematical Description of Linear Dynamical Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item