Allocation of jobs and identical resources with two pooling centers

We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above by the number of servers.      

关于人力资源会计若干问题的探讨

介绍了人力资源会计的概念,从人力资源成本会计和人力资源管理会计两个方面对人力资源会计的研究重点进行了详细的分析.     

成本性态法在分析可比产品成本降低计划完成情况中的应用

本文根据成本性态法的思路．分析了影响可比产品成本降低额和降低率变动的因素，重点从理论上论证了产品品种结构的影响，并且合理地把单纯产量和品种结构对可比产品成本降低额（率）的影响分离开来．     

Elliptic Reconstruction and a Posteriori Error Estimates for Fully Discrete Semilinear Parabolic Optimal Control Problems

This article studies a posteriori error analysis of fully discrete finite element approximations for semilinear parabolic optimal control problems. Based on elliptic reconstruction approach introduced earlier by Makridakis and Nochetto [25], a residual based a posteriori error estimators for the state, co-state and control variables are derived. The space discretization of the state and co-state variables is done by using the piecewise linear and continuous finite elements, whereas the piecewise constant functions are employed for the control variable. The temporal discretization is based on the backward Euler method. We derive a posteriori error estimates for the state, co-state and control variables in the $L^\infty(0,T;L^2(\Omega))$-norm. Finally, a numerical experiment is performed to illustrate the performance of the derived estimators.     

Morse Index of Multiple Blow-up Solutions to the Two-Dimensional Sinh-Poisson Equation

In this paper we consider the Dirichlet problemwhere $\rho$ is a small parameter and $\Omega$ is a $C^2$ bounded domain in $\mathbb{R}^2$. In [1], the author proves the existence of a $m$-point blow-up solution $u_\rho$ jointly with its asymptotic behaviour. We compute the Morse index of $u_\rho$ in terms of the Morse index of the associated Hamilton function of this problem. In addition, we give an asymptotic estimate for the first $4m$ eigenvalues and eigenfunctions.     

Single machine group scheduling with ordered criteria

The single machine group scheduling problem is considered. Jobs are classified into several groups on the basis of group technology, i.e. jobs of the same group have to be processed jointly. A machine set-up time independent of the group sequence is needed between each two consecutive groups. A schedule specifies the sequence of groups and the sequence of jobs in each group. The quality of a schedule is measured by the criteriaF ₁, ...,F _m ordered by their relative importance. The objective is to minimize the least important criterionF _m subject to the schedule being optimal with respect to the more important criterionF _m–1 which is minimized on the set of schedules minimizing criterionF _m–2 and so on. The most important criterion isF ₁, which is minimized on the set of all feasible schedules. An approach to solve this multicriterion problem in polynomial time is presented if functionsF ₁, ...,F _m have special properties. The total weighted completion time and the total weighted exponential time are the examples of functionsF ₁, ...,F _m–1 and the maximum cost is an example of functionF _m for which our approach can be applied.The research of the authors was partially supported by a KBN Grant No. 3 P 406 003 05, the Fundamental Research Fund of Belarus, Project N 60-242, and the Deutsche Forschungsgemeinschaft, Project Schema, respectively. The paper was completed while the first author was visiting the University of Melbourne.     

Uniqueness and clustering properties of Gibbs states for classical and quantum unbounded spin systems

We consider quantum unbounded spin systems (lattice boson systems) in -dimensional lattice space Z. Under appropriate conditions on the interactions we prove that in a region of high temperatures the Gibbs state is unique, is translationally invariant, and has clustering properties. The main methods we use are the Wiener integral representation, the cluster expansions for zero boundary conditions and for general Gibbs state, and explicitly -dependent probability estimates. For one-dimensional systems we show the uniqueness of Gibbs states for any value of temperature by using the method of perturbed states. We also consider classical unbounded spin systems. We derive necessary estimates so that all of the results for the quantum systems hold for the classical systems by straightforward applications of the methods used in the quantum case.     

Minimum cost multiflows in undirected networks

LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost a(e). Theminimum cost maximum multi(commodity)flow problem (*) studied in this paper is to find ac-admissible multiflowf inG such that: (i)f is allowed to contain partial flows connecting any pairs of terminals, (ii) the total value off is as large as possible, and (iii) the total cost off is as small as possible, subject to (ii). This generalizes, on one hand, the undirected version of the classical minimum cost maximum flow problem (when |T| = 2), and, on the other hand, the problem of finding a maximum fractional packing ofT-paths (whena 0). Lovász and Cherkassky independently proved that the latter has a half-integral optimal solution.A pseudo-polynomial algorithm for solving (*) has been developed earlier and, as its consequence, the theorem on the existence of a half-integral optimal solution for (*) was obtained. In the present paper we give a direct, shorter, proof of this theorem. Then we prove the existence of a half-integral optimal solution for the dual problem. Finally, we show that half-integral optimal primal and dual solutions can be designed by a combinatorial strongly polynomial algorithm, provided that some optimal dual solution is known (the latter can be found, in strongly polynomial time, by use of a version of the ellipsoid method).This work was partially supported by Chaire municipale, Mairie de Grenoble, France.     

A priori error estimates for numerical methods for scalar conservation laws. Part I: The general approach

In this paper, we construct a general theory of a priori error estimates for scalar conservation laws by suitably modifying the original Kuznetsov approximation theory. As a first application of this general technique, we show that error estimates for conservation laws can be obtained without having to use explicitly any regularity properties of the approximate solution. Thus, we obtain optimal error estimates for the Engquist-Osher scheme without using the fact (i) that the solution is uniformly bounded, (ii) that the scheme is total variation diminishing, and (iii) that the discrete semigroup associated with the scheme has the -contraction property, which guarantees an upper bound for the modulus of continuity in time of the approximate solution.

     

合肥地区高校安居园工程可行性研究

文章针对合肥地区高校教师住房面积普遍偏小,尤其是中青年教师住房十分困难。经过对合肥地区高等院校教师现有住房情况的调研,提出了建造高等院校教师安居园工程的设想及实施方案,对实施“科教兴皖”的战略方针具有现实意义。