全文获取类型
收费全文 | 289篇 |
免费 | 12篇 |
出版年
2020年 | 3篇 |
2019年 | 14篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 92篇 |
2011年 | 8篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 7篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 3篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1970年 | 4篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有301条查询结果,搜索用时 31 毫秒
1.
2.
3.
Inspection procedures may at times pose a hazard to the system being monitored. In this article, a simple hazardous-inspection model is considered. The character of the optimal ongoing inspection policy (for inspections subsequent to the first) is reviewed, and the possible forms of the optimal initiation policy are established. Efficient computational procedures are developed for calculating optimal policies. Some discussion is included of the counterintuitive nature of some of the results. 相似文献
4.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
5.
6.
7.
We consider the problem of optimizing assortments in a multi‐item retail inventory system. In addition to the usual holding and stockout costs, there is a fixed cost for including any item in the assortment. Customers' preferences for items include both probabilistic substitution patterns and the desire to purchase sets of complementary items. We develop a demand model to capture this behavior, and derive tractable approximations that allow us to formulate the optimization problem as a 0–1 mixed integer linear program. Numerical examples are solved to illustrate key insights into how both complementary and substitute items affect the optimal assortment and the expected profit. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 793–822, 2003. 相似文献
8.
Resequencing with parallel queues to minimize the maximum number of items in the overflow area 下载免费PDF全文
This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016 相似文献
9.
Militaries rely on secure communications. Despite the permeation of cyber-systems throughout the operational environment, there is little readily available doctrine on cyber-warfare. Doctrine that does exist has not been coherently integrated. This paper introduces a Cyber Conceptual Framework, consisting of five questions pertinent to the future use of cyberspace. The authors enunciate a definition of cyberspace, expand on existing military doctrine to reject the conceptualisation of cyberspace as a domain, define cyber-conflict, define cyber-attack and describe the four components and five levels of a cyber-attack. This work develops a common framework from available doctrine and a lexicon for future discussion. 相似文献
10.
In this article we present a queueing-location problem where a location of a service station has to be determined. The two main results of this article are a convexity proof for general distances and a theorem that limits the area in the plane where the solution can lie. We also propose some solution procedures. 相似文献