Steady states in the scheduling of discrete-time systems

DOI10.1016/j.ins.2018.12.067zbMath1443.90179OpenAlexW2907718839MaRDI QIDQ2005516

Karel Zimmermann, Daniela Ponce, Martin Gavalec

Publication date: 8 October 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.12.067

zbMATH Keywords

NP-completenesssteady stateplus)-linear systemtwo-sided (\(\max/\min\)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronously switched control of discrete impulsive switched systems with time delays
• Tropical linear-fractional programming and parametric mean payoff games
• Asynchronous \( L_1\) control of delayed switched positive systems with mode-dependent average Dwell time
• Delay-range-dependent exponential \(H\infty \) synchronization of a class of delayed neural networks
• Łukasiewicz transform and its application to compression and reconstruction of digital images
• The Minkowski theorem for max-plus convex sets
• On max-min linear inequalities and coalitional resource games with sharable resources
• Solvability and unique solvability of max-min fuzzy equations
• Triangular norms
• A polynomial algorithm for solving system of inequalities in max-plus algebra
• Robust \(H_\infty\) synchronization of a hyper-chaotic system with disturbance input
• An algorithm for solving two-sided interval system of max-plus linear equations
• Semiring and Semimodule Issues in MV-Algebras
• Z-matrix equations in max-algebra, nonnegative linear algebra and other semirings
• Max-linear Systems: Theory and Algorithms
• On the Computational Complexity of Combinatorial Problems
• The complexity of theorem-proving procedures