Open AccessAlgorithms for planning working time under interval uncertainty
Author(s) -
Yuri N. Sotskov,
Natalja G. Egorova,
Natalja M. Matsveichuk
Publication year - 2020
Publication title -
informatika
Language(s) - English
Resource type - Journals
eISSN - 2617-6963
pISSN - 1816-0301
DOI - 10.37661/1816-0301-2020-17-2-86-102
Subject(s) - parallelepiped , scheduling (production processes) , computer science , time management , mathematical optimization , operations research , permutation (music) , interval (graph theory) , time complexity , mathematics , algorithm , physics , geometry , combinatorics , acoustics , operating system
Time-management refers to planning the available time in correspondence with personal goals and preferences of the employee. The criterion for efficient time-management lies in achieving definite goals in minimum possible time. This paper presents a short review of the literature on time-management. It is shown how scheduling theory may be used for optimal planning in time-management. The problem of minimizing the total (average) weighted completion time of the planned jobs by an employee is considered provided that only lower and upper bounds of the possible processing time of each job are known before scheduling. Software for constructing a permutation of the given jobs with the largest relative semi-perimeter of the optimality parallelepiped has been developed. Computational experiment on the computer showed the effectiveness of the developed algorithms for constructing schedules for time-management.