On efficiency of multistage channel with bargaining over wholesale prices

This article considers a multistage channel with deterministic price‐sensitive demand. Two systems for pricing decisions, that is, the bargaining system and the leader‐follower system, are compared. We characterize the necessary and sufficient conditions on the power structure, under which the solution of the bargaining system Pareto dominates that of the leader‐follower system. Also, under such conditions, we give a tight upper bound of channel efficiency of the bargaining system, which converges to 100% channel efficiency as the number of stages increases to infinity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 449–459, 2016     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

开发设计型实验教学 提高学生综合能力

设计型实验对提高学生综合能力有重要作用.本文阐述了开发设计型实验的做法、教学效果及体会.     

需要是思想政治工作的理论依据

需要是人们行动的源泉,满足人们的需要是我们党制定方针政策的出发点,满足需要是社会主义建设的目的,所以说需要是思想政治工作的理论依据.我们要运用正确的方法满足人们的需要,以提高人们工作的积极性,使思想政治工作确有成效.     

舰船装备价格指数与物价指数的关系研究

对舰船装备价格指数与物价指数建立数学模型 ,主要分析物价指数对舰船各项成本的影响 ,分析舰船装备价格指数比物价指数涨幅更大的原因 .     

通用装备保障地理信息系统与导航定位系统

依托现有的研究工作 ,对通用装备保障地理信息系统与导航定位系统的研究意义与目的进行了综述 ,并对系统的体系结构、接口关系、各组成部分以及软硬件的需求进行了具体论述。该系统的研究成功将在我军装备保障等领域具有较高的使用及推广价值。     

略论新世纪图书馆立身之本

在21世纪,图书馆只有以信息为基础,面向读者,提高效益,不断革新才能生存和发展。     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

Scheduling patients in an ambulatory surgical center

This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003