首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   172篇
  免费   80篇
  国内免费   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年   8篇
  1998年   10篇
  1997年   1篇
  1995年   1篇
  1994年   1篇
  1991年   1篇
排序方式: 共有258条查询结果,搜索用时 15 毫秒
221.
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.  相似文献   
222.
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  相似文献   
223.
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  相似文献   
224.
For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S1 and S2 such that the sum of elements in S1 is equal to the sum of elements in S2. If additionally two elements (the kernels) r1, r2S are given which must not be assigned to the same set Si, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000  相似文献   
225.
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001  相似文献   
226.
In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999  相似文献   
227.
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  相似文献   
228.
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  相似文献   
229.
基于约束满足的多目标对地观测卫星成像调度   总被引:1,自引:0,他引:1       下载免费PDF全文
EOS(对地观测卫星)成像调度需要根据用户提出的成像任务需求确定卫星成像序列,是一个复杂的组合优化问题。考虑到成像侧视约束条件,建立EOS成像调度的多目标有向无环约束图模型。在此模型的基础上提出了基于SPEA2(strength pareto evolutionary algorithm 2)的多目标成像调度算法,采用约束控制技术设计遗传算子处理成像约束。经过三个实际的多目标成像调度问题测试,表明该算法可以有效地解决EOS成像调度问题。  相似文献   
230.
将各个项目单元抽象为不同的知识源,详细分析了集成化管理环境下的知识协同问题,提出了基于权威性加权原则的知识协同处理策略,并就策略修正、协同求解等问题作了分析说明。在此基础上,采取前向调度算法和逆向调度算法相结合的迭代算法,建立了协同工作中的任务调度模型,算例证明,模型能够有效满足各约束条件下任务的增删需求。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号