Optimal selection and scheduling of jobs with uncertain durations for two employees

  • Natalja M. Matsveichuk Belarusian State Agrarian Technical University, 99 Niezaliezhnasci Avenue, Minsk 220012, Belarus
  • Yuri N. Sotskov United Institute of Informatics Problems, National Academy of Sciences of Belarus, 6 Surganava Street, Minsk 220012, Belarus https://orcid.org/0000-0002-9971-6169

Abstract

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.

Author Biographies

Natalja M. Matsveichuk, Belarusian State Agrarian Technical University, 99 Niezaliezhnasci Avenue, Minsk 220012, Belarus

PhD (physics and mathematics), docent; head of the department of automated systems of production control, agri-power faculty



Yuri N. Sotskov, United Institute of Informatics Problems, National Academy of Sciences of Belarus, 6 Surganava Street, Minsk 220012, Belarus

doctor of science (physics and mathematics), full professor; chief researcher at the laboratory of the mathematical cybernetics

References

  1. Zerubavel E. The Benedictine ethic and the modern spirit of scheduling: on schedules and social organization. Sociological Inquiry. 1980;50(2):157–169. DOI: 10.1111/j.1475-682X.1980.tb00383.x.
  2. Eilon S. Time-management. Omega. 1993;21(3):255–259. DOI: 10.1016/0305-0483(93)90084-X.
  3. Reed WJ. The Pareto, Zipf and other power laws. Economics Letters. 2001;74(1):15–19. DOI: 10.1016/S0165-1765(01)00524-9.
  4. Rastogi P. Management musings. Colourage. 2009;56(1):58–62.
  5. Ho B. Time management of final year undergraduate English projects: supervisees’ and the supervisor’s coping strategies. System. 2003;31(2):231–245. DOI: 10.1016/S0346-251X(03)00022-8.
  6. Indreica ES, Cazan AM, Truta C. Effects of learning styles and time management on academic achievement. Procedia – Social and Behavioral Sciences. 2011;30:1096–1102. DOI: 10.1016/j.sbspro.2011.10.214.
  7. Kaya H, Kaya N, Pallos AO, Kucuk L. 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. 2012;12(5):284–288. DOI: 10.1016/j.nepr.2012.06.002.
  8. Zampetakis LA, Bouranta N, Moustakis VS. On the relationship between individual creativity and time management. Thinking Skills and Creativity. 2010;5(1):23–32. DOI: 10.1016/j.tsc.2009.12.001.
  9. Jackson VP. Time management: a realistic approach. Journal of the American College of Radiology. 2009;6(6):434–436. DOI: 10.1016/j.jacr.2008.11.018.
  10. Konig CJ, Oberacher L, Kleinmann M. Personal and situational determinants of multitasking at work. Journal of Personnel Psychology. 2010;9(2):99–103. DOI: 10.1027/1866-5888/a000008.
  11. Sherwood BJ. Personal time-management allows you to work smarter with less effort. Sherwood on Management. 2005;July – August:44–45.
  12. Ahmad NL, Yusuf ANM, Shobri NDM, Wahab S. The relationship between time management and job performance in event management. Procedia – Social and Behavioral Sciences. 2012;65:937–941. DOI: 10.1016/j.sbspro.2012.11.223.
  13. Macan T, Gibson JM, Cunningham J. Will you remember to read this article later when you have time? The relationship between prospective memory and time management. Personality and Individual Differences. 2010;48(6):725–730. DOI: 10.1016/j.paid. 2010.01.015.
  14. Claessens BJC, van Eerde W, Rutte CG, Roe RA. A review of the time management literature. Personnel Review. 2007;36(2): 255–276. DOI: 10.1108/00483480710726136.
  15. Sotskov YuN, Egorova NG, Matsveichuk NM. Algorithms for planning working time under interval uncertainty. Informatics. 2020;17(2):86–102. Russian. DOI: 10.37661/1816-0301-2020-17-2-86-102.
  16. Waterworth S. Time management strategies in nursing practice. Journal of Advanced Nursing. 2003;43(5):432–440. DOI: 10.1046/j.1365-2648.2003.02740.x.
  17. Tanaev VS, Sotskov YN, Strusevich VA. Scheduling theory: multi-stage systems. Dordrecht: Kluwer Academic Publishers; 1994. 406 р.
  18. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics. 1979;5:287–326. DOI: 10.1016/S0167-5060(08)70356-X.
  19. Sotskov YN, Matsveichuk NM, Hatsura VD. Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations. Algorithms. 2020;13(1):4. DOI: 10.3390/a13010004.
  20. Ng CT, Matsveichuk NM, Sotskov YN, Cheng TCE. Two-machine flow-shop minimum-length scheduling with interval processing times. Asia-Pacific Journal of Operational Research. 2009;26(6):587–604. DOI: 10.1142/S0217595909002432.
  21. Matsveichuk NM, Sotskov YN, Werner F. The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times. Optimization. 2011;60(12):1493–1517. DOI: 10.1080/02331931003657691.
  22. Jackson JR. An extension of Johnson’s results on job lot scheduling. Naval Research Logistics Quaterly.1956;3(3):201–203. DOI: 10.1002/nav.3800030307.
  23. Sotskov YuN. Mixed graph colouring as scheduling multiprocessor tasks with equal processing times. Journal of the Belarusian State University. Mathematics and Informatics. 2021;2:67–81. DOI: 10.33581/25206508202126781.
Published
2024-08-02
Keywords: time-management, optimal schedule, uncertain processing times
Supporting Agencies The work was supported by the Belarusian Republican Foundation for Fundamental Research (grant No. F23RNF-017).
How to Cite
Matsveichuk, N. M., & Sotskov, Y. N. (2024). Optimal selection and scheduling of jobs with uncertain durations for two employees. Journal of the Belarusian State University. Mathematics and Informatics, 2, 65-80. Retrieved from https://journals.bsu.by/index.php/mathematics/article/view/6308
Issue
No 2 (2024): Journal of the Belarusian State University. Mathematics and Informatics
Section
Discrete Mathematics and Mathematical Cybernetics

Copyright (c) 2024 Journal of the Belarusian State University. Mathematics and Informatics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The authors who are published in this journal agree to the following:

  1. The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
  2. The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
  3. The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)