Abstract
The paper is based on using methods of continuous mathematics in discrete problems. Three new approaches to solving scheduling theory problems are considered, namely, a metric approach, an interpolation approach, and a combined one (metric interpolation). Metric interpolation is a mix of the other two approaches and combines their advantages. Each of these approaches permits one to reduce the time required for solving the corresponding problems and calculate the values of the guaranteed absolute error of the objective function.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Lazarev, A.A., Teoriya raspisanii. Metody i algoritmy (Schedule Theory. Methods and Algorithms), Moscow: Inst. Probl. Upr. Ross. Akad. Nauk, 2019.
Lazarev, A.A., Lemtyuzhnikova, D.V., and Werner, F., A metric approach for scheduling problems with minimizing the maximum penalty, Appl. Math. Model., 2021, no. 89, pp. 1163–1176.
Tanaev, V.S., Gordon, V.S., and Shfransky, Y.M., Scheduling Theory: Single-Stage Systems, Dordrecht: Kluwer Acad. Publ., 1994.
Brucker, P., Scheduling Algorithms, Berlin: Springer, 1995.
Sequencing and Scheduling with Inaccurate Data, Sotskov, Y.N. and Werner, F., Eds., New York: Nova Science Publ., 2014.
Tanaev, V.S., Sotskov, Y.N., and Strusevich, V.A., Scheduling Theory: Multi-Stage Systems, Dordrecht: Kluwer Acad. Publ., 1994.
Lazarev, A.A., Pravdivets, N., and Werner, F., On the dual and inverse problems of scheduling jobs to minimize the maximum penalty, Mathematics, 2020, vol. 8, no. 7, p. 1131.
Lenstra, J.K., Rinnooy Kan, A.H.G., and Brucker, P., Complexity of machine scheduling problems, Ann. Discrete Math. Elsevier, 1977, vol. 1, pp. 343–362.
Lazarev, A.A., Lemtyuzhnikova, D.V., Pravdivets, N.A., and Werner, F., Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems, Communications in Computer and Information Science (Adv. Optim. Appl. 11th Int. Conf., OPTIMA 2020), 2021, no. 1340, pp. 211–223.
Jackson, J.R., Scheduling a Production Line to Minimize Maximum Tardiness, Los Angeles: Univ. California, 1955.
Samarskii, A.A. and Gulin, A.V., Chislennye metody: Ucheb. posobie dlya vuzov (Numerical Methods: a Handbook for Universities), Moscow: Nauka, 1989.
Kluyver, T., Ragan-Kelley, B., Perez, F., et al., Jupyter Notebooks—a Publishing Format for Reproducible Computational Workflows, Netherlands: InELPUB, 2016, pp. 87–90.
Harris, C.R., Millman, K.J., van der Walt, S.J., et al., Array programming with NumPy, Nature, 2020, vol. 585, no. 7825, pp. 357–362.
Hunter, J.D., Matplotlib: a 2D graphics environment, Comput. Sci. & Eng., 2007, vol. 9, no. 3, pp. 90–95.
Rivlin, T.J., Chebyshev Polynomials, Courier Dover Publ., 2020.
Rozenfel’d, B.A., Mnogomernye prostranstva (Multidimensional Spaces), Moscow: Ripol Klassik, 2013.
Funding
This work was partly financially supported by the Russian Foundation for Basic Research, project no. 20-58-S52006.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by V. Potapchouck
Rights and permissions
About this article
Cite this article
Lazarev, A.A., Lemtyuzhnikova, D.V. & Tyunyatkin, A.A. Metric Interpolation for the Problem of Minimizing the Maximum Lateness for a Single Machine. Autom Remote Control 82, 1706–1719 (2021). https://doi.org/10.1134/S0005117921100088
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117921100088