Geodesic
Optimal selection and scheduling of jobs with uncertain durations for two employees
Journal of the Belarusian State University. Mathematics and Informatics, Tome 2 (2024), pp. 65-80.

Voir la notice de l'article provenant de la source Math-Net.Ru

The number of potential users of time-management in the world is steadily growing due to the emerging need for remote work (in a home office), distance learning, teaching, service and, in general, the organisation of professional activities and a private life with a minimum of personal contacts due to the spread of the coronavirus infection COVID-19 since 2020 and other dangerous infections. This will require the improvement of the time-management techniques and the developments of new algorithms and software for them, which will take into account the peculiarities and needs of new users of time-management. Such problems arise in time-management for optimally selecting jobs for a given time interval and for constructing optimal schedules for processing jobs under conditions of uncertain operation durations. This article presents sufficiency conditions, algorithms, and computational results for selecting and scheduling connected jobs by two employees.
Keywords: time-management; optimal schedule; uncertain processing times 
@article{BGUMI_2024_2_a5,
     author = {Yu. N. Sotskov and N. M. Matsveichuk},
     title = {Optimal selection and scheduling of jobs with uncertain durations for two employees},
     journal = {Journal of the Belarusian State University. Mathematics and Informatics},
     pages = {65--80},
     publisher = {mathdoc},
     volume = {2},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/BGUMI_2024_2_a5/}
}
TY  - JOUR
AU  - Yu. N. Sotskov
AU  - N. M. Matsveichuk
TI  - Optimal selection and scheduling of jobs with uncertain durations for two employees
JO  - Journal of the Belarusian State University. Mathematics and Informatics
PY  - 2024
SP  - 65
EP  - 80
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BGUMI_2024_2_a5/
LA  - ru
ID  - BGUMI_2024_2_a5
ER  - 
%0 Journal Article
%A Yu. N. Sotskov
%A N. M. Matsveichuk
%T Optimal selection and scheduling of jobs with uncertain durations for two employees
%J Journal of the Belarusian State University. Mathematics and Informatics
%D 2024
%P 65-80
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BGUMI_2024_2_a5/
%G ru
%F BGUMI_2024_2_a5
Yu. N. Sotskov; N. M. Matsveichuk. Optimal selection and scheduling of jobs with uncertain durations for two employees. Journal of the Belarusian State University. Mathematics and Informatics, Tome 2 (2024), pp. 65-80. http://geodesic.mathdoc.fr/item/BGUMI_2024_2_a5/

[1] E. Zerubavel, “The Benedictine ethic and the modern spirit of scheduling: on schedules and social organization”, Sociological Inquiry, 50(2) (1980), 157–169 | DOI

[2] S. Eilon, “Time-management”, Omega, 21(3) (1993), 255–259 | DOI

[3] W. J. Reed, “The Pareto, Zipf and other power laws”, Economics Letters, 74(1) (2001), 15–19 | DOI

[4] P. Rastogi, “Management musings”, Colourage, 56(1) (2009), 58–62

[5] B. Ho, “Time management of final year undergraduate English projects: supervisees and the supervisors coping strategies”, System, 31(2) (2003), 231–245 | DOI

[6] E. S. Indreica, A. M. Cazan, C. Truta, “Effects of learning styles and time management on academic achievement”, Procedia – Social and Behavioral Sciences, 30 (2011), 1096–1102 | DOI

[7] H. Kaya, N. Kaya, A. O. Pallos, L. Kucuk, “Assessing time-management skills in terms of age, gender and anxiety levels: a study of nursing and midwifery students in Turkey”, Nurse Education in Practice, 12(5) (2012), 284–288 | DOI

[8] L. A. Zampetakis, N. Bouranta, V. S. Moustakis, “On the relationship between individual creativity and time management”, Thinking Skills and Creativity, 5(1) (2010), 23–32 | DOI

[9] V. P. Jackson, “Time management: a realistic approach”, Journal of the American College of Radiology, 6(6) (2009), 434–436 | DOI

[10] C. J. Konig, L. Oberacher, M. Kleinmann, “Personal and situational determinants of multitasking at work”, Journal of Personnel Psychology, 9(2) (2010), 99–103 | DOI

[11] B. J. Sherwood, “Personal time-management allows you to work smarter with less effort”, Sherwood on Management, 2005, 44–45

[12] N. L. Ahmad, ANM. Yusuf, NDM. Shobri, S. Wahab, “The relationship between time management and job performance in event management”, Procedia – Social and Behavioral Sciences, 65 (2012), 937–941 | DOI

[13] T. Macan, J. M. Gibson, J. Cunningham, “Will you remember to read this article later when you have time? The relationship between prospective memory and time management”, Personality and Individual Differences, 48(6) (2010), 725–730 | DOI

[14] BJC. Claessens, Eerde. van, C. G. Rutte, R. A. Roe, “A review of the time management literature”, Personnel Review, 36(2) (2007), 255–276 | DOI

[15] YuN. Sotskov, N. G. Egorova, N. M. Matsveichuk, “Algorithms for planning working time under interval uncertainty”, Informatics, 17(2) (2020), 86–102 | DOI

[16] S. Waterworth, “Time management strategies in nursing practice”, Journal of Advanced Nursing, 43(5) (2003), 432–440 | DOI

[17] V. S. Tanaev, Y. N. Sotskov, V. A. Strusevich, Scheduling theory: multi-stage systems, Kluwer Academic Publishers, Dordrecht, 1994, +406 pp.

[18] R. L. Graham, E. L. Lawler, J. K. Lenstra, KAHG. Rinnooy, “Optimization and approximation in deterministic sequencing and scheduling: a survey”, Annals of Discrete Mathematics, 5 (1979), 287–326 | DOI

[19] Y. N. Sotskov, N. M. Matsveichuk, V. D. Hatsura, “Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations”, Algorithms, 13(1) (2020), 4 | DOI

[20] C. T. Ng, N. M. Matsveichuk, Y. N. Sotskov, TCE. Cheng, “Two-machine flow-shop minimum-length scheduling with interval processing times”, Asia-Pacific Journal of Operational Research, 26(6) (2009), 587–604 | DOI

[21] N. M. Matsveichuk, Y. N. Sotskov, F. Werner, “The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times”, Optimization, 60(12) (2011), 1493–1517 | DOI

[22] J. R. Jackson, “An extension of Johnson’s results on job lot scheduling”, Naval Research Logistics Quaterly, 3(3) (956), 201–203 | DOI

[23] YuN. Sotskov, “Mixed graph colouring as scheduling multiprocessor tasks with equal processing times”, Journal of the Belarusian State University. Mathematics and Informatics, 2 (2021), 67–81 | DOI