An analog of the flexible polyhedron method for scheduling problems

DOI10.1007/BF01098009MaRDI QIDQ1102854zbMATH OpenFDO

Authors Yu. D. Elizarov, E. L. Stolov

Publication date 1988

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01098009

zbMATH Keywords

assignmentdoubly stochastic matricesflexible polyhedron method

Mathematics Subject Classification ID

Stochastic matrices (15B51) 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) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Review text

Translation from Issled. Prikl. Mat. 11, No.1, 66-72 (Russian) (1984; Zbl 0596.90044).

Cited in

(3)

• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• scientific article; zbMATH DE number 1946760 (Why is no real title available?)

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)