Algorithms for Special Cases of the Single Machine Total Tardiness Problem and an Application to the Even-Odd Partition Problem
The scheduling problem of minimizing total tardiness on a single machine is known to be NP-hard in the ordinary sense. In this paper, we consider the special case of the problem when the processing times p_j and the due dates d_j of the jobs are oppositely ordered: p_1 >= p_2>=...>=p_n and d_1.
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.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.