Cá no burgo andaram a discutir assuntos de águas no para-lamento, já no inglês o material que servem no Stranger’s Bar é dos tramados, que o diga o presidente do grupo parlamentar para os grandes lagos africanos. Agora querem correr com alguém que arregaça as mangas e põe as mãos no trabalho.
Algo que só pode ser compreendido à luz de estudos científicos minunciosos como o da Universidade Estadual de New York : «We introduce a new class of scheduling problems in which the optimization is performed by the worker who performs the tasks. The worker’s objective may be to minimize the amount of work he does. He is subject to a constraint that he must be busy when there is work that he can do; we make this notion precise, particularly when preemption is allowed. The resulting class of “perverse” scheduling problems, which we term “Lazy Bureaucrat Problems,” gives rise to a rich set of new questions that explore the distinction between maximization and minimization in computing optimal schedules.», “The Lazy Bureaucrat Scheduling Problem,” Esther M. Arkin, Michael A. Bender, Joseph S.B. Mitchell, and Steven S. Skiena, Algorithms and Data Structures, vol. 1663, 1999, pp. 773–85.
Na Universidade Técnica Sharif de Tearão também se dedicaram à problematica : «In this paper we study several versions of the lazy bureaucrat scheduling problems. In this new class of scheduling problems there is a lazy worker whose main objective is to be as inefficient as possible, in contrast to traditional scheduling problems in which the main objective is to be as efficient as possible.», “New Results for Lazy Bureaucrat Scheduling Problem,” Arash Farzan and Mohammad Ghodsi, 7th CSI Computer Conference (CSICC 2002), Iran Telecommunication Research Center, March 3–5, 2002, pp. 66–71. E descobriram «In this paper, we studied a new class of the Lazy Bureaucrat Scheduling Problems (LBSP), called common-deadline LBSP, where the deadlines of all jobs are the same.» Da Universidade Zhejiang em Hangzhou surgiu “On Lazy Bureaucrat Scheduling with Common Deadlines,” L. Gai and G. Zhang, Journal of Combinatorial Optimization, vol. 15, no. 2, February 2008, pp. 191–9. «In this problem, the bureaucrat wants to do things as little (or easy) as possible… Of course there is… the busy requirement, that the bureaucrat must keep working as long as there are some executable jobs, otherwise… the optimal strategy for the bureaucrat would be just stay idle without doing anything.»