Skip to main content
SpringerLink
Log in

Algorithm of Sequential Analysis of Variants for Minimization of the Number of Devices in Scheduling Problem with Due Date

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper deals with the problem where a set of n demands arrives at a system of M identical parallel devices. Each demand i is put on the queue for service at the moment of time di ≥ 0 and is serviced during ti > 0 time units by any device without interruption. A directive period Di is assigned to each demand i. An algorithm is proposed for construction of an optimal schedule (relative to the number of devices) which is based on the method of successive analysis of variants.

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. A. I. Kuzka and T. B. Shpenik, “Minimization of the number of devices in scheduled performance,” in: Papers Presented to the Intern. Scient. Seminar “Science, Technology, Development,” (Uzhgorod, May, 1998), Inst. Elektron. Fiziki NANU, Uzhgorod (1998), pp. 135-139.

    Google Scholar 

  2. V. S. Kovalev, Discrete Optimization [in Russian], Izd. BGU, Minsk (1977).

    Google Scholar 

  3. V. S. Mikhalevich, V. L. Volkovich, A. F. Voloshin, and V. M. Pozdnyakov, “Algorithms for sequential analysis and pathforming in discrete optimization,” Kibernetika, No. 3, 76-85 (1980).

  4. K. R. Davis and J. E. Walters, “Addressing the N/l scheduling problem-a heuristic approach,” Comput. Oper. Res., 4, No. 2, 89-100 (1977).

    Google Scholar 

  5. V. G. Vizing, “On the schedules complying with due periods of work realization”, Kibernetika, No. 1, 128-135 (1981).

  6. V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Scheduling Theory: Single-Stage Systems [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  7. V. S. Tanaev, Scheduling Theory [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  8. V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State University, Uzhgorod, Ukraine

    A. I. Kuzka & T. B. Shpenik

Authors
  1. A. I. Kuzka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. B. Shpenik
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuzka, A.I., Shpenik, T.B. Algorithm of Sequential Analysis of Variants for Minimization of the Number of Devices in Scheduling Problem with Due Date. Cybernetics and Systems Analysis 36, 734–737 (2000). https://doi.org/10.1023/A:1009484924369

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009484924369

Search

Navigation