Algorithms for planning working time under interval uncertainty

• Main Authors: Yu. N. Sotskov, N. G. Egorova, N. M. Matsveichuk
• Format: Article
• Language: Russian
• Published: The United Institute of Informatics Problems of the National Academy of Sciences of Belarus 2020-06-01
• Series: Informatika
• Subjects: scheduling theory; time-management; single machine; average job completion time; uncertain job processing time periods
• Online Access: https://inf.grid.by/jour/article/view/887

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.