全文获取类型
收费全文 | 505篇 |
免费 | 13篇 |
出版年
2021年 | 8篇 |
2020年 | 5篇 |
2019年 | 20篇 |
2018年 | 12篇 |
2017年 | 6篇 |
2016年 | 15篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 128篇 |
2011年 | 9篇 |
2010年 | 3篇 |
2009年 | 7篇 |
2008年 | 5篇 |
2007年 | 15篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 10篇 |
2002年 | 10篇 |
2001年 | 5篇 |
1997年 | 6篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1986年 | 14篇 |
1985年 | 9篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 7篇 |
1971年 | 9篇 |
1970年 | 9篇 |
1969年 | 5篇 |
1968年 | 3篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有518条查询结果,搜索用时 15 毫秒
1.
This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016 相似文献
2.
3.
4.
5.
6.
A learning tabu search for a truck allocation problem with linear and nonlinear cost components 下载免费PDF全文
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015 相似文献
7.
8.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
9.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
10.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献