全文获取类型
| 收费全文 | 389篇 |
| 免费 | 0篇 |
专业分类
| 389篇 |
出版年
| 2021年 | 3篇 |
| 2019年 | 15篇 |
| 2018年 | 14篇 |
| 2017年 | 9篇 |
| 2016年 | 8篇 |
| 2015年 | 4篇 |
| 2014年 | 10篇 |
| 2013年 | 87篇 |
| 2012年 | 3篇 |
| 2010年 | 6篇 |
| 2007年 | 8篇 |
| 2006年 | 5篇 |
| 2005年 | 11篇 |
| 2004年 | 7篇 |
| 2003年 | 4篇 |
| 2002年 | 8篇 |
| 2000年 | 2篇 |
| 1999年 | 4篇 |
| 1998年 | 8篇 |
| 1997年 | 8篇 |
| 1996年 | 4篇 |
| 1995年 | 5篇 |
| 1994年 | 9篇 |
| 1993年 | 11篇 |
| 1992年 | 7篇 |
| 1991年 | 8篇 |
| 1990年 | 7篇 |
| 1989年 | 7篇 |
| 1988年 | 8篇 |
| 1987年 | 4篇 |
| 1986年 | 5篇 |
| 1985年 | 8篇 |
| 1984年 | 4篇 |
| 1983年 | 2篇 |
| 1982年 | 5篇 |
| 1981年 | 5篇 |
| 1980年 | 4篇 |
| 1979年 | 4篇 |
| 1978年 | 4篇 |
| 1977年 | 4篇 |
| 1976年 | 4篇 |
| 1975年 | 3篇 |
| 1974年 | 5篇 |
| 1973年 | 7篇 |
| 1972年 | 4篇 |
| 1969年 | 3篇 |
| 1968年 | 5篇 |
| 1967年 | 2篇 |
| 1966年 | 4篇 |
| 1948年 | 2篇 |
排序方式： 共有389条查询结果，搜索用时 0 毫秒
231.
232.
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. 相似文献
233.
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 相似文献
234.
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 相似文献
235.
To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
236.
This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
237.
In this paper we present an application of the core solution concepts for multi‐objective games to a bank ATM network model. In these games, the worth of a coalition is given by a subset of vectors of the k‐dimensional space rather than by a scalar. The paper investigates how an ATM network model based on multi‐objective cooperative game theory could be used as an alternative way of setting interchange fees paid by the customer's bank to the one that owns the ATM. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
238.
239.
240.