全文获取类型
收费全文 | 342篇 |
免费 | 67篇 |
国内免费 | 7篇 |
出版年
2023年 | 2篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 13篇 |
2015年 | 18篇 |
2014年 | 11篇 |
2013年 | 72篇 |
2012年 | 18篇 |
2011年 | 20篇 |
2010年 | 14篇 |
2009年 | 18篇 |
2008年 | 22篇 |
2007年 | 25篇 |
2006年 | 9篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 15篇 |
2002年 | 17篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 16篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 4篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有416条查询结果,搜索用时 31 毫秒
51.
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000 相似文献
52.
针对12V180柴油机原球形预燃室喷嘴因热负荷过大而产生热裂和断裂脱落的问题,进行了理论分析和实验研究,提出了一种新型的预燃室-超小型水滴形预燃室.实验证明使用该预燃室,可以大大降低喷嘴的热负荷,提高喷嘴使用的可靠性. 相似文献
53.
Many manufacturing and service organizations in Europe have used annualized hours, also known as flexiyear, to successfully tackle seasonal demand. Under annualized hours, the employer has a certain number of labor hours available in a year and the employer can allocate the hours over the year according to manpower need. A problem in planning for annualized hours is the scheduling of the workforce over the year. We present an algorithm to generate an annual schedule for a scenario in which a facility operates one or more shifts and manpower need may vary from week to week. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 726–736, 1999 相似文献
54.
Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999 相似文献
55.
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. 相似文献
56.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
57.
We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
58.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
59.
60.
在地空导弹命中精度检验问题中,提出了充分利用单发导弹的测试数据进行命中精度的检验。该思想是利用χ2检验法对导弹速度的瞬时误差(系统误差)的方差进行检验,并给出了在测出导弹7、9、11个轨迹点条件下的2类风险临界值表,为武器精度检验提供了一定依据。 相似文献