全文获取类型
收费全文 | 338篇 |
免费 | 71篇 |
国内免费 | 22篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 23篇 |
2020年 | 9篇 |
2019年 | 1篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 4篇 |
2015年 | 10篇 |
2014年 | 8篇 |
2013年 | 13篇 |
2012年 | 9篇 |
2011年 | 12篇 |
2010年 | 15篇 |
2009年 | 28篇 |
2008年 | 28篇 |
2007年 | 20篇 |
2006年 | 12篇 |
2005年 | 11篇 |
2004年 | 9篇 |
2003年 | 2篇 |
2001年 | 3篇 |
2000年 | 19篇 |
1999年 | 33篇 |
1998年 | 18篇 |
1997年 | 21篇 |
1996年 | 24篇 |
1995年 | 12篇 |
1994年 | 16篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
排序方式: 共有431条查询结果,搜索用时 15 毫秒
411.
412.
413.
Inventory transshipment is generally shown to be beneficial to retailers by matching their excess demand with surplus inventory. We investigate an inventory transshipment game with two newsvendor-type retailers under limited total supply and check whether the retailers are better off than the case without transshipment. We derive the ordering strategies for the retailers and show that unlike the unlimited supply case, a pure Nash equilibrium only exists under certain conditions. Furthermore, contrary to the conventional wisdom, we show that inventory transshipment may not always benefit both retailers. Although one of the retailers is guaranteed to be better off, the other could be worse off. The decision criteria are then provided for the retailers to determine if they will benefit from the exercise of inventory transshipment. Numerical study indicates that the carefully chosen transshipment prices play an important role in keeping inventory transshipment beneficial to both retailers. Subsequently, a coordinating mechanism is designed for the retailers to negotiate transshipment prices that maximize the total profit of the two retailers while keeping each of them in a beneficial position. 相似文献
414.
The Anglo-American and Israeli-American special relationships have proved to be unusually close and have confounded expectations that they would wither away with the changing international environment. In order to explain this, the article proposes a theory of ‘alliance persistence’ that is based on reciprocity over shared geostrategic interests, sentimental attachments and institutionalised security relations. The article employs this theoretical framework to explore how Anglo-American and Israeli-American relations have developed during the Obama administration. It argues that the Anglo-American relationship has been closer because of the two countries’ shared strategic interests, whilst the Israeli-American relationship has experienced divergences in how the security interests of the two sides have been pursued. The article concludes by assessing how the two relationships will fair in the post-Obama era and argues that there are numerous areas of tension in the US-Israeli relationship that risk future tensions. 相似文献
415.
提出一款具有多层辐射叶结构的新型鞭状天线,在10 m鞭状天线体上设置不同的辐射叶层数、半径、长度、分支数、仰角及其分布情况,研究其对天线辐射性能的影响,综合考虑选择一套最合适的辐射叶结构,并为天线进行双加载和宽带匹配网络的算法优化。仿真结果表明,与现有的普通宽带鞭状天线相比,增益和效率得到了普遍提高,在低频段增益最高提高了3 dB,效率最高提高了5%;在高频段增益最高提高了5 dB,效率最高提高了35%,方向图上翘也得到了一定的抑制,为改善现有的宽带鞭状天线提供一种新的结构设计方法。 相似文献
416.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
417.
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 相似文献
418.
419.
420.