Abstract
One considers the problem of forming the optimal schedulings with gaps for a service system withN identical parallel processors. In the service one performsK jobs, each of which consists of Vi homogeneous independent operations and has lower and upper directive times di and Di. For the operations which constitute the jobs, one considers linear penalty functions outside the interval [di,Di]. One solves the problem of finding the schedulings with a minimal total penalty and having the origin in a given interval [t1,t2]. It is proved that for an arbitrary set Z of jobs, the penalty function FZ(t), where t is the origin of the scheduling, has a unique minimum for t∈(−∞,+∞). We present an algorithm for the construction of the optimal scheduling requiring\(C \cdot K\left( {\mathop {\max }\limits_i \left\{ {D_i } \right\} - \mathop {\min }\limits_i \left\{ {d_i } \right\} + \sum\limits_1^\kappa {V_i } } \right)\) operations on an electronic computer.
Similar content being viewed by others
Literature cited
A. V. Maksimenkov and A. L. Shchers, “An algorithm for the formation of schedulings for the completion of regulated jobs,” Programmirovanie, No. 1, 15–20 (1977).
V. S. Tanaev and V. V. Shkurba, Introduction to the Theory of Schedulings [in Russian], Moscow (1975).
E. A. Dinits and M. A. Kronrod, “An algorithm for the solution of the assignment problem,” Dokl. Akad. Nauk SSSR,189, No. 1, 23–25 (1969).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 70, pp. 205–231, 1977.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V., Lebedinskaya, N.B. Optimal schedulings with gaps for independent jobs in a service system withN servers. J Math Sci 23, 2033–2056 (1983). https://doi.org/10.1007/BF01093284
Issue Date:
DOI: https://doi.org/10.1007/BF01093284