首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   512篇
  免费   55篇
  国内免费   1篇
  2021年   6篇
  2019年   14篇
  2018年   8篇
  2017年   15篇
  2016年   18篇
  2015年   20篇
  2014年   17篇
  2013年   128篇
  2012年   15篇
  2011年   11篇
  2010年   11篇
  2009年   13篇
  2008年   14篇
  2007年   14篇
  2006年   12篇
  2005年   13篇
  2004年   9篇
  2003年   14篇
  2002年   12篇
  2001年   8篇
  2000年   8篇
  1999年   8篇
  1997年   5篇
  1996年   7篇
  1994年   5篇
  1993年   10篇
  1992年   6篇
  1991年   8篇
  1989年   7篇
  1988年   5篇
  1987年   4篇
  1986年   6篇
  1985年   8篇
  1984年   5篇
  1983年   4篇
  1982年   5篇
  1981年   4篇
  1980年   8篇
  1979年   8篇
  1978年   8篇
  1976年   7篇
  1975年   10篇
  1974年   6篇
  1973年   8篇
  1972年   5篇
  1971年   4篇
  1970年   5篇
  1969年   4篇
  1968年   5篇
  1967年   3篇
排序方式: 共有568条查询结果,搜索用时 15 毫秒
461.
Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
462.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
463.
We consider an integrated usage and maintenance optimization problem for a k‐out‐of‐n system pertaining to a moving asset. The k‐out‐of‐n systems are commonly utilized in practice to increase availability, where n denotes the total number of parallel and identical units and k the number of units required to be active for a functional system. Moving assets such as aircraft, ships, and submarines are subject to different operating modes. Operating modes can dictate not only the number of system units that are needed to be active, but also where the moving asset physically is, and under which environmental conditions it operates. We use the intrinsic age concept to model the degradation process. The intrinsic age is analogous to an intrinsic clock which ticks on a different pace in different operating modes. In our problem setting, the number of active units, degradation rates of active and standby units, maintenance costs, and type of economic dependencies are functions of operating modes. In each operating mode, the decision maker should decide on the set of units to activate (usage decision) and the set of units to maintain (maintenance decision). Since the degradation rate differs for active and standby units, the units to be maintained depend on the units that have been activated, and vice versa. In order to minimize maintenance costs, usage and maintenance decisions should be jointly optimized. We formulate this problem as a Markov decision process and provide some structural properties of the optimal policy. Moreover, we assess the performance of usage policies that are commonly implemented for maritime systems. We show that the cost increase resulting from these policies is up to 27% for realistic settings. Our numerical experiments demonstrate the cases in which joint usage and maintenance optimization is more valuable. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 418–434, 2017  相似文献   
464.
Control charts are widely used for process surveillance. The design of a control chart refers to the choice of sample size, the width of the control limits, and the interval between samples. Economic designs have been widely investigated and shown to be an effective method of determining control chart parameters. This article describes two different manufacturing process models to which the X¯ control chart is applied: The first model assumes that the process continues in operation while searches for the assignable cause are made, and the second assumes that the process must be shut down during the search. Economic models of the control chart for these two manufacturing process models are developed, and the sensitivity of the control chart parameters to the choice of model is explored. It is shown that the choice of the proper manufacturing process model is critical because selection of an inappropriate process model may result in significant economic penalties.  相似文献   
465.
466.
467.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive.  相似文献   
468.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes.  相似文献   
469.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when any coefficient of any row constraint is continuously varied as a linear function of a single parameter. The entire analysis is divided into three parts. Results are derived relative to the cases when the coefficient under consideration is associated, to a cell where the optimal solution in that cell attains its lower bound or its upper bound. The discussion relative to the case when the coefficient under consideration is associated to a cell in the optimal basis is given in two parts. The first part deals with the primal changes of the optimal solution while the second part is concerned with the dual changes. It is shown that the optimal cost varies in a nonlinear fashion when the coefficient changes linearly in certain cases. The discussion in this paper is limited to basis-preserving operators for which the changes in the data are such that the optimum bases are preserved. Relevant algorithms and illustrations are provided throughout the paper.  相似文献   
470.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when certain data of the problem are continuously varied as a linear function of a single parameter. First the rim conditions, then the cost coefficients, and finally the cell upper bounds are varied parametrically and the effect on the optimal solution, the associated change in costs and the dual changes are derived. Finally the effect of simultaneous changes in both cost coefficients and rim conditions are investigated. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum bases are preserved.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号