全文获取类型
收费全文 | 226篇 |
免费 | 22篇 |
专业分类
化学 | 1篇 |
综合类 | 10篇 |
数学 | 233篇 |
物理学 | 4篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 7篇 |
2020年 | 1篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 3篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 13篇 |
2013年 | 17篇 |
2012年 | 12篇 |
2011年 | 16篇 |
2010年 | 16篇 |
2009年 | 23篇 |
2008年 | 15篇 |
2007年 | 15篇 |
2006年 | 9篇 |
2005年 | 11篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 1篇 |
2001年 | 6篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有248条查询结果,搜索用时 15 毫秒
1.
Bilevel programming approach applied to the flow shop scheduling problem under fuzziness 总被引:1,自引:0,他引:1
Samir A. Abass 《Computational Management Science》2005,2(4):279-293
This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered
here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision
makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to
minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan.
In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating
optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is
given.
Mathematics Subject Classification:
90C70, 90B36, 90C99 相似文献
2.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献
3.
工件带到达时间的两阶段柔性流水作业的近似算法 总被引:1,自引:0,他引:1
研究了工件带到时间的两阶段柔性流水作业的排序问题,基于求解流水作业和平行机问题的算法思想,提出两个相应的近似算法H(R)和H(MR(?)),证明了这两个算法的最坏情况性能比分别为3-1/m和2/5-1/m,讨论了界的紧性,并利用数值模拟以分析算法与最优值的近似性能比. 相似文献
4.
作业调度是一种云计算核心技术,为了获得更优的云计算作业调度方案,提出一种文化框架下多群智能优化算法的云作业调度方法。首先构建云作业调度问题的数学模型,然后借助文化算法模型,粒子群算法组成信仰空间,人工鱼群算法组成群体空间,两者之间并行演化,相互促进,对云计算作业调度数学模型进行求解,最后通过仿真实验测试算法的性能。结果表明,本文加快了算法的收敛速度,获得了更优的云计算作业调度方案,大幅度缩短少云计算作业完成时间,具有一定的实用价值。 相似文献
5.
Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant. 相似文献
6.
Thomas Tautenhahn 《Mathematical Methods of Operations Research》1996,43(2):215-231
We consider open shop problems with unit processing times,n jobs have to be processed onm machines. The order in which a given job is processed on the machines is not fixed. For each job a release time or a due
date may be given. Additional, we consider the restriction that every machine must perform all corresponding operations without
any delay time. Unit time open shop problems with release times to minimize total completion time were unsolved up to now
for both allowed and forbidden delay times. We will solve these problems in the case of two and three machines. Furthermore
we will give polynomial algorithms for several no-delay-problems with due dates. 相似文献
7.
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop 总被引:1,自引:0,他引:1
Michael Andresen Heidemarie Brsel Marc Mrig Jan Tusch Frank Werner Per Willenius 《Mathematical and Computer Modelling》2008,48(7-8):1279-1293
This paper considers the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. It continues recent work by Bräsel et al. [H. Bräsel, A. Herms, M. Mörig, T. Tautenhahn, T. Tusch, F. Werner, Heuristic constructive algorithms for open shop scheduling to minmize mean flow time, European J. Oper. Res., in press (doi.10.1016/j.ejor.2007.02.057)] on constructive algorithms. For this strongly NP-hard problem, we present two iterative algorithms, namely a simulated annealing and a genetic algorithm. For the simulated annealing algorithm, several neighborhoods are suggested and tested together with the control parameters of the algorithm. For the genetic algorithm, new genetic operators are suggested based on the representation of a solution by the rank matrix describing the job and machine orders. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The algorithms are compared relative to each other, and the quality of the results is also estimated partially by a lower bound for the corresponding preemptive open shop problem. For most of the problems, the genetic algorithm is superior when fixing the same number of 30 000 generated solutions for each algorithm. However, in contrast to makespan minimization problems, where the focus is on problems with an equal number of jobs and machines, it turns out that problems with a larger number of jobs than machines are the hardest problems. 相似文献
8.
The main results in a recent paper [M. Cheng, S. Sun, L. He, Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines, European Journal of Operational Research 183 (2007) 115–124] are incorrect because job processing times are variable due to deteriorating effect, which is not taken into account by the authors. In this note, we show first by counter-examples that the published results are incorrect, and then we provide corrected results. 相似文献
9.
This paper proposes an integer linear programming formulation for a simultaneous lot sizing and scheduling problem in a job shop environment. Among others, one of our realistic assumptions is dealing with flexible machines which enable the production manager to change their working speeds. Then, a number of valid inequalities are developed based on problem structures. As the valid inequalities can help in reducing the non-optimal parts of the solution space, they are dealt with as some cutting planes. The proposed cutting planes are used to solve the problem in (i) cut-and-branch, and (ii) branch-and-cut approaches. The performance of each cutting plane is investigated with CPLEX 12.2 on a set of randomly-generated test data. Then, some performance criteria are identified and the proposed cutting planes are ranked by TOPSIS method. 相似文献
10.
A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines.It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated. 相似文献