Scheduling theory and applications revisited
*Stefan M. StefanovCorresponding authorstefm@swu.bgDepartment of Mathematics South-West University “Neofit Rilski”Department of Mathematics South-West University”Neofit Rilski”Blagoevgrad, 2700, BulgariaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 12 Mar 2024
- Published Online:
- 18 Aug 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2175
- Pages:
- 2827–2835
Abstract
Keywords
Subject Classifications
References
[1] J. M. Anthonisse, K. M. van Hee, and J. K. Lenstra, “Resource-constrained project scheduling: an international exercise in DSS development”, Decision Support Systems, vol. 4, no. 2, pp. 249-257 (1988).
[2] A. S. Belen’kii, and E. V. Levner, “Scheduling models and methods in optimal freight transportation planning”, Automation and Remote Control, vol. 50, no. 1, pp. 1-56 (1989).
[3] S. A. Cook, “The complexity of theorem-proving procedures”, in: Proceedings of the 3rd ACM Symposium on the Theory of Computing, ACM, New York, pp. 151-158 (1971).
[4] G. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a large-scale traveling-salesman problem”, Journal of the Operations Research Society of America, vol. 2, no. 4, pp. 393-410 (1954).
[5] S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood Series in Mathematics and Its Applications, Wiley (1982).
[6] M. R. Garey, R. L. Graham, and D. S. Johnson, “Performance guarantees for scheduling algorithms”, Operations Research, vol. 26, no. 1, pp. 3-21 (1978).
[7] V. Dankan Gowda, V. Nuthan Prasad, K. D. V. Prasad, Kottala Sri Yogi, Manojkumar Shivalli Boraiah, and Mirzanur Rahman, “Mathematical framework for real-time data processing in edge computing: Context-aware priority scheduling analysis”, Journal of Statistics and Management Systems, vol. 27, no. 3, pp. 721-732 (2024) DOI: 10.47974/JSMS-1281.
[8] S. M. Johnson, “Optimal two- and three-stage production schedules with setup times included”, Naval Research Logistics Quarterly, vol. 1, no. 1, pp. 61-68 (1954).
[9] R. Karp, “Reducibility among combinatorial problems”, in: Complexity of Computer Computations, R. E. Miller, J. W. Thatcher, and J. D. Bohlinger (eds.), Plenum Press, New York, pp. 85-103 (1972).
[10] E. L. Lawler, “Sequencing jobs to minimize total weighted completion time subject to precedence constraints”, Annals of Discrete Mathematics, vol. 2, pp. 75-90 (1978).
[11] J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, “Complexity of machine scheduling problems”, Annals of Discrete Mathematics, vol. 1, pp. 343-362 (1977).
[12] J. K. Lenstra, and A. H. G. Rinnooy Kan, “Complexity of scheduling under precedence constraints”, Operations Research, vol. 26, no. 1, pp. 22-35 (1978).
[13] S. M. Stefanov, “On the implementation of stochastic quasigradient methods to some facility location problems”, Yugoslav Journal of Operations Research, vol. 10, no. 2, pp. 235-256 (2000).
[14] S. M. Stefanov, “Convex separable minimization subject to bounded variables”, Computational Optimization and Applications. An International Journal, vol. 18, no. 1, pp. 27-48 (2001).
[15] S. M. Stefanov, Separable Programming: Theory and Methods, Applied Optimization, vol. 53, Kluwer Academic Publishers, Dordrecht-Boston-London (2001).
[16] S. M. Stefanov, “Convex quadratic minimization subject to a linear constraint and box constraints”, Applied Mathematics Research Express AMRX, vol. 2004, no. 1, pp. 17-42 (2004).
[17] S. M. Stefanov, “Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints”, Journal of Interdisciplinary Mathematics, vol. 12, no. 5, pp. 647-673 (2009).
[18] S. M. Stefanov, “Solution of some convex separable resource allocation and production planning problems with bounds on the variables”, Journal of Interdisciplinary Mathematics, vol. 13, no. 5, pp. 541-569 (2010).
[19] S. M. Stefanov, “On the solution of multidimensional convex separable continuous knapsack problem with bounded variables”, European Journal of Operational Research, vol. 247, no. 2, pp. 366-369 (2015).
[20] S. M. Stefanov, “Strictly convex separable optimization with linear equality constraints and bounded variables”, Journal of Statistics and Management Systems, vol. 21, no. 2, pp. 261-272 (2018).
[21] S. M. Stefanov, “Characterization of the optimal solution of the convex separable continuous knapsack problem and related problems”, Journal of Information and Optimization Sciences, vol. 42, no. 1, pp. 1-16 (2021).
[22] S. M. Stefanov, “On the numerical solution of separable stochastic inventory control problems”, Journal of Information and Optimization Sciences, vol. 42, no. 3, pp. 533-561 (2021).
[23] S. M. Stefanov, Separable Optimization: Theory and Methods, Springer Optimization and Its Applications, vol. 177, Springer, Cham (2021).
[24] S. M. Stefanov, “On the solution of quadratic programming problems”, Journal of Information and Optimization Sciences, vol. 44, no. 2, pp. 243-253 (2023).
[25] S. M. Stefanov, “Continuous linear knapsack problems revisited”, Journal of Information and Optimization Sciences, vol. 44, no. 5, pp. 909-922 (2023).
[26] S. M. Stefanov, “Numerical solution of box constrained separable convex quadratic programming problems”, Journal of Information and Optimization Sciences, vol. 45, no. 1, pp. 57-71 (2024).
[27] S. M. Stefanov, “Linear programming problems and matrix games”, Journal of Interdisciplinary Mathematics, vol. 27, no. 1, pp. 57-65 (2024).
[28] P. H. Zipkin, “Simple ranking methods for allocation of one resource”, Management Science, vol. 26, pp. 34-43 (1980).
