全文获取类型
收费全文 | 172篇 |
免费 | 79篇 |
国内免费 | 6篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 12篇 |
2012年 | 15篇 |
2011年 | 18篇 |
2010年 | 6篇 |
2009年 | 14篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 18篇 |
2005年 | 18篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有257条查询结果,搜索用时 281 毫秒
241.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998 相似文献
242.
We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are ordered. For the m machine common due date problem, we assume that one machine is maximal and impose a restriction on its load. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 525–532, 1998 相似文献
243.
Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information. 相似文献
244.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work 下载免费PDF全文
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
245.
Murat Güngör 《海军后勤学研究》2016,63(4):346-348
For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016 相似文献
246.
247.
在考虑多种约束关系基础上 ,提出一种并行与分布式系统中多约束关系的任务分配与调度的共同进化遗传算法。仿真试验结果表明所给算法比传统单种遗传算法更能有效地进行多任务分配与调度 ,具有一定的工程价值 相似文献
248.
Snke Hartmann 《海军后勤学研究》2002,49(5):433-448
This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029 相似文献
249.
In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
250.
为对天地测控资源调度进行高效求解,设计了两阶段递进遗传算法对其进行优化调度。鉴于问题的目标具有一定的可分性,以时间为依据将被调度弧段划分成两个部分,在对第一部分形成种群并作进化求解的基础上,将其最优解与第二部分弧段组合,并作进一步的进化求解。为了缓解两阶段优化的局部搜索特性,在第一阶段个体适应度计算中,以一定概率设定虚拟弧段,保留具有潜在全局优势的个体。仿真表明该方法能在确保求解质量的前提下明显减少运算时间。 相似文献