Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests

DOI10.1134/s0081543823060202OpenAlexW4391761111MaRDI QIDQ6194920

R. Yu. Simanchev, I. V. Urazova

Publication date: 16 February 2024

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543823060202

zbMATH Keywords

polytopevalid inequalityschedulescomparison of inequalities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Cites Work

• An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
• A cutting plane algorithm for a clustering problem
• An exact algorithm for the identical parallel machine scheduling problem.
• On the facial structure of scheduling polyhedra
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests