Skip to main content
SpringerLink
Log in

Combinatorial optimization algorithms combining greedy strategies with a limited search procedure

  • Discrete Systems
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The proposed algorithms basically follow a greedy strategy, and a limited search procedure is invoked only at the steps at which the greedy choice cannot lead to the optimal solution. The principle of these algorithms design are illustrated using the problem of finding the maximum number of compatible jobs as an example. The results of applying the proposed algorithms for scheduling computations in distributed systems are described.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences (W. H. Freeman, New York, 1979).

    MATH  Google Scholar 

  2. T. Cormen, Ch. Leiserson, and R. Rivest, Introduction to Algorithms (MIT, Cambridge, MA, 2001).

    MATH  Google Scholar 

  3. M. Minoux, Programmation mathématique: Théorie et algorithmes (Tec & Doc Lavoisier, 2007; Nauka, Moscow, 1990) [in French].

    MATH  Google Scholar 

  4. R. Bellman, Dynamic Programming (Princeton Univ. Press, Princeton, NJ, 1957).

    MATH  Google Scholar 

  5. Computer and Job-Shop Scheduling Theory, Ed. by E. G. Coffman (Wiley, New York, 1976; Nauka, Moscow, 1984).

  6. V. A. Kostenko, “Scheduling algorithms for real-time computing systems admitting simulation models,” Program. Comput. Software 39, 255–267 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  7. L. A. Rastrigin, Statistical Search Methods (Nauka, Moscow, 1968) [in Russian].

  8. A. V. Kalashnikov and V. A. Kostenko, “A parallel algorithm of simulated annealing for multiprocessor scheduling,” J. Comput. Syst. Sci. Int. 47, 455 (2008).

    Article  MATH  Google Scholar 

  9. D. A. Zorin and V. A. Kostenko, “Algorithm for synthesis of real-time systems under reliability constraints,” J. Comput. Syst. Sci. Int. 51, 410 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  10. J. N. Holland, Adaptation in Natural and Artificial Systems (Univ. of Michigan Press, Ann Arbor, Michigan, 1975).

    Google Scholar 

  11. Yu. A. Skobtsov, Fundamentals of Evolutional Computations (Donetsk. Nath. Tech. Univ., Donetsk, 2008) [in Russian].

    Google Scholar 

  12. D. I. Batishchev, E. D. Gudman, I. P. Norenkov, and M. Kh. Prilutskii, “Combining heuristics method for solving combinatorial problems of resouce ordering and allocation,” Inform. Tekhnol., No. 2, 29–32 (1997).

    Google Scholar 

  13. M. Dorigo, “Optimization, learning and natural algorithms,” PhD Thesis (Politech. di Milano, Milano, 1992).

    Google Scholar 

  14. V. A. Kostenko and A. V. Plakunov, “An algorithm for constructing single machine schedules Based on ant colony approach,” J. Comput. Syst. Sci. Int. 52, 928 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  15. S. D. Shtovba, “Ant algorithms: theory and application,” Programmirovanie, No. 4, 1–15 (2005).

    MATH  Google Scholar 

  16. C. Blum and M. Sampels, “Ant colony optimization for FOP shop scheduling: a case study on different pheromone representation,” in Proceedings of the Congress on Evolutionary Computation (IEEE Comput. Soc. Press, Los Alamitos, CA, 2002), Vol. 2, pp. 1558–1563.

    Google Scholar 

  17. A. Federgruen and H. Groenevelt, “Preemptive scheduling of uniform machines by ordinary network flow technique,” Manage. Sci. 32 (3) (1986).

  18. T. Gonzales and S. Sanhi, “Preemptive scheduling of uniform processor systems,” Assoc. Comput. Machin. 25 (1) (1978).

  19. D. S. Guz and M. G. Furugyan, “Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory,” Autom. Remote Control 66, 295 (2005).

    Article  MATH  Google Scholar 

  20. E. O. Kosorukov and M. G. Furugyan, “Some algorithms for resource allocation in multiprocessor systems,” Moscow Univ. Comput. Math. Cybernet. 33, 202 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  21. V. A. Kostenko and A. V. Frolov, “Self-learning genetic algorithm,” J. Comput. Syst. Sci. Int. 54, 525 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  22. N. M. Novikova, Principles of Optimization, Course of Lectures (Mosk. Gos. Univ., Moscow, 1998) [in Russian].

    Google Scholar 

  23. P. M. Vdovin and V. A. Kostenko, “Algorithm for resource allocation in data centers with independent schedulers for different types of resources,” J. Comput. Syst. Sci. Int. 53, 854 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  24. I. A. Zotov and V. A. Kostenko, “Resource allocation algorithm in data centers with a unified scheduler for different types of resources,” J. Comput. Syst. Sci. Int. 54, 59 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  25. V. A. Kostenko and E. S. Gur’yanov, “An algorithm for scheduling exchanges over a bus with centralized control and an analysis of its efficiency,” Program. Comput. Sci. 31, 340–346 (2005).

    Article  MATH  Google Scholar 

  26. GOST (State Standard) 26765.52-87: Main serial interface of electronic modules system.

  27. Jiangtao Zhang, Hejiao Huang, and Xuan Wang, “Resource provision algorithms in cloud computing: A survey,” Network Comput. Appl. C 64, 23–42 (2016).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    V. A. Kostenko

Authors
  1. V. A. Kostenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Kostenko.

Additional information

Original Russian Text © V.A. Kostenko, 2017, published in Izvestiya Akademii Nauk, Teoriya i Sistemy Upravleniya, 2017, No. 2, pp. 48–56.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kostenko, V.A. Combinatorial optimization algorithms combining greedy strategies with a limited search procedure. J. Comput. Syst. Sci. Int. 56, 218–226 (2017). https://doi.org/10.1134/S1064230717020137

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

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

Search

Navigation