An analog of the flexible polyhedron method for scheduling problems
From MaRDI portal
Publication:1102854
DOI10.1007/BF01098009zbMath0644.90050MaRDI QIDQ1102854
Publication date: 1988
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic matrices (15B51) Discrete mathematics in relation to computer science (68R99)
Cites Work
This page was built for publication: An analog of the flexible polyhedron method for scheduling problems