全文获取类型
收费全文 | 155篇 |
免费 | 11篇 |
专业分类
166篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 7篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 2篇 |
2013年 | 23篇 |
2011年 | 5篇 |
2009年 | 2篇 |
2008年 | 2篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 8篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1972年 | 1篇 |
1971年 | 4篇 |
1969年 | 2篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有166条查询结果,搜索用时 0 毫秒
81.
There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if Xi = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015 相似文献
82.
We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs. 相似文献
83.
The connectivity of a subgraph of a graph can exceed the connectivity of the graph. We call the largest of the connectivities of all subgraphs the subconnectivity. We then give the exact solution to the extremal problem of determining the maximum number of lines in a p-point graph of subconnectivity two. 相似文献
84.
H. T. Papadopoulos 《海军后勤学研究》1998,45(7):669-685
This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C2) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998 相似文献
85.
Assume the payoffs of a matrix game are concave in the index of the maximizing player. That player is shown to have an optimal strategy which uses at most two consecutive pure strategies, identifiable through approximate solution of a related continuous game. Generalizations are given, and the results are applied to a motivating hidden-target model due to Shapley. © 1994 John Wiley & Sons, Inc. 相似文献
86.
87.
In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
88.
The gas turbine engine is used to power many different types of commercial and military aircraft. During the scheduled maintenance of these engines, many of the turbine components are replaced. Of particular importance to us is the replacement of nozzle guide vanes in the nozzle assembly section of the engine. Individual vanes are selected from inventory to make up sets, and each set must meet certain characteristics in order to be feasible. The vanes in each set must then be sequenced in order to meet additional criteria. In this article, we give heuristics for the above partitioning and sequencing problems. Empirical analyses, using actual data from a branch of the armed services and a major engine manufacturer, are used to evaluate the proposed heuristics. The results of these analyses indicate that the heuristics are effective. 相似文献
89.
The present paper studies the relative magnitudes of expected waiting times in extended machine-repair models, when processing times are of two Erlang types. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 864–870, 1999 相似文献
90.
The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold. 相似文献