全文获取类型
| 收费全文 | 517篇 |
| 免费 | 0篇 |
专业分类
| 517篇 |
出版年
| 2021年 | 4篇 |
| 2019年 | 12篇 |
| 2018年 | 6篇 |
| 2017年 | 11篇 |
| 2016年 | 14篇 |
| 2015年 | 17篇 |
| 2014年 | 11篇 |
| 2013年 | 134篇 |
| 2012年 | 12篇 |
| 2011年 | 11篇 |
| 2010年 | 6篇 |
| 2009年 | 10篇 |
| 2008年 | 13篇 |
| 2007年 | 15篇 |
| 2006年 | 8篇 |
| 2005年 | 16篇 |
| 2004年 | 12篇 |
| 2003年 | 14篇 |
| 2002年 | 13篇 |
| 2001年 | 8篇 |
| 2000年 | 7篇 |
| 1999年 | 10篇 |
| 1996年 | 5篇 |
| 1995年 | 5篇 |
| 1994年 | 6篇 |
| 1993年 | 4篇 |
| 1992年 | 4篇 |
| 1991年 | 4篇 |
| 1989年 | 7篇 |
| 1988年 | 7篇 |
| 1987年 | 5篇 |
| 1986年 | 8篇 |
| 1985年 | 6篇 |
| 1983年 | 3篇 |
| 1982年 | 8篇 |
| 1980年 | 5篇 |
| 1979年 | 4篇 |
| 1978年 | 5篇 |
| 1977年 | 6篇 |
| 1976年 | 4篇 |
| 1975年 | 5篇 |
| 1974年 | 5篇 |
| 1973年 | 6篇 |
| 1972年 | 5篇 |
| 1971年 | 8篇 |
| 1970年 | 3篇 |
| 1969年 | 5篇 |
| 1968年 | 5篇 |
| 1966年 | 2篇 |
| 1948年 | 3篇 |
排序方式： 共有517条查询结果，搜索用时 15 毫秒
101.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
102.
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献
103.
In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017 相似文献
104.
Daniel Meier 《Small Wars & Insurgencies》2018,29(3):515-536
AbstractSince the end of the civil war in 1990, the Lebanese second Republic has experienced a dual security governance in the southern borderland region. Up to the Syrian military withdrawal in 2005, the territorial and functional ‘areas of limited statehood’ between the State and Hizbullah worked as a cooperation. After the Syrian withdrawal, various forms of cooperation appeared, raising the theoretical interest for the ‘mediated state’ framework. It is conceptualizing the cooperation between the state and the non-state actor as an interdependency – with case study ranging from the marking of the Blue Line to the struggle against the jihadists groups. 相似文献
105.
We study a supply chain in which an original equipment manufacturer (OEM) and a contract manufacturer (CM) compete in the finished goods market. The OEM can decide whether to outsource the intermediate good, a critical component for producing the finished good, from the CM or make in‐house production. Technology transition improves the CM's production efficiency, and it can take two different forms: a direct technology transfer from the OEM to the CM or technology spillovers through outsourcing from the OEM to the CM. We document the possibility of strategic outsourcing, that is, the CM supplies the intermediate good to the OEM when she is less efficient than the OEM's in‐house production. We find that technology spillovers can strengthen the incentive for strategic outsourcing. Furthermore, compared with direct technology transfers, outsourcing coupled with technology spillovers may generate more technology transition. Outsourcing is a particularly appropriate channel for implicit collusion when the OEM is not very efficient with the production of the intermediate good. Our results suggest that ex post competition on the finished goods can create room for ex ante collaboration and provide some implications on the OEM's outsourcing strategies when facing a competitive CM.© 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 501–514, 2014 相似文献
106.
In most western countries, there is a strong incentive for defence department budget-holders to expend all of the funds they are authorized to spend in a fiscal year. In this paper, we question whether this emphasis makes sense. We develop a model of a defence department’s operating expenditure assuming a fixed level of funding for a year and uncertain costs. The results of the model suggest that the incentive for departmental managers to expend all authorized funds is inefficient. We explore the implications of the model for the Department of National Defence (DND) in Canada in light of the recent criticism of DND lapsed funding by the Auditor-General of Canada. 相似文献
107.
While accepting consumer returns has long been proposed as a solution to resolve the consumer valuation uncertainty problem, there are still a sizable portion of retailers who insist on a “no return” policy. In this article, we offer an economic rationale for these seemingly unreasonable strategies in a supply chain context. We demonstrate when and why the retailer may benefit from refusing consumer returns, even though offering consumer returns allows the supply chain to implement the expostmarket segmentation. Granting the retailer the right to refuse consumer returns may sometimes improve supply chain efficiency: it eliminates the manufacturer's attempt to induce inefficient consumer returns and bring the equilibrium back to that in the vertically integrated benchmark. We also find that the refund and the retail price can move in the opposite directions when product reliability varies, and consumer returns have a nontrivial impact on the quality choice. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 686–701, 2015 相似文献
108.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
109.
The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
110.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献