Advertisement

Automation and Remote Control

, Volume 71, Issue 10, pp 2102–2108 | Cite as

An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences

  • R. Yu. Simanchev
  • I. V. Urazova
Multi-Machine and Multi-Stage Scheduling Environments

Abstract

We describe an integer-valued model of the total service time minimization problem for a partially ordered set of claims with identical servicing times, serviced in parallel by identical devices. We construct a target function over the polyhedron corresponding to the problem. We give results of a numerical experiment that deal with the variance of the total service time and the structure of the schedules’ convex hull.

Keywords

Remote Control Target Function Maximal Path Integer Linear Programming Problem Parallel Machine Schedule Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.zbMATHGoogle Scholar
  2. 2.
    Tanaev, V.S., Gordon, V.S., and Shafransky, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-stage Systems), Moscow: Nauka, 1984.Google Scholar
  3. 3.
  4. 4.
    Simanchev, R.Yu. and Urazova, I.V., A Class of Support Inequalities for the Schedule Polytope for Servicing Unit Claims with Parallel Processors, in Matematicheskoe programmirovanie, Tr. XIV Baikal’skoi mezhdunar. shk.-seminara “Metody optimizatsii i ikh prilozheniya” (Mathematical Programming. Proc. of the XIV Baikal International School-seminar “Optimization Methods and Their Applications”), Irkutsk: ISEM SO RAN, 2008, vol. 1, pp. 530–536Google Scholar
  5. 5.
    Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975. Translated under the title Teoriya grafov. Algoritmicheskii podkhod, Moscow: Mir, 1978.zbMATHGoogle Scholar
  6. 6.
    Mokotoff, E., An Exact Algorithm for the Identical Parallel Machine Scheduling Problem, Eur. J. Oper. Res., 2004, vol. 152, pp. 758–769.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Project Scheduling. Recent Models, Algorithms and Applications, Weglars, J., Ed., Boston: Kluwer, 1999.Google Scholar
  8. 8.
    Brucker, P. and Knust, S., Complex Scheduling, New York: Springer, 2006.zbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2010

Authors and Affiliations

  • R. Yu. Simanchev
    • 1
  • I. V. Urazova
    • 1
  1. 1.Omsk State UniversityOmskRussia

Personalised recommendations