董事会特征与总经理变更

本文以在上海证券交易所1999年前上市的公司为样本,研究董事会特征等治理变量对总经理变更的影响。研究结果表明,对相对业绩下降公司的总经理变更能起到显著解释作用的变量只有董事会会议的次数和公司的领导结构。而其它治理变量,诸如董事会规模、管理董事比例、独立董事比例、股权集中度、董事会成员持股比例等,未能对总经理变更起到显著的解释作用。     

Demand and Production Management with Uniform Guaranteed Lead Time

Recently, innovation‐oriented firms have been competing along dimensions other than price, lead time being one such dimension. Increasingly, customers are favoring lead time guarantees as a means to hedge supply chain risks. For a make‐to‐order environment, we explicitly model the impact of a lead time guarantee on customer demands and production planning. We study how a firm can integrate demand and production decisions to optimize expected profits by quoting a uniform guaranteed maximum lead time to all customers. Our analysis highlights the increasing importance of lead time for customers, as well as the tradeoffs in achieving a proper balance between revenue and cost drivers associated with lead‐time guarantees. We show that the optimal lead time has a closed‐form solution with a newsvendor‐like structure. We prove comparative statics results for the change in optimal lead time with changes in capacity and cost parameters and illustrate the insights using numerical experimentation.     

Evolution of Quality: First Fifty Issues of Production and Operations Management

Many contributions have been made to the field of quality since the inaugural issue of Production and Operations Management in 1992. The first issue called for more research and teaching on TQM, which resulted in two special issues dedicated to TQM. Many other articles related to quality have also been published in the first fifty issues of the journal on topics ranging from technical methods to the Baldrige Award and ISO 9000. As we review these articles, we assess their contribution and the progression of the field of quality. Although past research has advanced our understanding of quality, there still exists many research opportunities in developing more theory, using additional research methodologies, and studying emerging topics in this field.     

电子商务环境下管理理论与方法研究回顾

回顾了国家自然科学基金重点资助项目"电子商务环境下管理理论与方法研究"(70031020)的立项及实施过程,介绍了项目已取得的科研成果及经济社会效益,系统总结了项目组织实施的若干成功经验.提出的"官、产、学"一体化的研发管理模式,对于组织实施管理类大规模的重点基金项目具有借鉴价值.     

图书馆服务质量评价模型研究

图书馆服务质量是不同属性的综合体,它包括许多很难被测量的不可感知属性,这种特性给被测者在接受问卷调查时带来了一些困难.为了避免上述情况出现,在分析了图书馆服务质量综合评价中现存主要问题和影响因素的基础上,建立了基于灰色局势决策的模糊多属性决策模型,将灰色系统和模糊集理论引入定性指标值的测度中,得到了满意的结果.     

基于C/S和B/S模式的高校基建项目管理信息系统的设计与实现

通过结合华中科技大学基建与后勤管理处MIS系统的开发实例,提出了建立高校基建后勤管理信息系统建设的必要性和可能性,并给出了系统的整体结构和主要功能,最后分析了系统实现过程中的一些问题.     

Web环境下IT招标项目风险评价决策支持系统研究

分析了IT招标项目的基本风险特征,并针对因IT招标项目中风险因素多、不确定性大而导致复杂的复合决策问题,在传统决策支持系统的基础上设计了综合推理方式的.NET架构下Web环境IT项目风险评价决策支持系统,分析了系统的功能、特点和设计方法,详细讨论了系统的结构,并给出系统运作过程和实现方法.     

The Center Location Improvement Problem Under the Hamming Distance

In this paper, we consider the center location improvement problems under the sum-type and bottleneck-type Hamming distance. For the sum-type problem, we show that achieving an algorithm with a worst-case ratio of O(log |V|) is NP-hard, and for the bottleneck-type problem, we present a strongly polynomial algorithm.     

Total completion time minimization in online hierarchical scheduling of unit-size jobs

This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarchy. The job with a lower hierarchy can only be processed on the first machine and the job with a higher hierarchy can be processed on any one of m machines. We first show that the lower bound of this problem is at least \(1+\min \{\frac{1}{m}, \max \{\frac{2}{\lceil x\rceil +\frac{x}{\lceil x\rceil }+3}, \frac{2}{\lfloor x\rfloor +\frac{x}{\lfloor x\rfloor }+3}\}\), where \(x=\sqrt{2m+4}\). We then present a greedy algorithm with tight competitive ratio of \(1+\frac{2(m-1)}{m(\sqrt{4m-3}+1)}\). The competitive ratio is obtained in a way of analyzing the structure of the instance in the worst case, which is different from the most common method of competitive analysis. In particular, when \(m=2\), we propose an optimal online algorithm with competitive ratio of \(16\) \(/\) \(13\), which complements the previous result which provided an asymptotically optimal algorithm with competitive ratio of 1.1573 for the case where the number of jobs n is infinite, i.e., \(n\rightarrow \infty \).     

Characterizations of <Emphasis Type="Italic">k</Emphasis>-cutwidth critical trees

The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges (i.e., the congestion) is minimized. The investigations of critical graphs and their structures are meaningful in the study of a graph-theoretic parameters. We study the structures of k-cutwidth \((k>1)\) critical trees, and use them to characterize the set of all 4-cutwidth critical trees.