全文获取类型
收费全文 | 723篇 |
免费 | 231篇 |
国内免费 | 33篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 5篇 |
2021年 | 17篇 |
2020年 | 10篇 |
2019年 | 27篇 |
2018年 | 11篇 |
2017年 | 39篇 |
2016年 | 44篇 |
2015年 | 29篇 |
2014年 | 46篇 |
2013年 | 98篇 |
2012年 | 41篇 |
2011年 | 70篇 |
2010年 | 47篇 |
2009年 | 54篇 |
2008年 | 38篇 |
2007年 | 70篇 |
2006年 | 49篇 |
2005年 | 46篇 |
2004年 | 43篇 |
2003年 | 24篇 |
2002年 | 31篇 |
2001年 | 26篇 |
2000年 | 30篇 |
1999年 | 25篇 |
1998年 | 13篇 |
1997年 | 12篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有987条查询结果,搜索用时 15 毫秒
261.
Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility-diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self-reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self-reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers. 相似文献
262.
基于马赫曾德干涉仪模型并采用相位扩散主方程描述大气相位起伏效应对量子雷达的影响,给出了光场在相位扩散通道的演化过程,详细分析了大气相位起伏对相干态宇称探测量子雷达相位估计分辨率和最佳灵敏度的影响,并计算了大气相位起伏下相位估计灵敏度的Cramer-Rao极限。研究发现:相位起伏对于分辨率的影响可通过增加单个脉冲平均光子数来消除。在强相位起伏情况下,宇称探测得到最佳灵敏度会严重偏离散粒噪声极限,但是在弱相位起伏情况下,通过与Cramer-Rao极限的对比,发现宇称探测是一种准最佳探测方案。 相似文献
263.
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 相似文献
264.
Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
265.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
266.
In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
267.
In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003 相似文献
268.
We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
269.
Philip Kaminsky 《海军后勤学研究》2003,50(3):257-272
In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
270.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献