An analog of the flexible polyhedron method for scheduling problems
From MaRDI portal
Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Discrete mathematics in relation to computer science (68R99) Stochastic matrices (15B51)
Cited in
(3)
This page was built for publication: An analog of the flexible polyhedron method for scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102854)