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

Journal of the Operations Research Society of Japan最新文献

筛选
英文 中文
A DYNAMIC MODEL WITH RESOURCES PLACED ON SINGLE LINE IN REVENUE MANAGEMENT 在收入管理中，将资源放在单线上的动态模型
Journal of the Operations Research Society of Japan Pub Date : 2017-04-20 DOI: 10.15807/JORSJ.60.91
Yu Ogasawara
{"title":"A DYNAMIC MODEL WITH RESOURCES PLACED ON SINGLE LINE IN REVENUE MANAGEMENT","authors":"Yu Ogasawara","doi":"10.15807/JORSJ.60.91","DOIUrl":"https://doi.org/10.15807/JORSJ.60.91","url":null,"abstract":"Recently, a seating position can be often selected when a plane or bullet train ticket is reserved. Specially, for theater and stadium, it is important to decide how to assign reservations to seats. This paper proposes a dynamic model where seats’ resources are located at a single line with considering seats position that have already been assigned. An analysis has been conducted and the results show that, 1) optimal policy for an arriving request is to allocate it to one side of the edges of the adjacent vacancies, 2) if all of the resources are vacant at beginning time for booking, then the model corresponds to a single-leg model with multiple seat bookings and single fare class in Lee and Hersh (1993), 3) it is not necessarily optimal that a request is allocated to the less adjacent seats’ vacancy. Finally, this paper proposes an algorithm to solve the optimal policy using above results and conducts numerical examples.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"91-100"},"PeriodicalIF":0.0,"publicationDate":"2017-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.91","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45765946","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}
引用次数: 2
SURE WAY TO WIN A GAME USING A MUTUALLY DEPENDENT DECISION PROCESS MODEL 使用相互依赖的决策过程模型赢得游戏的可靠方法
Journal of the Operations Research Society of Japan Pub Date : 2017-04-20 DOI: 10.15807/JORSJ.60.110
Toshiharu Fujita
{"title":"SURE WAY TO WIN A GAME USING A MUTUALLY DEPENDENT DECISION PROCESS MODEL","authors":"Toshiharu Fujita","doi":"10.15807/JORSJ.60.110","DOIUrl":"https://doi.org/10.15807/JORSJ.60.110","url":null,"abstract":"The purpose of this study is to consider the problem of finding a guaranteed way of winning a certain two-player combinatorial game of perfect knowledge from the standpoint of mutually dependent decision processes (MDDPs). Our MDDP model comprises two one-stage deterministic decision processes. Each decision process expresses every turn of a player. We analyze a MDDP problem in which the length of turns taken by a player is minimized, allowing him to win regardless of the decisions made by his opponent. The model provides a formulation for finding the shortest guaranteed strategy. Although computational complexity remains, the concept introduced in this paper can also be applied to other two-player combinatorial games of perfect knowledge.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"110-121"},"PeriodicalIF":0.0,"publicationDate":"2017-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.110","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48118801","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
PHASE-TYPE APPROXIMATION OF THE GERBER-SHIU FUNCTION GERBER-SHIU函数的相位型近似
Journal of the Operations Research Society of Japan Pub Date : 2017-01-10 DOI: 10.15807/JORSJ.60.337
K. Yamazaki
{"title":"PHASE-TYPE APPROXIMATION OF THE GERBER-SHIU FUNCTION","authors":"K. Yamazaki","doi":"10.15807/JORSJ.60.337","DOIUrl":"https://doi.org/10.15807/JORSJ.60.337","url":null,"abstract":"The Gerber-Shiu function provides a way of measuring the risk of an insurance company. It is given by the expected value of a function that depends on the ruin time, the deficit at ruin, and the surplus prior to ruin. Its computation requires the evaluation of the overshoot/undershoot distributions of the surplus process at ruin. In this paper, we use the recent developments of the fluctuation theory and approximate it in a closed form by fitting the underlying process by phase-type Levy processes. A sequence of numerical results are given.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"337-352"},"PeriodicalIF":0.0,"publicationDate":"2017-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.337","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47639276","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}
引用次数: 5
ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS l -凸函数最小化算法:离散凸分析与其他研究领域的联系
Journal of the Operations Research Society of Japan Pub Date : 2017-01-01 DOI: 10.15807/JORSJ.60.216
A. Shioura
{"title":"ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS","authors":"A. Shioura","doi":"10.15807/JORSJ.60.216","DOIUrl":"https://doi.org/10.15807/JORSJ.60.216","url":null,"abstract":"L-convexity is a concept of discrete convexity for functions de(cid:12)ned on the integer lattice points, and plays a central role in the framework of discrete convex analysis. In this paper, we review recent development of algorithms for L-convex function minimization. We (cid:12)rst point out the close connection between discrete convex analysis and various research (cid:12)elds such as discrete optimization, auction theory, and computer vision by showing that algorithms proposed independently in these research (cid:12)elds can be regarded as minimization algorithms applied to speci(cid:12)c L-convex functions. Therefore, we can provide a uni(cid:12)ed approach to analyze the algorithms appearing in various research (cid:12)elds through the concept of L-convex function. We then present the recent results on theoretical bounds of the number of iterations required by some minimization algorithms, where precise bounds are given in terms of distance between the initial solution and the minimizer found by the algorithms. From these results we see that the algorithms output the nearest\" minimizer to the initial solution, and that the trajectories of solutions generated by the algorithms are shortest paths\" from the initial solution to the found minimizer. Finally, we consider an application of the results to iterative auctions in auction theory. We point out that the essence of the iterative auctions proposed by Ausubel (2006) lies in L-convexity. We also present new iterative auctions by Murota{Shioura{Yang (2016), which are based on the understanding of existing iterative auctions from the viewpoint of discrete convex analysis.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"216-243"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.216","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67215533","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}
引用次数: 19
A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM 模块化最大化问题的切割平面算法
Journal of the Operations Research Society of Japan Pub Date : 2017-01-01 DOI: 10.15807/JORSJ.60.24
Yoichi Izunaga, Y. Yamamoto
{"title":"A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM","authors":"Yoichi Izunaga, Y. Yamamoto","doi":"10.15807/JORSJ.60.24","DOIUrl":"https://doi.org/10.15807/JORSJ.60.24","url":null,"abstract":"Modularity proposed by Newman and Girvan is the most commonly used measure when the nodes of a graph are grouped into communities consisting of tightly connected nodes. We formulate the modularity maximization problem as a set partitioning problem, and propose an algorithm for the problem based on the linear programming relaxation. We solve the dual of the linear programming relaxation by using a cutting plane method. To mediate the slow convergence that cutting plane methods usually suffer, we propose a method for finding and simultaneously adding multiple cutting planes.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"24-42"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.24","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67215181","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}
引用次数: 5
A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH 带强迫图的最小背包问题的2逼近算法
Journal of the Operations Research Society of Japan Pub Date : 2017-01-01 DOI: 10.15807/JORSJ.60.15
Yotaro Takazawa, S. Mizuno
{"title":"A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH","authors":"Yotaro Takazawa, S. Mizuno","doi":"10.15807/JORSJ.60.15","DOIUrl":"https://doi.org/10.15807/JORSJ.60.15","url":null,"abstract":"Carnes and Shmoys [2] presented a 2-approximation algorithm for the minimum knapsack problem. We extend their algorithm to the minimum knapsack problem with a forcing graph (MKPFG), which has a forcing constraint for each edge in the graph. The forcing constraint means that at least one item (vertex) of the edge must be packed in the knapsack. The problem is strongly NP-hard, since it includes the vertex cover problem as a special case. Generalizing the proposed algorithm, we also present an approximation algorithm for the covering integer program with 0-1 variables.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"15-23"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.15","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67214731","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}
引用次数: 5
ANOTHER LOOK AT NONPARAMETRIC ESTIMATION FOR TREND RENEWAL PROCESSES 另一个趋势更新过程的非参数估计
Journal of the Operations Research Society of Japan Pub Date : 2016-10-01 DOI: 10.15807/JORSJ.59.312
Yasuhiro Saito, T. Dohi
{"title":"ANOTHER LOOK AT NONPARAMETRIC ESTIMATION FOR TREND RENEWAL PROCESSES","authors":"Yasuhiro Saito, T. Dohi","doi":"10.15807/JORSJ.59.312","DOIUrl":"https://doi.org/10.15807/JORSJ.59.312","url":null,"abstract":"A trend renewal process is characterized by a counting process and a renewal process which are mutually transformed with each other by a trend function, and plays a significant role to represent a sub-class of general repair models. In this paper we develop another nonparametric estimation method for trend renewal processes, where the form of failure rate function in the renewal process is unknown. It is regarded as a dual approach for the nonparametric monotone maximum likelihood estimator by Heggland and Lindqvist (2007) and complements their result under the assumption that the form of trend (intensity) function is unknown. We validate our nonparametric estimator through simulation experiments and apply to a field data analysis of a repairable system.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"59 1","pages":"312-333"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.59.312","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67215150","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
PREVENTIVE MAINTENANCE POLICY FOR LINEAR CONSECUTIVE-K-OUT-OF-N: F SYSTEM 线性连续- k - of - n: f系统的预防性维护策略
Journal of the Operations Research Society of Japan Pub Date : 2016-10-01 DOI: 10.15807/JORSJ.59.334
A. Endharta, W. Yun, Hisashi Yamamoto
{"title":"PREVENTIVE MAINTENANCE POLICY FOR LINEAR CONSECUTIVE-K-OUT-OF-N: F SYSTEM","authors":"A. Endharta, W. Yun, Hisashi Yamamoto","doi":"10.15807/JORSJ.59.334","DOIUrl":"https://doi.org/10.15807/JORSJ.59.334","url":null,"abstract":"Linear consecutive- k -out-of- n : F systems are considered. It is assumed that the components are independent and the component failure times follow an exponential distribution with identical failure rate. It is also assumed that there are only two component states (working and failed) and we can know the component state at any time. If there is at least one minimal cut set consisting of one working component, the system will be preventively maintained after a certain time interval. If the system fails before reaching the preventive maintenance (PM) time, the failed components are replaced by the new ones. The optimal PM interval time which minimizes the expected cost rate is obtained. The performance of the proposed policy is evaluated by comparing the expected cost rate of the proposed policy with those of corrective maintenance (CM) and age PM policy.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"59 1","pages":"334-346"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.59.334","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67214844","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
DYNAMIC SOFTWARE AVAILABILITY MODEL WITH REJUVENATION 动态软件可用性模型
Journal of the Operations Research Society of Japan Pub Date : 2016-10-01 DOI: 10.15807/JORSJ.59.270
T. Dohi, H. Okamura
{"title":"DYNAMIC SOFTWARE AVAILABILITY MODEL WITH REJUVENATION","authors":"T. Dohi, H. Okamura","doi":"10.15807/JORSJ.59.270","DOIUrl":"https://doi.org/10.15807/JORSJ.59.270","url":null,"abstract":"In this paper we consider an operational software system with multi-stage degradation levels due to software aging, and derive the optimal dynamic software rejuvenation policy maximizing the steady-state system availability, via the semi-Markov decision process. Also, we develop a reinforcement learning algorithm based on Q-learning as an on-line adaptive nonparametric estimation scheme without the knowledge of transition rate to each degradation level. In numerical examples, we present how to derive the optimal software rejuvenation policy with the decision table, and investigate the asymptotic behavior of estimates of the optimal software rejuvenation policy with the reinforcement learning.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"59 1","pages":"270-290"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.59.270","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67214884","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
PERFORMANCE ANALYSIS OF TASK REPLICATION IN LARGE-SCALE PARALLEL-DISTRIBUTED PROCESSING : AN EXTREME VALUE THEORY APPROACH 大规模并行分布式处理中任务复制的性能分析:一个极值理论方法
Journal of the Operations Research Society of Japan Pub Date : 2016-04-01 DOI: 10.15807/JORSJ.59.174
T. Hirai, H. Masuyama, S. Kasahara, Yutaka Takahashi
{"title":"PERFORMANCE ANALYSIS OF TASK REPLICATION IN LARGE-SCALE PARALLEL-DISTRIBUTED PROCESSING : AN EXTREME VALUE THEORY APPROACH","authors":"T. Hirai, H. Masuyama, S. Kasahara, Yutaka Takahashi","doi":"10.15807/JORSJ.59.174","DOIUrl":"https://doi.org/10.15807/JORSJ.59.174","url":null,"abstract":"In cloud computing, a large-scale parallel-distributed processing service is provided in which a huge task is split into a number of subtasks, which are processed independently on a cluster of machines referred to as workers. Those workers that take longer to process their assigned subtasks result in the processing delay of the task (the issue of stragglers). An efficient way to address this issue is for other workers to execute the troubled subtasks for backup purposes (task replication). In this paper, we evaluate the efficiency of task replication from a theoretical point of view. The mean value and standard deviation of the task-processing time are derived approximately using extreme value theory, while the mean total processing time is evaluated exactly, for cases in which the worker-processing time follows a hyper-exponential, Weibull, or Pareto distribution. The numerical results reveal that the efficiency of task replication depends significantly on the tail of the worker-processing time distribution. In addition, the optimal number of replications which achieves the shortest task-processing time mainly depends on the coefficient of variation of the worker-processing time. Furthermore, three replications are effective to guarantee a low variance of the task-processing time, regardless of the tail.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"59 1","pages":"174-194"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.59.174","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67214444","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}
引用次数: 1
首页 上一页
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学术官方微信