全文获取类型
收费全文 | 359篇 |
免费 | 159篇 |
国内免费 | 37篇 |
出版年
2023年 | 5篇 |
2022年 | 6篇 |
2021年 | 8篇 |
2020年 | 12篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 20篇 |
2016年 | 32篇 |
2015年 | 22篇 |
2014年 | 31篇 |
2013年 | 27篇 |
2012年 | 37篇 |
2011年 | 37篇 |
2010年 | 19篇 |
2009年 | 42篇 |
2008年 | 22篇 |
2007年 | 22篇 |
2006年 | 29篇 |
2005年 | 30篇 |
2004年 | 27篇 |
2003年 | 15篇 |
2002年 | 12篇 |
2001年 | 13篇 |
2000年 | 22篇 |
1999年 | 14篇 |
1998年 | 13篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有555条查询结果,搜索用时 15 毫秒
151.
This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015 相似文献
152.
153.
154.
155.
156.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
157.
文章阐述了分布式储能技术的重要意义,介绍了分布式储能技术在经济社会可持续发展重要领域——能源互联网发展中的重要地位,并对分布式储能的技术形态与载体进行了分析,最后以信息网络重要组成部分——数据中心为应用场景,对分布式储能技术的实践进行了探讨。 相似文献
158.
在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。
关键词:天基预警系统、资源调度、形式化描述 相似文献
159.
吴旭光 《武警工程学院学报》2014,(2):53-55
在云计算环境下,绝大多数信息处理和存储都被转移到云中心,用户终端的计算和存储能力将逐渐弱化。本文针对这一趋势,提出一种适用于云计算的多接收方代理重加密方案,充分利用云中心的分布式计算能力,使用随机数重用和密文聚合技术,大大降低了计算和传输负担,实验表明本方案具有较高的效率。 相似文献
160.
Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014 相似文献