全文获取类型
收费全文 | 420篇 |
免费 | 4篇 |
专业分类
424篇 |
出版年
2025年 | 2篇 |
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 12篇 |
2018年 | 4篇 |
2017年 | 17篇 |
2016年 | 20篇 |
2015年 | 19篇 |
2014年 | 15篇 |
2013年 | 70篇 |
2012年 | 21篇 |
2011年 | 21篇 |
2010年 | 21篇 |
2009年 | 21篇 |
2008年 | 23篇 |
2007年 | 34篇 |
2006年 | 23篇 |
2005年 | 16篇 |
2004年 | 21篇 |
2003年 | 13篇 |
2002年 | 14篇 |
2001年 | 11篇 |
2000年 | 13篇 |
1999年 | 2篇 |
1998年 | 1篇 |
排序方式: 共有424条查询结果,搜索用时 0 毫秒
21.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
22.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
23.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
24.
Sjef Orbons 《Defense & Security Analysis》2012,28(2):114-130
Commanders of the International Security Assistance Force (ISAF) have repeatedly stressed the hearts and minds approach in Afghanistan, in saying that the human terrain is decisive for a successful outcome of the mission. Avoidance of civilian casualties is considered of strategic importance, and by nature highly dependent on the management of tactical level Escalation of Force (EoF) situations. Non‐lethal weapons (NLWs) are expected to enable tactical commanders to avoid innocent civilian casualties in such situations. This article considers a selected NLW on its potential to accomplish this requirement. It uses a defence technology assessment approach to analyse EoF situations experienced by Dutch ISAF forces in which the NLW is inserted. The analysis demonstrates that a range of contextual factors in the Afghanistan high‐risk environment tend to narrow down the window of opportunity for the NLW to help defuse the risk of unintended civil casualties. 相似文献
25.
Nonparametric control charts are useful in statistical process control when there is a lack of or limited knowledge about the underlying process distribution, especially when the process measurement is multivariate. This article develops a new multivariate self‐starting methodology for monitoring location parameters. It is based on adapting the multivariate spatial rank to on‐line sequential monitoring. The weighted version of the rank‐based test is used to formulate the charting statistic by incorporating the exponentially weighted moving average control scheme. It is robust to non‐normally distributed data, easy to construct, fast to compute and also very efficient in detecting multivariate process shifts, especially small or moderate shifts which occur when the process distribution is heavy‐tailed or skewed. As it avoids the need for a lengthy data‐gathering step before charting and it does not require knowledge of the underlying distribution, the proposed control chart is particularly useful in start‐up or short‐run situations. A real‐data example from white wine production processes shows that it performs quite well. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 91–110, 2012 相似文献
26.
Technology products often experience a life‐cycle demand pattern that resembles a diffusion process, with weak demand in the beginning and the end of the life cycle and high demand intensity in between. The customer price‐sensitivity also changes over the life cycle of the product. We study the prespecified pricing decision for a product that exhibits such demand characteristics. In particular, we determine the optimal set of discrete prices and the times to switch from one price to another, when a limited number of price changes are allowed. Our study shows that the optimal prices and switching times show interesting patterns that depend on the product's demand pattern and the change in the customers' price sensitivity over the life cycle of the product. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
27.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
28.
This paper reports on a study using the available oil monitoring information, such as the data obtained using the Spectrometric Oil Analysis Programme (SOAP), to predict the residual life of a set of aircraft engines. The relationship between oil monitoring information and the residual life is established using the concept of the proportional residual, which states that the predicted residual life may be proportional to the wear increment measured by the oil analysis programmes. Assuming such a relationship between wear and the residual life exists, we formulated a recursive prediction model for the item's residual life given measured oil monitoring information to date. A set of censored life data of 30 aircraft engines (right censored due to preventive overhaul) along with the history of their monitored metal concentration information are available to us. The metal concentration information includes many variables, such as Fe, Cu, Al, etc.; not all of them are useful, and some of them may be correlated. The principal component analysis (PCA) has been adopted to reduce the dimension of the original data set and to produce a new set of uncorrelated variables, which we shall use in the prediction model. The procedure associated with estimating model parameters is discussed. The model is fitted to the actual SOAP data from the aircraft engines, and the goodness‐of‐fit test has been carried out. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
29.
The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
30.
We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献