全文获取类型
| 收费全文 | 298篇 |
| 免费 | 0篇 |
专业分类
| 298篇 |
出版年
| 2021年 | 3篇 |
| 2019年 | 11篇 |
| 2018年 | 7篇 |
| 2017年 | 6篇 |
| 2016年 | 6篇 |
| 2015年 | 6篇 |
| 2014年 | 7篇 |
| 2013年 | 59篇 |
| 2012年 | 5篇 |
| 2010年 | 6篇 |
| 2007年 | 7篇 |
| 2006年 | 2篇 |
| 2005年 | 6篇 |
| 2004年 | 5篇 |
| 2003年 | 2篇 |
| 2002年 | 8篇 |
| 2000年 | 2篇 |
| 1999年 | 4篇 |
| 1998年 | 8篇 |
| 1997年 | 7篇 |
| 1996年 | 3篇 |
| 1995年 | 3篇 |
| 1994年 | 8篇 |
| 1993年 | 9篇 |
| 1992年 | 5篇 |
| 1991年 | 8篇 |
| 1990年 | 7篇 |
| 1989年 | 4篇 |
| 1988年 | 6篇 |
| 1987年 | 3篇 |
| 1986年 | 5篇 |
| 1985年 | 7篇 |
| 1983年 | 2篇 |
| 1982年 | 5篇 |
| 1981年 | 5篇 |
| 1980年 | 3篇 |
| 1979年 | 4篇 |
| 1978年 | 4篇 |
| 1977年 | 3篇 |
| 1976年 | 3篇 |
| 1975年 | 3篇 |
| 1974年 | 3篇 |
| 1973年 | 5篇 |
| 1972年 | 3篇 |
| 1969年 | 2篇 |
| 1968年 | 5篇 |
| 1967年 | 2篇 |
| 1966年 | 3篇 |
| 1949年 | 1篇 |
| 1948年 | 2篇 |
排序方式： 共有298条查询结果，搜索用时 0 毫秒
171.
This article presents a mathematical model for manpower scheduling for unbalanced production lines in order to minimize in-process inventory cost. The model extends prior work by adding workers' skill limitations to the system. The model is formulated for a one-period schedule and then extended for multiperiod schedules. An example problem is solved for both single and multiperiods. A heuristic algorithm is also presented for multiperiod and large-scale problems, and computational experiences are reported. 相似文献
172.
Antoon W.J. Kolen Jan Karel Lenstra Christos H. Papadimitriou Frits C.R. Spieksma 《海军后勤学研究》2007,54(5):530-543
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
173.
E‐commerce platforms afford retailers unprecedented visibility into customer purchase behavior and provide an environment in which prices can be updated quickly and cheaply in response to changing market conditions. This study investigates dynamic pricing strategies for maximizing revenue in an Internet retail channel by actively learning customers' demand response to price. A general methodology is proposed for dynamically pricing information goods, as well as other nonperishable products for which inventory levels are not an essential consideration in pricing. A Bayesian model of demand uncertainty involving the Dirichlet distribution or a mixture of such distributions as a prior captures a wide range of beliefs about customer demand. We provide both analytic formulas and efficient approximation methods for updating these prior distributions after sales data have been observed. We then investigate several strategies for sequential pricing based on index functions that consider both the potential revenue and the information value of selecting prices. These strategies require a manageable amount of computation, are robust to many types of prior misspecification, and yield high revenues compared to static pricing and passive learning approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
174.
William H. Ruckle 《海军后勤学研究》2007,54(5):492-496
In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
175.
176.
177.
178.
179.
The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented. 相似文献
180.
We consider groups of tests for personnel selection purposes in which each test has a known a priori probability of being failed, such failure resulting in outright rejection and termination of testing. Each test has a fixed cost and given duration. We consider the minimization of the total expected cost due to both the fixed costs and the delay costs when the tests may be conducted sequentially or in parallel. In the latter situation, a heuristic algorithm is proposed and illustrated. 相似文献