全文获取类型
收费全文 | 414篇 |
免费 | 11篇 |
出版年
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 5篇 |
2013年 | 105篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 15篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有425条查询结果,搜索用时 46 毫秒
121.
Richard E. Chatwin 《海军后勤学研究》1996,43(5):603-612
Consider a multi-period multi-fare class airline overbooking problem that relates to a single-leg flight. Passengers may cancel their reservations at any time, including being no-shows at flight-time. Canceling passengers receive a refund that depends on their fare class, e.g., supersaver, coach, etc. At flight-time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. A continuous state-space dynamic programming model is developed in which the state is the numbers of reservations currently on hand in each fare class. In each period, reservation requests occur in only one fare class and the fraction of reservations canceling in each class is independent of the number of reservations therein. A booking-limit policy is optimal, i.e., in each period the airline accepts reservation requests up to a booking limit if the number of initial reservations in the fare class is less than the booking limit, and declines reservation requests otherwise. The booking limits for each class depend on the numbers of reservations in the other classes. When there are two fare classes the optimal booking limits in each class decrease with the number of reservations in the other class. © 1996 John Wiley & Sons, Inc. 相似文献
122.
Richard A. Aborisade 《African Security Review》2018,27(2):177-190
This article focuses on the systemic failures of the Nigerian police force to unravel the mysteries surrounding homicides in the country, along with the security, social and political implications of the ongoing trend. The article draws on documented pieces of evidence of high-profile murders, along with the causes of the upsurge in murder incidences and the inhibitive factors relating to the investigative procedures of the police. The suitability of the theory of subaltern realism and the concept of third-world security predicaments in explaining the peculiarities of Nigeria’s internal security challenges is examined, along with the problems of the legitimacy of political regimes and weak borders. There is a need for the National Assembly of Nigeria to exercise its constituted powers in reawakening and supervising investigations into dormant cases of murder through its committees on police affairs, public safety and national security. The police should check its organisational failures, which may be related to using the wrong investigative approaches, low levels of information, limited resources, corrupt practices, and pressure to obtain quick results. 相似文献
123.
Ana E. Juncos 《Contemporary Security Policy》2018,39(4):559-574
With the failure of liberal peace strategies in the Global South, resilience has recently become the risk management strategy par excellence in peacebuilding. Since it is not possible to predict when the next crisis will take place, peacebuilders must invest in bottom-up adaptive capacities to cope with external shocks. This article moves away from governmentality accounts of resilience which are overtly deterministic and depoliticizing. Instead, it posits that the uncertainty, ambiguity, and complexity associated with resilience mean that we should expect opportunities for contestation and institutional agency. This argument will be illustrated by drawing upon the European Union’s adoption of the resilience approach in its peacebuilding and security policies. The article argues that while uncertainty, ambiguity, and complexity constitute the ontological conditions that underpin the rise of resilience in peacebuilding, they are also likely to lead to its potential demise. 相似文献
124.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
125.
This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc. 相似文献
126.
The purpose of this research is to investigate simulation algorithms for nonhomogeneous Poisson processes with proportional intensities. Two algorithmic approaches are studied: inversion and thinning. Motivated by industrial practices, the covariate vector involved in the simulation is permitted to change after every event (or observation). The algorithms are extended to permit the simulation of general nonhomogeneous Poisson processes with possible discontinuities both in baseline intensity and covariate vector. This latter extension can be used to facilitate a wide range of failure situations that can arise with repairable systems. © 1994 John Wiley & Sons, Inc. 相似文献
127.
128.
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc. 相似文献
129.
The purpose of this article is to investigate some managerial insights related to using the all-unit quantity discount policies under various conditions. The models developed here are general treatments that deal with four major issues: (a) one buyer or multiple buyers, (b) constant or price-elastic demand, (c) the relationship between the supplier's production schedule or ordering policy and the buyers' ordering sizes, and (d) the supplier either purchasing or manufacturing the item. The models are developed with two objectives: the supplier's profit improvement or the supplier's increased profit share analysis. Algorithms are developed to find optimal decision policies. Our analysis provides the supplier with both the optimal all-unit quantity discount policy and the optimal production (or ordering) strategy. Numerical examples are provided. © 1993 John Wiley & Sons. Inc. 相似文献
130.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献