Factorization and job scheduling: a connection via companion based matrix functions
1996-11-15
Article
volume 248 pp 111-136.
| Related Files |
|---|
View PDF Version
(FactorizationandJobScheduling_1996.pdf, 1.5MB) |
|
Redirect to publisher's version
(publisher's version.url.txt, 50 bytes) |
A connection is made between two sets of problems. The first set involves factorization problems of specific rational matrix functions, the companion based matrix functions. The second set is concerned with variants of the two machine flow shop problem (2MFSP) from job scheduling theory. In particular, it is shown that with each companion based matrix function one can associate an instance of 2MFSP and vice versa. The latter can be done in such a way that the factorization properties of the companion based matrix function correspond to the combinatorial properties of the instance of 2MFSP.
Keywords
Automatically Extracted Terms
- factorization
- matrix
- function
- matrix function
- companion
- schedule
- matrix functions
- problem
- factor
- job j
- instance
- machine
- number
- time interval
- polynomial
- section
- kroon
- 2 mfsp
- processing
- operation
