A note on worst-case performance of heuristics for maintenance scheduling problems

We study a machine scheduling model in which job scheduling and machine maintenance activities have to be considered simultaneously. We develop the worst-case bounds for some heuristic algorithms, including a sharper worst-case bound of the SPT schedule than the results in the literature, and another bound of the EDD schedule.     

Characteristics and structures of weak efficient surfaces of production possibility sets

This paper studies the characteristics and structure of the weak surface of the production possibility set. We apply techniques and methods of transferring a polyhedral cone from its intersection form to its sum form, identify an intersection representation of the production possibility set. We give the structure theorem of weak surface of the production possibility set, which includes three complementary slackness conditions. We define the input weak efficiency and output weak efficiency for different DEA models according to the representation of the intersection form. It investigates the characteristics of the weak surfaces, and proves the structure theorems of input weak DEA efficiency and output weak DEA efficiency. The structure theorems establish weighted combination of inputs and outputs that are weak DEA efficient. Numerical examples are provided for illustration.     

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

Optimal production and rationing decisions in supply chains with information sharing

This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies.     

全气相化学激光体系的直流放电研究

 为了提高化学激光体系(AGIL)中F原子的产率，采用直流放电引发方式，对棒式电极的放电特性进行了研究。在对NF3/He混合气体进行解离时，通过选择不同平衡电阻，得到了3 kW左右的放电注入功率。用光谱分析仪对F原子产率进行了测量。通过拟合计算可得：一个NF3分子能够解离出1.3～1.5个F原子。     

Material compatibility constraints for make-to-order production planning

This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope.     

再论生产函数的统计学问题——与余斌、程立茹先生商榷

生产函数有着相应的经济理论背景,是以科学的数据为样本,反复拟合、检验、修正后得到的,揭示产出量与生产要素资本和劳动之间内在的必然的统计相关关系,是科学的结论。本文就此与余斌、程立茹先生进行探讨和商榷。     

钌催化二氧化碳加氢合成甲酸的研究

钌催化二氧化碳加氢合成甲酸的研究张俊忠，李忠，王辉，王常有（太原工业大学煤化所Ｃ１室，太原０３００２４）关键词ＣＯ_２催化加氢，甲酸合成，钌络合催化剂１．前言由于ＣＯ２对环境、气候和生态等方面带来愈加恶劣的影响以及碳资源的日益短缺，近年来对ＣＯ２开发?..     

The preparation of a cabbage reference material for environmental monitoring and food analysis

 Cabbage is frequently used in environmental monitoring and food control, and, hence, cabbage reference materials (RMs) are required for ensuring quality assurance. A cabbage RM was prepared in view of certification of specific elements from the "black list" of high toxicological interest and nutritive importance. All tasks of the RM production (production of the plant material, cutting and freeze-drying, determination of the residual water content, preparation of the RM, homogeneity testing, stability testing, certification measurements) are described in detail. Received: 12 November 1999 / Accepted: 29 January 2000     

Nonstationary Markov chains and convergence of the annealing algorithm

We study the asymptotic behavior as timet + of certain nonstationary Markov chains, and prove the convergence of the annealing algorithm in Monte Carlo simulations. We find that in the limitt + , a nonstationary Markov chain may exhibit phase transitions. Nonstationary Markov chains in general, and the annealing algorithm in particular, lead to biased estimators for the expectation values of the process. We compute the leading terms in the bias and the variance of the sample-means estimator. We find that the annealing algorithm converges if the temperatureT(t) goes to zero no faster thanC/log(t/t ₀) ast+, with a computable constantC andt ₀ the initial time. The bias and the variance of the sample-means estimator in the annealing algorithm go to zero likeO(t^–1+) for some 0<1, with =0 only in very special circumstances. Our results concerning the convergence of the annealing algorithm, and the rate of convergence to zero of the bias and the variance of the sample-means estimator, provide a rigorous procedure for choosing the optimal annealing schedule. This optimal choice reflects the competition between two physical effects: (a) The adiabatic effect, whereby if the temperature is loweredtoo abruptly the system may end up not in a ground state but in a nearby metastable state, and (b) the super-cooling effect, whereby if the temperature is loweredtoo slowly the system will indeed approach the ground state(s) but may do so extremely slowly.