Steady states in the scheduling of discrete-time systems
| Autor: | Daniela Ponce, Karel Zimmermann, Martin Gavalec |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Information Systems and Management
General problem 05 social sciences 050301 education 02 engineering and technology System of linear equations Computer Science Applications Theoretical Computer Science Scheduling (computing) Discrete time and continuous time Artificial Intelligence Control and Systems Engineering 0202 electrical engineering electronic engineering information engineering Applied mathematics 020201 artificial intelligence & image processing 0503 education Software Eigenvalues and eigenvectors Mathematics |
| Zdroj: | Information Sciences. 481:219-228 |
| ISSN: | 0020-0255 |
| Popis: | Steady solutions to a two-sided (max/min,+)-linear system of equations with real coefficients are considered. The problem is motivated by the demand to schedule cyclically repeated activities with deterministic processing times. The maximum steady solutions are characterized as ( min , + ) -eigenvectors of a special matrix Q. This condition is a necessary but not a sufficient one. It has also been proven that the general problem of the recognition of solvability of this two-sided system is NP-complete. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect