发布求助
文献互助 智能选刊 最新文献

Naval Research Logistics Quarterly最新文献

筛选
英文 中文
Scheduling n nonoverlapping jobs and two stochastic jobs in a flow shop 在流程车间调度n个非重叠作业和两个随机作业
Naval Research Logistics Quarterly Pub Date : 1986-02-01 DOI: 10.1002/NAV.3800330111
R. Foley, S. Suresh
{"title":"Scheduling n nonoverlapping jobs and two stochastic jobs in a flow shop","authors":"R. Foley, S. Suresh","doi":"10.1002/NAV.3800330111","DOIUrl":"https://doi.org/10.1002/NAV.3800330111","url":null,"abstract":"","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117200077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Production‐location problems with demand considerations 考虑需求的生产选址问题
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320409
E. Venta, A. P. Hurter
{"title":"Production‐location problems with demand considerations","authors":"E. Venta, A. P. Hurter","doi":"10.1002/NAV.3800320409","DOIUrl":"https://doi.org/10.1002/NAV.3800320409","url":null,"abstract":"The production-location problem of a profit maximizing firm is considered. A model is developed for a single firm, facing the joint problems of determining the optimal plant location, the optimal input mix, and the optimal plant size. A homothetic production function is used as the model of the production technologies, and the existence of a sequential “separability” between the production, or input mix, problem and the location problem is demonstrated.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123054179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Weapon acquisition with target uncertainty 目标不确定的武器获取
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320404
R. Nickel, M. Mangel
{"title":"Weapon acquisition with target uncertainty","authors":"R. Nickel, M. Mangel","doi":"10.1002/NAV.3800320404","DOIUrl":"https://doi.org/10.1002/NAV.3800320404","url":null,"abstract":"This article is concerned with choosing a mix of weapons, subject to constraints, when the targets to be attacked are known imprecisely. It is shown that the correct method for optimizing the mix of weapons involves a pair of nested optimization problems (two-stage optimization). Two methods for optimizing the expected utility of a mix are discussed. The first involves a simultaneous attack model, in which it is implicitly assumed that all weapons are used at once. The second involves a sequential attack model, in which targets appear in random order and are attacked one at a time. Particular attention is given to the question of the appropriate mix of general-purpose and special-purpose weapons.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121478575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
New algorithms for (Q,r) systems with complete backordering using a fill-rate criterion 用填充率准则求解(Q,r)完全逆序系统的新算法
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320414
C. Yano
{"title":"New algorithms for (Q,r) systems with complete backordering using a fill-rate criterion","authors":"C. Yano","doi":"10.1002/NAV.3800320414","DOIUrl":"https://doi.org/10.1002/NAV.3800320414","url":null,"abstract":"We present an algorithm which determines optimal parameter values for order quantity-reorder point systems with complete backordering. The service level is measured as fraction of demand satisfied directly from shelf, also known as “fill-rate.” This algorithm differs from existing algorithms because an exact cost function is used rather than an approximation. We also present a new heuristic algorithm, which is more efficient computationally than the optimal procedure and provides excellent results. Results of extensive computational experience also are reported.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134044508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 39
Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure 具有需求不确定性和数量折扣的单周期库存模型:行为含义和一个新的解决程序
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320402
J. Jucker, M. J. Rosenblatt
{"title":"Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure","authors":"J. Jucker, M. J. Rosenblatt","doi":"10.1002/NAV.3800320402","DOIUrl":"https://doi.org/10.1002/NAV.3800320402","url":null,"abstract":"Quantity discounts are considered in the context of the single‐period inventory model known as “the newsboy problem.” It is argued that the behavioral implications of the all‐units discount schedule are more complex and interesting than the literature has suggested. Consideration of this behavior and the use of marginal analysis lead to a new method for solving this problem that is both conceptually simpler and more efficient than the traditional approach. This marginal‐cost solution procedure is described graphically, an algorithm is presented, and an example is used to demonstrate that this solution procedure can be extended easily to handle complex discount schedules, such as some combined (simultaneously applied) purchasing and transportation cost discount schedules.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"65-66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134405535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 128
An optimum multiechelon repair policy and stockage model 最优多级维修策略及库存模型
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320403
A. Kaplan, D. Orr
{"title":"An optimum multiechelon repair policy and stockage model","authors":"A. Kaplan, D. Orr","doi":"10.1002/NAV.3800320403","DOIUrl":"https://doi.org/10.1002/NAV.3800320403","url":null,"abstract":"Currently, sophisticated multiechelon models compute stockage quantities for spares and repair parts that will minimize total inventory investment while achieving a target level of weapon system operational availability. The maintenance policies to be followed are input to the stockage models. The Optimum Allocation of Test Equipment/Manpower Evaluated Against Logistics (OATMEAL) model will determine optimum maintenance as well as stockage policies for a weapon system. Specifically, it will determine at which echelon each maintenance function should be performed, including an option for component or module throwaway. Test equipment requirements to handle work load at each echelon are simultaneously optimized. Mixed-integer programming (MIP) combined with a Lagrangian approach are used to do the constrained cost minimization, that is, to minimize all costs dependent on maintenance and stockage policies while achieving a target weapons system operational availability. Real-life test cases are included.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"2672 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129021513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Causative matrix technique for deriving interim period transition probabilities in nonstationary markov process 非平稳马尔可夫过程中过渡期转移概率的因果矩阵法
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320411
S. Kim
{"title":"Causative matrix technique for deriving interim period transition probabilities in nonstationary markov process","authors":"S. Kim","doi":"10.1002/NAV.3800320411","DOIUrl":"https://doi.org/10.1002/NAV.3800320411","url":null,"abstract":"The Markov assumption that transition probabilities are assumed to be constant over entire periods has been applied in economic and social structures, for example, in the analysis of income and wage distributions. In many cases, however, nonstationary transition probabilities exist over different periods. Based on causative matrix technique, this study shows a binomial approximation for obtaining nonstationary interim transition probabilities under undisturbance when the first and the last transition matrices are known.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A heuristic with tie breaking for certain 0–1 integer programming models 一类0-1整数规划模型的启发式解法
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320408
G. E. Fox, Gary D. Scudder
{"title":"A heuristic with tie breaking for certain 0–1 integer programming models","authors":"G. E. Fox, Gary D. Scudder","doi":"10.1002/NAV.3800320408","DOIUrl":"https://doi.org/10.1002/NAV.3800320408","url":null,"abstract":"A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small- to moderate-sized randomly generated generalized set-packing models. Solutions are compared to those obtained using an existing well-regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low-density models in which the number of variables is large relative to the number of constraints.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129900629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
A (Q,R) inventory model with lost sales and Erlang-distributed lead times 一个(Q,R)库存模型，有销售损失和erlang分布的交货时间
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320407
D. J. Buchanan, R. Love
{"title":"A (Q,R) inventory model with lost sales and Erlang-distributed lead times","authors":"D. J. Buchanan, R. Love","doi":"10.1002/NAV.3800320407","DOIUrl":"https://doi.org/10.1002/NAV.3800320407","url":null,"abstract":"The exact expression is derived for the average stationary cost of a (Q,R) inventory system with lost sales, unit Poisson demands, Erlang-distributed lead times, fixed order cost, fixed cost per unit lost sale, linear holding cost per unit time, and a maximum of one order outstanding. Explicit expressions for the state probabilities and a fast method of calculating them are obtained for the case of Q greater than R. Exponential lead times are analyzed as a special case. A simple cyclic coordinate search procedure is used to locate the minimum cost policy. Examples of the effect of lead time variability on costs are given.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123633889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
An M/M/1 queue with a general bulk service rule 具有通用批量服务规则的M/M/1队列
Naval Research Logistics Quarterly Pub Date : 1985-11-01 DOI: 10.1002/NAV.3800320406
G. Curry, R. M. Feldman
{"title":"An M/M/1 queue with a general bulk service rule","authors":"G. Curry, R. M. Feldman","doi":"10.1002/NAV.3800320406","DOIUrl":"https://doi.org/10.1002/NAV.3800320406","url":null,"abstract":"A model of an M/M/1, bulk queue with service rates dependent on the batch size is developed. The operational policy is to commence service when at least L customers are available with a maximum batch size of K. Arriving customers are not allowed to join in-process service. The solution procedure utilizes the matrix geometric methodology and reduces to obtaining the inverse of a square matrix of dimension K + 1 - L. For the case where the service rates are not batch size dependent, the limiting probabilities can be written in closed form. A numerical example illustrates the variability of the system cost as a function of the minimum batch service size L.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115277348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信