publication . Article . 2020

Algorithms for planning working time under interval uncertainty

Yu. N. Sotskov; N. G. Egorova; Natalja M. Matsveichuk;
Open Access Russian
  • Published: 26 Jun 2020 Journal: Informatika, volume 17, issue 2, pages 86-102 (issn: 1816-0301, Copyright policy)
  • Publisher: The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
Abstract
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 ...
Persistent Identifiers
Subjects
free text keywords: scheduling theory, time-management, single machine, average job completion time, uncertain job processing time periods, Electronic computers. Computer science, QA75.5-76.95, Parallelepiped, Scheduling theory, Mathematical optimization, Schedule, Software, business.industry, business, Scheduling (computing), Computer science, Optimal planning, Permutation, Time management
Related Organizations
Any information missing or wrong?Report an Issue