Characterizing the barlow-wu structure functions

Various mathematical models for multistate systems have been proposed in the literature. Among them the model introduced by Barlow and Wu is the one most intimately related to that of binary systems; hence the Barlow-Wu class possesses many nice properties inherited from the binary systems. In this article we obtain several characterization results for multistate systems, which closely relate the Barlow-Wu class to other classes of multistate systems. The characterizations we obtained originate from the invariance properties of the Barlow-Wu functions, and are easy to apply in verifying whether a particular model is of the Barlow-Wu type. © 1994 John Wiley & Sons, Inc.     

The parallel machine min-max weighted absolute lateness scheduling problem

Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc.     

Equipment replacement under technological change

For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc.     

A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation

This article considers the dynamic lot-size problem under discounting, allowing a speculative motive for holding inventory. A forward procedure is developed that determines the first lot-size decision in a rolling horizon environment by using forecast data of the minimum possible number of future periods. © 1992 John Wiley & Sons, Inc.     

Opportunity-based age replacement: Exponentially distributed times between opportunities

This article gives a full analysis of a component-replacement model in which preventive replacements are only possible at maintenance opportunities. These opportunities arise according to a Poisson process, independently of failures of the component. Conditions for the existence of a unique average optimal control limit policy are established and an equation characterizing the optimal policy and minimal average costs is derived. An important result is that the optimal policy can be described as a so-called one-opportunity-look-ahead policy. Such policies play an important role as heuristics in more general models. It is shown that there is a correspondence with the well-known age-replacement model, which can be considered as an extreme case of the model. Finally, some numerical results are given.     

On excess-, current-, and total-life distributions of phase-type renewal processes

Consider a renewal process whose interrenewal-time distribution is phase type with representation (α, T). We show that the (time-dependent) excess-life distribution is phase type with representation (α′, T), where α′ is an appropriately modified initial probability vector. Using this result, we derive the (time-dependent) distributions for the current life and the total life of the phase-type renewal process. They in turn enable us to obtain the equilibrium distributions for the three random variables. These results simplify the computation of the respective distribution functions and consequently enhance the potential use of renewal theory in stochastic modeling—particularly in inventory, queueing, and reliability applications. © 1992 John Wiley & Sons, Inc.     

A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single‐machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem. The order in which the single machine subproblems are solved has a significant impact on the quality of the overall solution and on the time required to obtain this solution. We therefore test a number of different orders for solving the subproblems. Computational results on 66 instances with ten jobs and ten machines show that our heuristic yields solutions that are close to optimal, and it clearly outperforms a well‐known dispatching rule enhanced with backtracking mechanisms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 1–17, 1999     

开展系列课程学习指导帮助学生学会学习

在扼要介绍开展系列课程学习指导研究的基础上,重点论述了课程学习指导的目的、意义及主要内容.提出了军事工程院校系列课程学习指导应具有的特色,以及在实施学习指导进程中应把握的几个基本观点.     

如何搞好多媒体辅助教学

利用多媒体技术辅助教学,应提高认识,更新观念,明确教师在教学中的主导作用,并认真研究传统教学手段与多媒体辅助教学手段各自的优缺点,使教学效果达到最佳状态.     

依托EDA平台,加速电工电子类课程教学改革

论述了在电工电子类课程中开展EDA教学的目的、意义和必要性,介绍了在现代化教学中进行EDA教学的经验、体会和成果,提出了进一步优化课程体系、加速电工电子类课程教学改革的思路和想法.