全文获取类型
| 收费全文 | 673篇 |
| 免费 | 17篇 |
| 国内免费 | 2篇 |
专业分类
| 692篇 |
出版年
| 2025年 | 4篇 |
| 2024年 | 4篇 |
| 2023年 | 8篇 |
| 2022年 | 5篇 |
| 2021年 | 7篇 |
| 2020年 | 1篇 |
| 2019年 | 14篇 |
| 2018年 | 10篇 |
| 2017年 | 25篇 |
| 2016年 | 39篇 |
| 2015年 | 26篇 |
| 2014年 | 37篇 |
| 2013年 | 87篇 |
| 2012年 | 32篇 |
| 2011年 | 42篇 |
| 2010年 | 32篇 |
| 2009年 | 29篇 |
| 2008年 | 29篇 |
| 2007年 | 45篇 |
| 2006年 | 33篇 |
| 2005年 | 28篇 |
| 2004年 | 24篇 |
| 2003年 | 15篇 |
| 2002年 | 25篇 |
| 2001年 | 21篇 |
| 2000年 | 22篇 |
| 1999年 | 11篇 |
| 1998年 | 13篇 |
| 1997年 | 10篇 |
| 1996年 | 5篇 |
| 1995年 | 3篇 |
| 1992年 | 2篇 |
| 1991年 | 2篇 |
| 1990年 | 2篇 |
排序方式： 共有692条查询结果，搜索用时 0 毫秒
351.
Simon Emde 《海军后勤学研究》2017,64(6):476-489
This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile. 相似文献
352.
In a caching game introduced by Alpern et al. (Alpern et al., Lecture notes in computer science (2010) 220–233) a Hider who can dig to a total fixed depth normalized to 1 buries a fixed number of objects among n discrete locations. A Searcher who can dig to a total depth of h searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero‐sum game is complicated to analyze even for small values of its parameters, and for the case of 2 hidden objects has been completely solved only when the game is played in up to 3 locations. For some values of h the solution of the game with 2 objects hidden in 4 locations is known, but the solution in the remaining cases was an open question recently highlighted by Fokkink et al. (Fokkink et al., Search theory: A game theoretic perspective (2014) 85–104). Here we solve the remaining cases of the game with 2 objects hidden in 4 locations. We also give some more general results for the game, in particular using a geometrical argument to show that when there are 2 objects hidden in n locations and n→∞, the value of the game is asymptotically equal to h/n for h≥n/2. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 23–31, 2016 相似文献
353.
In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016 相似文献
354.
The notion of signature has been widely applied for the reliability evaluation of technical systems that consist of binary components. Multi‐state system modeling is also widely used for representing real life engineering systems whose components can have different performance levels. In this article, the concept of survival signature is generalized to a certain class of unrepairable homogeneous multi‐state systems with multi‐state components. With such a generalization, a representation for the survival function of the time spent by a system in a specific state or above is obtained. The findings of the article are illustrated for multi‐state consecutive‐k‐out‐of‐n system which perform its task at three different performance levels. The generalization of the concept of survival signature to a multi‐state system with multiple types of components is also presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 593–599, 2017 相似文献
355.
A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly. 相似文献
356.
We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking. 相似文献
357.
We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions. 相似文献
358.
基于多通道通信技术的高速数据采集器的研制 总被引：2，自引：1，他引：2
主要介绍应用多通道通信技术开发研制的高速数据采集器的功能特点 ,对实际研制和使用中的几个关键技术进行了较详细的分析讨论 .应用于流场测试试验的结果表明 ,该系统速度快、稳定性好、功能齐全且自动化程度高 .该系统具有的高精度非常适合于流场测试 ,能确保测试的准确性 相似文献
359.
以模拟导航信号源软件开发为例 ,从面向对象分析设计方法、多线程方法、异常处理等几方面介绍了C ++Builder面向对象编程在多通道实时串行通信系统中应用的一种方法 相似文献
360.
We address the capacitated lot‐sizing and scheduling problem with setup times, setup carry‐over, back‐orders, and parallel machines as it appears in a semiconductor assembly facility. The problem can be formulated as an extension of the capacitated lot‐sizing problem with linked lot‐sizes (CLSPL). We present a mixed integer (MIP) formulation of the problem and a new solution procedure. The solution procedure is based on a novel “aggregate model,” which uses integer instead of binary variables. The model is embedded in a period‐by‐period heuristic and is solved to optimality or near‐optimality in each iteration using standard procedures (CPLEX). A subsequent scheduling routine loads and sequences the products on the parallel machines. Six variants of the heuristic are presented and tested in an extensive computational study. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献