全文获取类型
收费全文 | 449篇 |
免费 | 10篇 |
专业分类
459篇 |
出版年
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2013年 | 117篇 |
2011年 | 4篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 3篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有459条查询结果,搜索用时 15 毫秒
91.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
92.
Gary E Weir 《战略研究杂志》2013,36(2):411-427
The Cold War at sea expanded in many realms, including the frigid and treacherous waters of the Arctic Ocean. The US Navy pioneered these efforts with the visit of USS Nautilus to the North Pole in 1958. During the latter stages of the Cold War, however, Soviet naval strategists began to conceptualize the polar ice cap as a strategic asset for cloaking the operations of its nuclear missile submarines. As under-ice operations afforded the Soviet submarine fleet advantages of stealth, proximity to target and tighter lines of communications, both navies were forced to try to develop tactics for combat under these extremely complex and arduous conditions. 相似文献
93.
George E. Monahan 《海军后勤学研究》1986,33(2):293-307
This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information. 相似文献
94.
This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc. 相似文献
95.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
96.
Since 1975 “offsets” have begun to appear frequently in contracts covering international sales of aircraft and other products incorporating advanced technology. Offsets involve reciprocity beyond that normally found in an exchange of goods for money. They may involve co‐production or co‐design of the principal item to be exchanged, or acceptance by the seller of goods or services unrelated to it as partial payment (indirect offsets or countertrade). The United States has become the major provider of offsets and anti‐offset sentiment has grown. Economists interpret them as trade diverting. Politicians from regions suffering loss of employment view them as bestowing unfair advantage to foreign competitors. The authors examine offsets from both theoretical and policy perspectives and conclude that in such noncompetitive markets, second‐best considerations dominate, requiring case‐by‐case evaluation of impacts and rendering across‐the‐board determinations of welfare loss suspect. 相似文献
97.
98.
Richard E. Chatwin 《海军后勤学研究》1996,43(5):603-612
Consider a multi-period multi-fare class airline overbooking problem that relates to a single-leg flight. Passengers may cancel their reservations at any time, including being no-shows at flight-time. Canceling passengers receive a refund that depends on their fare class, e.g., supersaver, coach, etc. At flight-time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. A continuous state-space dynamic programming model is developed in which the state is the numbers of reservations currently on hand in each fare class. In each period, reservation requests occur in only one fare class and the fraction of reservations canceling in each class is independent of the number of reservations therein. A booking-limit policy is optimal, i.e., in each period the airline accepts reservation requests up to a booking limit if the number of initial reservations in the fare class is less than the booking limit, and declines reservation requests otherwise. The booking limits for each class depend on the numbers of reservations in the other classes. When there are two fare classes the optimal booking limits in each class decrease with the number of reservations in the other class. © 1996 John Wiley & Sons, Inc. 相似文献
99.
The paper proposes an algorithm for the determination of the solution of the activities to be shortened and the amount by which they are to be shortened in order to minimize the total cost of project completion. This cost involves a linear penalty for tardienss of a set of key events and a linear cost of activity compression from its normal duration. The procedure is a generalization of the work of Fulkerson. 相似文献
100.
This paper considers the problem of locating multiple new facilities in order to minimize a total cost function consisting of the sum of weighted Euclidean distances among the new facilities and between the new and existing facilities, the locations of which are known. A new procedure is derived from a set of results pertaining to necessary conditions for a minimum of the objective function. The results from a number of sample problems which have been executed on a programmed version of this algorithm are used to illustrate the effectiveness of the new technique. 相似文献