Multi‐item capacitated lot‐sizing problems with setup times and pricing decisions

We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于证据理论的多传感器目标识别

为了解决证据理论在具体应用中存在的问题,对Dempster组合规则思想进行了具体的分析,讨论了该组合规则存在的问题及现行的一些改进措施;针对空中目标识别问题,提出了综合运用各种改进思想的融合方法,并给出了识别过程的流程图。     

法律不确定性之研究

法律的不确定性是法律固有的性质,从法律确定性和不确定性之间的关系、法律不确定性产生的原因以及法律的不确定性与法治之间关系三个方面来阐述法律的不确定性,并评价其对于社会主义法治建设的意义。     

Production planning with resources subject to congestion

A fundamental difficulty in developing effective production planning models has been accurately reflecting the nonlinear dependency between workload and lead times. We develop a mathematical programming model for production planning in multiproduct, single stage systems that captures the nonlinear dependency between workload and lead times. We then use outer linearization of this nonlinear model to obtain a linear programming formulation and extend it to multistage systems. Extensive computational experiments validate the approach and compare its results to conventional models that assume workload‐independent planning lead times. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Deterministic chaos in a model of discrete manufacturing

A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

数据库中关联规则的并行/分布式采掘技术

高效的并行/分布式采掘方法是数据库中关联规则发现技术的重要的研究方向,首先给出了关联规则的并行/分布式采掘的相关描述,针对关联规则并行/分布式采掘的基本思想,分析算法中可以改进效能的环节,提出生成更少候选集、局部剪枝、减少通讯量和优化扫描等提高性能和降低复杂度的方法。     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

Socioeconomic impact of conflict: state of emergency ruling in Turkey

Uprising tensions during 2010 in eastern and southeastern regions of Turkey provoked arguments about the necessity for a State of Emergency (SOE; ‘Ola?anüstü Hal’ in Turkish) declaration in those regions, with a belief of enduring political sustainability. The discussion is inflamed by a speech of the Nationalist Movement Party’s leader about the suggestion to announce a SOE ruling after the death of 24 Turkish soldiers in Hakkari (a city in the southeast of Turkey) in an attack of the PKK (Kurdistan Workers’ Party) on the 19 October 2011. Although a new announcement of SOE did not take place, the discussion itself induced the idea behind this paper which is to provide a quantitative analysis of the SOE in Turkey. In fact, the SOE ruling is not a new concept for Turkey and it has been implemented in 13 cities in the eastern and southeastern regions from 1987 to 2002. Although there have been many discussions about the costs of these 15 years of the SOE ruling in terms of military expenditure and, thus, on the national budget, there is a lack of quantitative analytical examination of the economic and social costs of it. Difference-in-differences analysis reveals negative spillover impacts of the SOE, especially on the forced migration, unemployment, and educational investments. The results also show that SOE ruling is an important factor for the underdevelopment of the eastern and southeastern regions in Turkey and, thus, a new SOE will bring enormous inequalities, both economically and socially, and an intensification of the ethnic tensions in Turkey.     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999