全文获取类型
收费全文 | 144篇 |
免费 | 2篇 |
国内免费 | 1篇 |
专业分类
综合类 | 2篇 |
数学 | 145篇 |
出版年
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2015年 | 1篇 |
2014年 | 15篇 |
2013年 | 17篇 |
2012年 | 11篇 |
2011年 | 13篇 |
2010年 | 20篇 |
2009年 | 15篇 |
2008年 | 12篇 |
2007年 | 15篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2001年 | 1篇 |
2000年 | 4篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1987年 | 1篇 |
1984年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有147条查询结果,搜索用时 15 毫秒
31.
This paper presents a one-server queueing model with retrials in discrete-time. The number of primary jobs arriving in a time slot follows a general probability distribution and the different numbers of primary arrivals in consecutive time slots are mutually independent. Each job requires from the server a generally distributed number of slots for its service, and the service times of the different jobs are independent. Jobs arriving in a slot can start their service only at the beginning of the next slot. When upon arrival jobs find the server busy all incoming jobs are sent into orbit. When upon arrival in a slot jobs find the server idle, then one of the incoming jobs (randomly chosen) in that slot starts its service at the beginning of the next slot, whereas the other incoming jobs in that slot, if any, are sent into orbit. During each slot jobs in the orbit try to re-enter the system individually, independent of each other, with a given retrial probability. 相似文献
32.
This paper explores the inventory replenishment policy for deteriorating items in which the supplier provides a permissible delay to the purchaser if the order quantity is greater than or equal to a predetermined quantity. As a matter of fact, the inventory system discussed by this paper is the same as that of Chang et al. [C.T. Chang, L.Y. Ouyang, J.T. Teng, An EOQ model for deteriorating items under supplier credit credits linked to ordering quantity, Appl. Math. Model. 27 (2003) 983–996]. However, their approach in solving the problems needs further analysis. This article deals with an alternative approach to present a simple procedure in order to determine the optimal ordering policy when the supplier provides a permissible delay in payments linked to order quantity. Numerical examples reveal that the solution algorithm described in this paper is accurate and rapid. 相似文献
33.
Mitre Costa Dourado Rosiane de Freitas Rodrigues Jayme Luiz Szwarcfiter 《Annals of Operations Research》2009,169(1):81-91
Consider a set of n unit time jobs, each one having a release date, a due date, both nonnegative integers, and a weight, a positive real number.
Given a set of m parallel machines, we describe an algorithm for finding schedules with minimum weighted number of tardy jobs. The complexity
of the proposed algorithm is
O(n2\frac(1+logm)m)O(n^{2}\frac{(1+\log m)}{m})
. The best previous algorithm for this problem has complexity O(mn
3) and employs network flow techniques. Our method is based on a characterization for schedules of this type and employs graph
theoretic tools. 相似文献
34.
35.
研究具有若干固定工件和自由工件,其中固定工件必须在指定时间窗内加工,而自由工件具有不同交工的时间,并且其加工可以中断的单机排序问题,其目标是极小化工件的误工数.该问题可以表示为1|FB,rj,pmtn|∑j Uj.首先讨论了问题的几个重要性质,以此为基础建立了求解该问题的动态规划算法,其时间复杂度为O(n4+m log m),其中m和n分别是固定工件数和自由工件数. 相似文献
36.
We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are given its release date when the job becomes available for processing. All jobs have equal processing requirements. Preemptions are allowed. The objective is to find a schedule minimizing total completion time. We suggest an O(n3) algorithm to solve this problem. 相似文献
37.
Christos Koulamas 《Operations Research Letters》2010,38(2):127-128
The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n4) time by formulating and solving a series of assignment problems. In this note, a faster O(n2) dynamic programming algorithm is proposed for the TWNTD problem and for its controllable processing times generalization in the case of a convex resource consumption function. 相似文献
38.
It is known that the single machine scheduling problem of minimizing the number of tardy jobs is polynomially solvable. However, it becomes NP-hard if each job has a deadline. Recently, Huo et al. solved some special cases by a backwards scheduling approach. In this note we present a dual approach—forwards greedy algorithms which may have better running time. For example, in the case that the due dates, deadlines, and processing times are agreeable, the running time of the backwards scheduling algorithm is O(n2), while that of the forwards algorithm is O(nlogn). 相似文献
39.
We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years. 相似文献
40.
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs 总被引:2,自引:0,他引:2
A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n
5
L
43) time, where L is the number of bits in the binary encoding of the largest numerical parameter in the input, and is required relative error. The idea behind the scheme is rather general and it can be used to develop fully polynomial approximation schemes for other combinatorial optimization problems. Main feature of the scheme is that it does not require any prior knowledge of lower and/or upper bounds on the value of optimal solutions. 相似文献