全文获取类型
收费全文 | 400篇 |
免费 | 22篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 10篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 59篇 |
2012年 | 4篇 |
2011年 | 8篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 11篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 14篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
排序方式: 共有422条查询结果,搜索用时 0 毫秒
161.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
162.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
163.
This article examines the influence of both production rate and learning on airframe program costs. A dynamic multiple-output production model is developed and is used to observe the cost impact of changes in production rate and learning. Several simulations are performed to demonstrate the sensitivity of the optimal time path of cost to changes in the model parameters. The model is applied by estimating parameters from the F102 airframe program. 相似文献
164.
K. D. Glazebrook 《海军后勤学研究》1981,28(2):289-300
It is shown that there is an optimal strategy for a class of stochastic scheduling problems which is nonpreemptive. The results which yield this conclusion are generalizations of previous ones due to Glazebrook and Gittins. These new results also lead to an evaluation of the performance of nonpreemptive strategies in a large class of problems of practical interest. 相似文献
165.
166.
167.
This article presents several single-echelon, single-item, static demand inventory models for situations in which, during the stockout period, a fraction b of the demand is backordered and the remaining fraction 1 - b is lost forever. Both deterministic and stochastic demand are considered. although the case of stochastic demand is treated heuristically. In each situation, a mathematical model representing the average annual cost of operating the inventory system is developed. and an optimum operating policy derived. At the extremes b=1 and b=0 the models presented reduce to the usual backorders and lost sales cases, respectively. 相似文献
168.
The maximum likelihood estimator of the service distribution function of an M/G/∞ service system is obtained based on output time observations. This estimator is useful when observation of the service time of each customer could introduce bias or may be impossible. The maximum likelihood estimator is compared to the estimator proposed by Mark Brown, [2]. Relative to each other, Brown's estimator is useful in light traffic while the maximum likelihood estimator is applicble in heavy trafic. Both estimators are compared to the empirical distribution function based on a sample of service times and are found to have drawbacks although each estimator may have applications in special circumstances. 相似文献
169.
A manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases. 相似文献
170.
The effectiveness of Johnson's Approximate Method (JAM) for the 3 × n job shop scheduling problems was examined on 1,500 test cases with n ranging from 6 to 50 and with the processing times Ai, Bi, Ci (for item i on machines A, B, C) being uniformly and normally distributed. JAM proved to be quite effective for the case Bi ? max (Ai, Ci) and optimal for Bi, ? min (Ai, Ci). 相似文献