全文获取类型
收费全文 | 437篇 |
免费 | 15篇 |
出版年
2020年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 78篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2005年 | 4篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 4篇 |
排序方式: 共有452条查询结果,搜索用时 15 毫秒
141.
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. 相似文献
142.
The purpose of this research is to investigate simulation algorithms for nonhomogeneous Poisson processes with proportional intensities. Two algorithmic approaches are studied: inversion and thinning. Motivated by industrial practices, the covariate vector involved in the simulation is permitted to change after every event (or observation). The algorithms are extended to permit the simulation of general nonhomogeneous Poisson processes with possible discontinuities both in baseline intensity and covariate vector. This latter extension can be used to facilitate a wide range of failure situations that can arise with repairable systems. © 1994 John Wiley & Sons, Inc. 相似文献
143.
Michael C. Fu 《海军后勤学研究》2008,55(8):723-736
Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
144.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
145.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
146.
Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form vk unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019 相似文献
147.
148.
Charles Kirke 《Defense & Security Analysis》2015,31(1):74-82
This article describes the results of research into the social phenomenon of “respect” as framed by junior members of the British Army, as part of a wider study into the Values and Standards of the British Army. This research was interview based, using qualitative analysis software to detect, manage, and draw conclusions from the qualitative data recorded in those interviews. The data indicated that the primary situation in which “respect” was visualised by the participants was the unit context, and that it comprised a combination of three different strands: respect for rank or “hierarchical respect,” “professional respect” for a person's military competence, and “personal respect” for an individual's character, personal behaviour, and attributes. The overall respect that an individual is given arises from the combination of these three areas. “Respect” as a concept was, in the soldiers’ characterisation, something that had to be earned (except for the “given” represented by rank) and was not stable: a person's fund of respect could go up or down in social value. Respect was also linked to trust: the more respect a person had, the more they could be trusted. Although the unit context was the primary one for discussing their framing of the concept of respect, many of the participants reported a wider dimension in which every human being deserves a basic level of respect simply for being human, and this level could not be forfeited. 相似文献
149.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
150.
The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating. 相似文献