Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

反舰导弹两种射击方式下捕捉概率及仿真

超视距攻击下,不同的射击方式对捕捉概率可能产生不同的影响.在不同射击方式误差机理分析的基础上,给出了超视距打击情况下两种不同射击方式的捕捉概率模型,在一定的数据设置情况下,进行了仿真分析,给出了两种不同射击方式下的对比分析.     

金戈铁马战汶川——成都军区部队奋勇参加2008四川抗震救灾纪实

2008年5月12日14时28分,四川省汶川地区发生里氏8.0级特大地震,其范围之广、破坏之重、伤亡之多、救灾之难,在历史上是罕见的.重灾区面积达10万平方公里,涉及88个县(市、区),1204个乡镇,受灾人口超过4000万.     

1927-1949年国民政府军人抚恤观念之流变

军人抚恤是古今中外各国政府都必须面对的难题。经过长期的历史沿革,西方出现义务型抚恤观念,中国形成传统的恩赏型抚恤观念。南京国民政府建立后,军人抚恤观念在吸收西方现代抚恤因素的基础上,在受到多次冲击的前提下,也经历着鲜明的变迁过程,即由传统的恩赏型抚恤观念向现代义务型抚恤观念转变。     

谈谈军工企业自主创新中知识产权的管理

介绍了军工企业单位自主创新中知识产权管理现状、存在的问题以及知识产权管理的意义,探讨了研究开发中知识产权利用和管理的方法、模式。     

都市圈石漠化区域采石场的生态恢复方法与措施探讨

都市圈石漠化区域采石场往往由于过度开发且未采取有效的恢复措施,致使生态环境破坏严重,严重影响了都市圈的生态环境和经济发展.在分析都市圈石漠化区域采石场生态恢复特点的基础上,论述了其生态恢复的基本方法及工程技术措施,指出都市圈石漠化区域采石场生态恢复应依据都市圈发展总体规划和景观生态学、景观建筑学及美学原理,采用开发性治理方法,综合运用多种工程技术措施恢复植被、整治水土流失并进行景观再造,从而满足都市圈对于景观的要求,提高土地利用价值,促进都市圈社会经济发展和城市生态环境建设.     

空袭兵器作战效能标准化问题研究

空袭兵器作战效能标准化将典型的空袭兵器的作战效能指数向选定的标准空袭兵器转化,其转化的结果用于防空兵力需求的计算。标准化过程主要包括标准空袭兵器的选择、作战效能指标体系的建立、指标权重的计算、性能指标参数的归一、效能指数的解算和标准化系数的换算六个步骤,运用加权算法、幂指数法和层次分析法建模计算,最终得出美台主要空袭兵器标准化效能数据。为空袭兵器作战效能的标准化提供了一种科学方法,从而便于实施防空作战资源需求分析和防空作战资源作战效能分析。     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008