Heuristic Algorithm for Forming the Service Schedule for the Multistage Systems with a Generalized Resource Criterion

  • Authors

    • S. A. Oleinikova
    • O. Ya. Kravets
    • V. D. Sekerin
    • A. E. Gorokhova
    • V. I. Gayduk
    2018-12-03
    https://doi.org/10.14419/ijet.v7i4.38.24584
  • heuristics, algorithm, multi-stage service systems, generalized resource criterion, time constraints.
  • The paper suggests one of the approaches to solving the problem of planning multi-stage service systems, the distinguishing feature of which is the availability of time constraints and a resource criterion. At the heart of the approach lie heuristics, which make it possible to obtain a suboptimal solution in an acceptable time. Based on these heuristics, the process of making decisions about assigning jobs to a given time interval, determining the optimal time interval for the return, and estimating the remaining service time are carried out.

     

     


     
  • References

    1. [1] Ahuja HN, Dozzi SP & Abourizk SM (1994), Project Management: Technics in planning and controlling construction project. Second Edition, New-York: John Willey&Sons, 509.

      [2] Moder JJ, Phillips CR & Davis EW (1983), Project management with CPM, PERT and precedence diagramming, New-York: Van-Nostrand Reinhold, 389.

      [3] Doneva R, Gaftandzhieva S & Totkov G (2016), FETCH Project: The Maturity of Quality Management Through Dynamic Evaluation of the Project Progress. International Journal on Information Technologies and Security, 3(8), 29-38.

      [4] Golenko-Ginzburg D & Gonik A (1997), Project planning and controlling by stochastic network models. Managing and Modeling Complex Projects, 17, 21-43.

      [5] Weglarz J (1999), Project Scheduling – Recent Models, Algorithms and Applications. Boston: Kluwer Academic Publishers, 535.

      [6] Demeulemeester EL & Herroelen WS (2002), Project Scheduling. A research Handbook, New York, Boston, Dordrecht, London, Moscow: Kluwer Academic Publishers, 675.

      [7] Neumann K, Schwindt C & Zimmermann J (2003), Project scheduling with time windows and scarce resources. 2dn Edition, Berlin: Springer, 389.

      [8] Blanco L & Caramia M (2008), A new approach for the Project Scheduling problem with generalized precedence relations. Proceedings of the 11th International Workshop on Project Management and Scheduling, Istanbul, 35-39.

      [9] Artigues C, Demassey S & Neron E (2010), Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. Willey Online Library, 308.

      [10] Oleynikova SA (2014), Algorithm for determing the point of return for scheduling tasks with time constraints and criterion of uniform load. Modern Informatization Problems: Proceedings of the XIX-th International Open Science Conference, Yelm, USA, 67–70.

  • Downloads

  • How to Cite

    A. Oleinikova, S., Ya. Kravets, O., D. Sekerin, V., E. Gorokhova, A., & I. Gayduk, V. (2018). Heuristic Algorithm for Forming the Service Schedule for the Multistage Systems with a Generalized Resource Criterion. International Journal of Engineering & Technology, 7(4.38), 370-374. https://doi.org/10.14419/ijet.v7i4.38.24584