Factorization and job scheduling: A connection via companion based matrix functions (Q2564926)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Factorization and job scheduling: A connection via companion based matrix functions |
scientific article |
Statements
Factorization and job scheduling: A connection via companion based matrix functions (English)
0 references
28 May 1997
0 references
The authors relate the two machine flow shop problem to the problem of realizing a rational function by a formula \(I+C(\lambda I-A)^{-1}B\), where \(A\) and \(A-BC\) are companion matrices. The processing times of the jobs on the two machines are interpreted as exponents of factors in the pole polynomial and the zero polynomial of the rational function.
0 references
factorization
0 references
job scheduling
0 references
companion based matrix functions
0 references
two machine flow shop problem
0 references
pole polynomial
0 references
zero polynomial
0 references
rational function
0 references
0 references
