We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.
✖19 April 2019
19 April 2019
18 April 2019
We consider the approach to construct approximation schedule with the guaranteed absolute error for the $NP-$hard scheduling problems minimizing maximum lateness.
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
In a fast changing global economy governed by Enterprise Services and the Future Internet, enterprises and virtual factories will self-organize in distributed, interoperable, innovation Ecosystems where the issues of Enterprise Interoperability need to be solved in a multi-view of information, services and processes throughout Enterprise Networks.
In this paper the authors analyze the optimization of public service delivery in Russia. The role of the optimization of administrative processes in the modernization of public administration is also considered; major activities aimed at the optimization of the public services delivery in 2010-2011 are described; some background information for decision making process is revealed; major methods of improving quality and accessibility of public services are analyzed; the key methodological approaches for the reengineering of public services and spheres of government regulations are presented. Basing on the researches conducted, the authors propose the ways of making the activities aimed at the optimization of public services effi cient.