Abstract
In this paper, we consider the problem of minimizing total weighted tardiness for equal-length jobs with arbitrary release dates on a single machine. This problem is mentioned as a minimal open problem, see http://www2.informatik.uni-osnabrueck.de/knust/class/dateien/classes/ein_ma/ein_ma, i.e., its complexity status is still open. The latest results on this problem were presented in the years 2000 and 2005, namely solution algorithms for special cases. We present some properties of this problem and discuss possible ways for future research.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
van den Akker, J.M., Diepen, G., and Hoogeveen, J.A., Minimizing Total Weighted Tardiness on a Single Machine with Release Dates and Equal-Length Jobs, J. Scheduling, 2010, no. 13, pp. 561–576.
Aloulou, M.A., Kovalyov, M.Y., and Portmann, M.-C., Evaluation Flexible Solutions in Single Machine Scheduling via Objective Function Maximization: the Study of Computational Complexity, RAIRO Oper. Res., 2007, no. 41, pp. 1–18.
Baptiste, P., Scheduling Equal-Length Jobs on Identical Parallel Machines, Discr. Appl. Math., 2003, no. 103(1–3), pp. 21–32.
Gafarov, E.R., Lazarev, A.A., and Werner, F., Transforming a Pseudo-Polynomial Algorithm for the Single Machine Total Tardiness Maximization Problem into a Polynomial One, Ann. Oper. Res., 2012, no. 196(1), pp. 247–261.
Gafarov, E.R., Lazarev, A.A., and Werner, F., Single Machine Total Tardiness Maximization Problems: Complexity and Algorithms, Ann. Oper. Res., 2013, no. 207, pp. 121–136.
Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., Optimization and Approximation in Deterministic Machine Scheduling: A Survey, Ann. Discr. Math., 1979, no. 5, pp. 287–326.
Du, J. and Leung, J.Y.-T., Minimizing Total Tardiness on One Processor is NP-hard, Math. Oper. Res., 1990, no. 15, pp. 483–495.
Held, M. and Karp, R.M., A Dynamic Programming Approach to Sequencing Problems, J. Soc. Ind. Appl. Math., 1962, no. 10, pp. 196–210.
Kravchenko, S.A. and Werner, F., Parallel Machine Problems with Equal Processing Times: A Survey, J. Scheduling, 2011, no. 14, pp. 435–444.
Leung, J.Y.-T., Handbook of Scheduling, New York: Chapmann and Hall/CRC, 2004.
Verma, S. and Dessouky, M., Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties, Math. Oper. Res., 1998, no. 23(4), pp. 930–943.
Funding
This work was supported by the DAAD (Deutscher Akademischer Austauschdienst) no. 91695276, the Russian Foundation for Basic Research, project no. 18–07–00656, and the Russian Science Foundation, project no. 17–19–01665.
Author information
Authors and Affiliations
Corresponding authors
Additional information
This paper was recommended for publication by F. T. Aleskerov, a member of the Editorial Board
Russian Text © The Author(s), 2020, published in Avtomatika i Telemekhanika, 2020, No. 5, pp. 119–138.
Rights and permissions
About this article
Cite this article
Gafarov, E.R., Lazarev, A.A. & Werner, F. Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine. Autom Remote Control 81, 853–868 (2020). https://doi.org/10.1134/S0005117920050069
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117920050069