全文获取类型
收费全文 | 410篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 68篇 |
2012年 | 3篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 11篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 8篇 |
1972年 | 2篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1967年 | 3篇 |
排序方式: 共有418条查询结果,搜索用时 15 毫秒
161.
This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level-crossing theory, and examples are given for various cases of service and vacation-time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc. 相似文献
162.
Mathematical models are proposed for studying the impact of miscalibration upon operational effectiveness. Methodology for assessing the system effectiveness and an approach for optimizing the effectiveness of a calibration program are examined. The theory application is discussed and the results of some specific and convenient models are presented. 相似文献
163.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
164.
There is often a call in any organization to make the system ‘more efficient’. This document describes a novel framework for measuring organizational efficiency at the microeconomic level. We show how this framework can be used to monitor an organization using data typically available in extant performance management frameworks. This is most useful in large organizations with eclectic outputs where resources may be too constrained to perform industry-level analyses, such as data envelope analysis, to infer efficiency. This method helps illuminate how the factors of an organization’s internal practices can affect its efficient use of resources. 相似文献
165.
167.
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 相似文献
168.
In this article we present and test two heuristics for the economic lot scheduling problem. The first heuristic was developed by one of us (P.C. Geng) during Ph.D. research, while the other is a convergent implementation of an algorithm due to Doll and Whybark. We study the performance of these heuristics on a large set of test problems constructed using a new form of problem generation that yields random problems within an experimental design. 相似文献
169.
A numerical approach is presented for determining the waiting time distribution in a transient bulk-arrival, bulk-service queue. Vehicle departures from the queue are governed by a general dispatch strategy that includes holding with a variable release function and vehicle cancellations. The waiting time distribution of a customer (in a group) arriving at a given point in time is calculated by simulating the process in discrete time and determining at each step the probability the customer has left the system. The dispatch strategies require knowing the total length of the queue as well as the position a customer holds in the queue. An exact approach is compared to an accurate approximation which is 50 to 100 times faster. Comparisons are made with other approaches in the context of steady-state systems. 相似文献
170.