全文获取类型
收费全文 | 681篇 |
免费 | 15篇 |
出版年
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 19篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 13篇 |
2013年 | 159篇 |
2012年 | 24篇 |
2011年 | 31篇 |
2010年 | 24篇 |
2009年 | 18篇 |
2008年 | 31篇 |
2007年 | 15篇 |
2006年 | 20篇 |
2005年 | 12篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 6篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 4篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 15篇 |
1992年 | 13篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 14篇 |
1988年 | 7篇 |
1987年 | 14篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 11篇 |
1980年 | 10篇 |
1979年 | 12篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1972年 | 12篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 4篇 |
排序方式: 共有696条查询结果,搜索用时 15 毫秒
531.
Many organizations providing service support for products or families of products must allocate inventory investment among the parts (or, identically, items) that make up those products or families. The allocation decision is crucial in today's competitive environment in which rapid response and low levels of inventory are both required for providing competitive levels of customer service in marketing a firm's products. This is particularly important in high-tech industries, such as computers, military equipment, and consumer appliances. Such rapid response typically implies regional and local distribution points for final products and for spare parts for repairs. In this article we fix attention on a given product or product family at a single location. This single-location problem is the basic building block of multi-echelon inventory systems based on level-by-level decomposition, and our modeling approach is developed with this application in mind. The product consists of field-replaceable units (i.e., parts), which are to be stocked as spares for field service repair. We assume that each part will be stocked at each location according to an (s, S) stocking policy. Moreover, we distinguish two classes of demand at each location: customer (or emergency) demand and normal replenishment demand from lower levels in the multiechelon system. The basic problem of interest is to determine the appropriate policies (si Si) for each part i in the product under consideration. We formulate an approximate cost function and service level constraint, and we present a greedy heuristic algorithm for solving the resulting approximate constrained optimization problem. We present experimental results showing that the heuristics developed have good cost performance relative to optimal. We also discuss extensions to the multiproduct component commonality problem. 相似文献
532.
Michael Bastian 《海军后勤学研究》1992,39(5):651-668
This article considers the dynamic lot-size problem under discounting, allowing a speculative motive for holding inventory. A forward procedure is developed that determines the first lot-size decision in a rolling horizon environment by using forecast data of the minimum possible number of future periods. © 1992 John Wiley & Sons, Inc. 相似文献
533.
534.
We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single‐machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem. The order in which the single machine subproblems are solved has a significant impact on the quality of the overall solution and on the time required to obtain this solution. We therefore test a number of different orders for solving the subproblems. Computational results on 66 instances with ten jobs and ten machines show that our heuristic yields solutions that are close to optimal, and it clearly outperforms a well‐known dispatching rule enhanced with backtracking mechanisms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 1–17, 1999 相似文献
535.
This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4-day work weeks and no more than 4 days in a work stretch on 3-day work weeks. Such conditions often prevail in 7-day-a-week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998 相似文献
536.
537.
538.
姿态确定系统是卫星姿态控制系统中的重要组成部分,卫星姿态确定的精度直接影响卫星控制精度.为得到高姿态精度,针对由惯性测量单元(Inertial Measurement Unit),红外地平仪和太阳敏感器组成的卫星姿态确定系统,分别采用BP网络算法和径向基(RBF)网络算法对不同的姿态敏感器的输出数据进行融合,并用STK(Satellite Tool Kit)数据进行了仿真.仿真分析结果表明这两种学习算法均可以提高卫星定姿精度,相对而言,RBF网络无论是精度上还是收敛速度上均优于BP网络. 相似文献
539.
As a result of imperfect production and inspection by suppliers, pilferage, and/or damage in transit, it is common that procurement orders may contain defective items. This article deals with a continuous-review inventory system with Poisson demand arrivals and constant resupply time. Items in resupply lots may not be of perfect quality. The operating characteristics of such a system are analyzed. For purposes of computational savings, an approximation scheme for the operating characteristics is presented. As a result of the approximation, the determination of the optimal ordering policy becomes much simpler. Extensive numerical tests suggest that the approximation scheme is very effective in giving the optimal or near-optimal ordering policies for such a system. 相似文献
540.
In this article we extend the work of Mehrez and Stulman [5] on the expected value of perfect information (EVPI) to the expected value of sample information (EVSI) for a class of economic problems dealing with the decision to reject or accept an investment project. It is shown that shifting the mean of the underlying a priori distribution of X, the project's monetary value from zero in either direction will decrease the associated EVSI of Y, the random sampled information. A theorem is then presented which gives an upper bound on the EVSI over all distributions of Y, as well as the structure of the posterior mean E[X|Y] for which this upper bound is achieved. Finally, the case where E[X|Y] is linear in Y is discussed and its performance compared with that of the optimal case. 相似文献