排序方式: 共有63条查询结果,搜索用时 15 毫秒
41.
Joseph O. Chapa 《Journal of Military Ethics》2017,16(1-2):130-137
42.
Joseph C. Hartman 《海军后勤学研究》2000,47(1):40-56
A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000 相似文献
43.
Previous lot-sizing models incorporating learning effects focus exclusively on worker learning. We extend these models to include the presence of setup learning, which occurs when setup costs exhibit a learning curve effect as a function of the number of lots produced. The joint worker/setup learning problem can be solved to optimality by dynamic programming. Computational experience indicates, however, that solution times are sensitive to certain problem parameters, such as the planning horizon and/or the presence of a lower bound on worker learning. We define a two-phase EOQ-based heuristic for the problem when total transmission of worker learning occurs. Numerical results show that the heuristic consistently generates solutions well within 1% of optimality. 相似文献
44.
Joseph O. Chapa 《Journal of Military Ethics》2016,15(3):170-186
In 2014, Colonel M. Shane Riza published an article in this journal arguing that remotely piloted aircraft (RPA) and robotic weapons threaten the US Air Force’s warrior ethos. Riza has clearly articulated the sentiments of one side of a vibrant debate within our service. This paper presents an alternative view; a view held by some who have experienced these new forms and tools of war, and who have wrestled with their implications first-hand. In this paper, we address some methodological concerns with Riza’s approach and then engage some misunderstandings about RPA’s relationship to military history and to risk. The second part of this paper takes a close look at some of the early Just War thinkers to determine what implications the tradition may have on the warrior ethos. We propose, as an alternative to Riza’s position, a return to an ethos grounded in humility, charity, and a conception of war as a last resort; in short, a return to the Just Warrior Ethos. 相似文献
45.
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
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 相似文献
46.
Joseph F. Pilat 《战略研究杂志》2016,39(4):580-591
ABSTRACTThe extended deterrence relationships between the United States and its allies in Europe and East Asia have been critical to regional and global security and stability, as well as to nonproliferation efforts, since the late 1950s. These relationships developed in different regional contexts, and reflect differing cultural, political and military realities in the US allies and their relations with the United States. Although extended deterrence and assurance relations have very different histories, and have to some extent been controversial through the years, there has been a rethinking of these relations in recent years. Many Europeans face a diminished threat situation as well as economic and political pressures on the maintenance of extended deterrence, and are looking at the East Asian relationships, which do not involve forward deployed forces as more attractive than NATO’s risk-and-burden-sharing concepts involving the US nuclear forces deployed in Europe. On the other hand, the East Asian allies are looking favorably at NATO nuclear consultations, and in the case of South Korea, renewed US nuclear deployments (which were ended in 1991), to meet increased security concerns posed by a nuclear North Korea and more assertive China. This paper explores the history of current relationships and the changes that have led the allies to view those of others as more suitable for meeting their current needs. 相似文献
47.
48.
49.
Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016 相似文献
50.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献