全文获取类型
收费全文 | 1042篇 |
免费 | 21篇 |
出版年
2021年 | 14篇 |
2019年 | 27篇 |
2018年 | 17篇 |
2017年 | 17篇 |
2016年 | 17篇 |
2015年 | 14篇 |
2014年 | 11篇 |
2013年 | 175篇 |
2010年 | 11篇 |
2008年 | 10篇 |
2007年 | 18篇 |
2005年 | 14篇 |
2004年 | 16篇 |
2003年 | 14篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 9篇 |
1998年 | 16篇 |
1997年 | 19篇 |
1996年 | 26篇 |
1995年 | 10篇 |
1994年 | 16篇 |
1993年 | 19篇 |
1992年 | 18篇 |
1991年 | 26篇 |
1990年 | 19篇 |
1989年 | 36篇 |
1988年 | 27篇 |
1987年 | 25篇 |
1986年 | 26篇 |
1985年 | 21篇 |
1984年 | 17篇 |
1983年 | 11篇 |
1982年 | 20篇 |
1981年 | 18篇 |
1980年 | 24篇 |
1979年 | 18篇 |
1978年 | 19篇 |
1977年 | 16篇 |
1976年 | 15篇 |
1975年 | 14篇 |
1974年 | 22篇 |
1973年 | 14篇 |
1972年 | 14篇 |
1971年 | 22篇 |
1970年 | 10篇 |
1969年 | 14篇 |
1968年 | 9篇 |
1967年 | 12篇 |
排序方式: 共有1063条查询结果,搜索用时 15 毫秒
851.
A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
852.
Unit‐load warehouses store and retrieve unit‐loads, typically pallets. When storage and retrieval operations are not coordinated, travel is from a pickup and deposit (P&D) point to a pallet location and back again. In some facilities, workers interleave storage and retrieval operations to form a dual‐command cycle. Two new aisle designs proposed by Gue and Meller (“Improving the unit‐load warehouse.” In Progress in Material Handling Research: 2006. Material Handling Industry of America, Charlotte, NC, 2006) use diagonal aisles to reduce the travel distance to a single pallet location by approximately 10 and 20[percnt] for the two designs, respectively. We develop analytical expressions for travel between pallet locations for one of these—the fishbone design. We then compare fishbone warehouses that have been optimized for dual‐command to traditional warehouses that have been optimized in the same manner, and show that an optimal fishbone design reduces dual‐command travel by 10–15%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 54: 389–403, 2009 相似文献
853.
We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
854.
In this article, we study the design and control of manufacturing cells with a mix of manual and automated equipment, operating under a CONWIP pull protocol, and staffed by a single agile (cross‐trained) worker. For a three‐station line with one automated station, we fully characterize the structure of the optimal control policy for the worker and show that it is a static priority policy. Using analytical models and extensive simulation experiments, we also evaluate the effectiveness of practical heuristic control policies and provide managerial insights on automation configuration design of the line. This characterization of the worker control policy enables us to develop managerial insights into the design issues of how best to locate and concentrate automation in the line. Finally, we show that, in addition to ease of control and greater design flexibility, the CONWIP protocol also offers higher efficiency and robustness than does the push protocol. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
855.
This article examines measures of economic efficiency in aircraft production. In particular, a type of nonlinear frontier estimation is contrasted with more traditional methods for estimating a dynamic cost function. This cost function is grounded in economic theory, and it is consistent with knowledge of the aircraft-production process. The model includes the effects of both learning and production rate on total program costs. The usefulness of the model is demonstrated with an example that relates to the acquisition of military equipment. It is shown through various sensitivity analyses that an alternative procurement policy for an aircraft program could have resulted in increased efficiency and hence a lower total program cost to the government. 相似文献
856.
In this article we consider a single-server, bulk-service queueing system in which the waiting room is of finite capacity. Arrival process is Poisson and all the arrivals taking place when the waiting room is full are lost. The service times are generally distributed independent random variables and the distribution is depending on the batch size being served. Using renewal theory, we derive the time-dependent solution for the system-size probabilities at arbitrary time points. Also we give expressions for the distribution of virtual waiting time in the queue at any time t. 相似文献
857.
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm. 相似文献
858.
859.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved. 相似文献
860.
The problem of minimal-cost operation of a fleet of ships carrying a specific amount of bulk cargo from several origin ports to several destination ports during a specified time interval is examined. The fuel oil cost, a major component of the total operating cost, is realistically modeled as a nonlinear function of the vessels' operating speeds. Introduction of both full load and ballast speeds as independent variables results in a nonlinear optimization problem in which the vessels' allocation to the available routes and the optimal speed selection problem are coupled. Within the framework of our model, each vessel of the fleet may load at any origin, unload at a destination and return to the same origin. The solution method developed utilizes specific features of the above fleet deployment model, and may reduce substantially the dimensionality of the problem. Under certain conditions, decoupling of the speed selection from the vessel allocation problem can be achieved, and linear programming can be used to obtain an optimal solution. In the general case, a projected Lagrangian method appears to be more appropriate for the problem under consideration. 相似文献