全文获取类型
收费全文 | 234篇 |
免费 | 41篇 |
出版年
2023年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 6篇 |
2016年 | 12篇 |
2015年 | 14篇 |
2014年 | 10篇 |
2013年 | 63篇 |
2012年 | 11篇 |
2011年 | 8篇 |
2010年 | 6篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 13篇 |
2006年 | 8篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 11篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有275条查询结果,搜索用时 187 毫秒
191.
A. Gmez‐Corral 《海军后勤学研究》2004,51(8):1068-1089
The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
192.
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining bounds to the optimal burn‐in time and optimal replacement policy maximizing the steady state availability of a repairable system. It is assumed that two types of system failures may occur: One is Type I failure (minor failure), which can be removed by a minimal repair, and the other is Type II failure (catastrophic failure), which can be removed only by a complete repair. Assuming that the underlying lifetime distribution of the system has a bathtub‐shaped failure rate function, upper and lower bounds for the optimal burn‐in time are provided. Furthermore, some other applications of optimal burn‐in are also considered. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
193.
Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
194.
We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
195.
This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
196.
Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost
This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
197.
Chih‐Hsiung Wang 《海军后勤学研究》2006,53(2):151-156
A joint optimization of the production run length and preventive maintenance (PM) policy is studied for a deteriorating production system where the in‐control period follows a general probability distribution with non‐decreasing failure rate. In the literature, the sufficient conditions for the optimality of the equal‐interval PM schedule is explored to derive an optimal production run length and an optimal number of PM actions. Nevertheless, an exhaustive search may arise. In this study, based on the assumption that the conditions for the optimality of the equal‐interval PM schedule hold, we derive some structural properties for the optimal production/PM policy, which increases the efficiency of the solution procedure. These analyses have implications for the practical application of the production/PM model to be more available in practice. A numerical example of gamma shift distribution with non‐decreasing failure rates is used to illustrate the solution procedure, leading to some insight into the management process. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
198.
We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
199.
Cardiovascular diseases (CVDs) are the leading cause of death and disability both in the United States and worldwide. Despite high morbidity, mortality, and cost in the United States and global healthcare systems, cardiovascular care has been understudied in the healthcare operations management literature. In this paper, we identify research opportunities for healthcare operations management scholars to aid in improving cardiovascular care. We focus on three burdensome conditions, including (1) coronary artery disease, (2) stroke, and (3) heart failure, which, collectively, lead to the vast majority of CVD‐caused mortality and disability. For each condition, we characterize a typical patient's journey in receiving cardiovascular care, elucidating key challenges in improving care and outlining research questions for healthcare operations management scholars. We close with a reference to new research opportunities that emerge as artificial intelligence is likely to transform much of cardiovascular care. 相似文献
200.
Manufacturer rebates are commonly used as price discount tools for attracting end customers. In this study, we consider a two‐stage supply chain with a manufacturer and a retailer, where a single seasonal product faces uncertain and price‐sensitive demand. We characterize the impact of a manufacturer rebate on the expected profits of both the manufacturer and the retailer. We show that unless all of the customers claim the rebate, the rebate always benefits the manufacturer. Our results thus imply that “mail‐in rebates,” where some customers end up not claiming the rebate, particularly when the size of the rebate is relatively small, always benefit the manufacturer. On the other hand, an “instant rebate,” such as the one offered in the automotive industry where every customer redeems the rebate on the spot when he/she purchases a car, does not necessarily benefit the manufacturer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献