SpringerLink
Log in

Comparison and Polyhedral Properties of Valid Inequalities for a Polytope of Schedules for Servicing Identical Requests

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

The paper considers the convex hull of a set of schedules for servicing identical requests by parallel devices. Precedence conditions are given on the set of requests. All requests enter the service queue simultaneously and have the same service duration. Interruptions in request servicing are prohibited. Time is discrete. The polyhedral properties of some previously constructed classes of valid inequalities are studied. The “depth” cuts are compared, and the strongest subclasses of cuts are found. The relative position of the schedule polytope and hyperplanes generated by inequalities is also studied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

REFERENCES

  1. R. Yu Simanchev, P. V. Solov’eva, and I. V. Urazova, “The affine hull of the schedule polytope for servicing identical requests by parallel devices,” J. Appl. Industr. Math. 15 (1), 146–157 (2021). https://doi.org/10.1134/S1990478921010130

    Article  MathSciNet  Google Scholar 

  2. R. Yu Simanchev and I. V. Urazova, “The polytope of schedules of processing of identical requirements: The properties of the relaxation polyhedron,” in Mathematical Optimization Theory and Operations Research: Recent Trends.Proceedings of the 20th International Conference MOTOR 2021, Irkutsk, Russia, 2021 (Springer, Cham, 2021), Ser. Communications in Computer and Information Science, Vol. 1476, pp. 257–270. https://doi.org/10.1007/978-3-030-86433-0_18

    Chapter  Google Scholar 

  3. R. Yu. Simanchev and I. V. Urazova, “An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences,” Autom. Remote Control 71 (10), 2102–2108 (2010). https://doi.org/10.1134/S0005117910100097

    Article  MathSciNet  Google Scholar 

  4. M. Grotschel and Y. Wakabayashi, “A cutting plane algorithm for a clustering problem,” Math. Program. Ser. B 45 (1–3), 59–96 (1989). https://doi.org/10.1007/BF01589097

    Article  MathSciNet  Google Scholar 

  5. D. Khachai, R. Sadykov, O. Battaia, and M. Khachay, “Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm,” European J. Oper. Res. 309 (2), 488–505 (2023). https://doi.org/10.1016/j.ejor.2023.01.039

    Article  MathSciNet  Google Scholar 

  6. E. Balas, “On the facial structure of scheduling polyhedra,” in Mathematical Programming Essays in Honor of George B. Dantzig, Part I,  Ed. by R. W. Cottle (Springer, Berlin, 1985), Ser. Mathematical Programming Studies, Vol. 24, pp. 179–218. https://doi.org/10.1007/BFb0121051

    Chapter  Google Scholar 

  7. E. Mokotoff, “An exact algorithm for the identical parallel machine scheduling problem,” Europ. J. Oper. Res. 152 (3), 758–769 (2004). https://doi.org/10.1016/S0377-2217(02)00726-9

    Article  MathSciNet  Google Scholar 

  8. M. Queyranne and Y. Wang, “Single-machine scheduling polyhedra with precedence constraints,” Math. Oper. Res., No. 16, 1–20 (1991).

    Article  MathSciNet  Google Scholar 

  9. G. L. Nemhauser and M. W. Savelsbergh, “A cutting plane algorithm of single machine scheduling problem with release times,” in Combinatorial Optimization: New Frontiers in the Theory and Practice, (Springer, Berlin, 1992), NATO ASI Subseries F, Vol. 82, 63–84. https://doi.org/10.1007/978-3-642-77489-8_4

    Chapter  Google Scholar 

  10. R. Yu. Simanchev and I. V. Urazova, “The polytope of schedules of identical jobs on parallel processors,” Diskret. Anal. Issledov. Oper. 18 (11), 85–97 (2011).

    MathSciNet  Google Scholar 

  11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Fransisco, 1979).

    Google Scholar 

  12. V. S. Tanaev, V. S. Gordon, and V. V. Shafranskii, Theory of Schedules. One-Stage Systems (Nauka, Moscow, 1987) [in Russian].

    Google Scholar 

  13. A. A. Kolokolov, “Regular partitions and cuts in integer programming,” Sib. Zh. Issled. Oper. 1 (2), 18–39 (1994).

    MathSciNet  Google Scholar 

  14. N. Christofides, Graph Theory: An Algorithmic Approach (Academic, New York, 1975).

    Google Scholar 

  15. P. Brucker and S. Knust, Complexity Results for Scheduling Problems. https://mathematik.uni-osnabrueck.de/research/OR/class

  16. R. Yu. Simanchev and I. V. Urazova, “The class of \(t\)-part inequalities for a schedule polytope with servicing of requirements by parallel devices,” in Proceedings of the Workshop on Data, Modeling, and Security (Omsk, Russia, 2017). http://ceur-ws.org/Vol-1965/paper8.pdf

    Google Scholar 

Download references

Funding

This research was carried out within a state task to the Omsk Research Center, Siberian Branch of the Russian Academy of Sciences (project registration no. 121022000112-2).

Author information

Authors and Affiliations

  1. Dostoevsky Omsk State University, 644077, Omsk, Russia

    R. Yu. Simanchev & I. V. Urazova

  2. Omsk Research Center, Siberian Branch of the Russian Academy of Sciences, 644025, Omsk, Russia

    R. Yu. Simanchev

Authors
  1. R. Yu. Simanchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Urazova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to R. Yu. Simanchev or I. V. Urazova.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Translated from Trudy Instituta Matematiki i Mekhaniki UrO RAN, Vol. 29, No. 3, pp. 156 - 167, 2023 https://doi.org/10.21538/0134-4889-2023-29-3-156-167.

Translated by E. Vasil’eva

Publisher's Note Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Simanchev, R.Y., Urazova, I.V. Comparison and Polyhedral Properties of Valid Inequalities for a Polytope of Schedules for Servicing Identical Requests. Proc. Steklov Inst. Math. 323 (Suppl 1), S243–S254 (2023). https://doi.org/10.1134/S0081543823060202

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543823060202

Keywords

Search

Navigation