Pub Date : 2023-06-30DOI: 10.1142/s0217595923500227
Zhenzhen Jia, Weimin Dai, Jianqiang Hu
We consider a type of correlated queue in which the inter-arrival time between two consecutive customers linearly depends on the service time of the first customer. We first derive infinite systems of linear equations for the moments of the waiting time in two special cases, based on which we then develop several methods to calculate the moments of the waiting time by using MacLaurin series approximation, Padé approximation and truncation method. In addition, we show how the moments and covariances of the inter-departure times of the correlated queue can be calculated based on the moments of the waiting time. Finally, extensive numerical examples are provided to validate our methods.
{"title":"Correlated Queues with Inter-Arrival Times Depending on Service Times","authors":"Zhenzhen Jia, Weimin Dai, Jianqiang Hu","doi":"10.1142/s0217595923500227","DOIUrl":"https://doi.org/10.1142/s0217595923500227","url":null,"abstract":"We consider a type of correlated queue in which the inter-arrival time between two consecutive customers linearly depends on the service time of the first customer. We first derive infinite systems of linear equations for the moments of the waiting time in two special cases, based on which we then develop several methods to calculate the moments of the waiting time by using MacLaurin series approximation, Padé approximation and truncation method. In addition, we show how the moments and covariances of the inter-departure times of the correlated queue can be calculated based on the moments of the waiting time. Finally, extensive numerical examples are provided to validate our methods.","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45136707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-30DOI: 10.1142/s0217595923400171
Lili Zuo, Lingfa Lu, Liqi Zhang
In this paper, we consider the single machine scheduling with rejection and a non-availability interval. Two types of non-availability intervals are studied, namely the machine non-availability (MNA) intervals and the operator non-availability (ONA) intervals. The objective is to minimize the sum of the maximum delivery completion time of accepted jobs and the total rejection cost of rejected jobs. For these two problems, a pseudo-polynomial-time dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS) are proposed, respectively.
{"title":"Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost","authors":"Lili Zuo, Lingfa Lu, Liqi Zhang","doi":"10.1142/s0217595923400171","DOIUrl":"https://doi.org/10.1142/s0217595923400171","url":null,"abstract":"In this paper, we consider the single machine scheduling with rejection and a non-availability interval. Two types of non-availability intervals are studied, namely the machine non-availability (MNA) intervals and the operator non-availability (ONA) intervals. The objective is to minimize the sum of the maximum delivery completion time of accepted jobs and the total rejection cost of rejected jobs. For these two problems, a pseudo-polynomial-time dynamic programming algorithm and a fully polynomial-time approximation scheme (FPTAS) are proposed, respectively.","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48494367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-16DOI: 10.1142/s0217595923500240
M. Tutam, John A. White
{"title":"Comparison of Expected Distances in Traditional and Non-Traditional Layouts","authors":"M. Tutam, John A. White","doi":"10.1142/s0217595923500240","DOIUrl":"https://doi.org/10.1142/s0217595923500240","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48371308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-02DOI: 10.1142/s021759592340016x
Zhanghao Yao, Yukun Cheng, Jinmian Chen, Xueli Cui
{"title":"Game-Theoretic Analysis for Green R&D Investment Strategies in the Vehicle Market","authors":"Zhanghao Yao, Yukun Cheng, Jinmian Chen, Xueli Cui","doi":"10.1142/s021759592340016x","DOIUrl":"https://doi.org/10.1142/s021759592340016x","url":null,"abstract":"","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46242092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-02DOI: 10.1142/s0217595923400158
Z. Gao, Yongtang Shi, Changqing Xi, Jun Yue
,
，
{"title":"The extended dominating set in graphs","authors":"Z. Gao, Yongtang Shi, Changqing Xi, Jun Yue","doi":"10.1142/s0217595923400158","DOIUrl":"https://doi.org/10.1142/s0217595923400158","url":null,"abstract":",","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43990705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-27DOI: 10.1142/s0217595923500082
Hossein Moghaddaszadeh, M. Ranjbar, N. Jamili
In this paper, we study the well-known resource availability cost problem with stochastic resource availability. The objective is to determine the initial levels of all renewable resources and establish a schedule corresponding to each scenario such that the expected resource availability cost is minimized. We assume that resource shortfalls can be compensated externally but at a noticeable higher cost. We formulate the problem as a two-stage stochastic programming model (TSSPM). We also develop an exact decomposition-based algorithm (DBA) for the particular case of the problem with at most two resources, which also functions as a heuristic for the original problem. Since the number of scenarios influences the performance of the developed solution approaches, we utilize a fast scenario reduction method to reduce the number of scenarios. Computational results indicate that the DBA outperforms the TSSPM formulation in solution quality and CPU runtime.
{"title":"Minimizing the Expected Renewable Resource Costs in a Project with Stochastic Resource Availability","authors":"Hossein Moghaddaszadeh, M. Ranjbar, N. Jamili","doi":"10.1142/s0217595923500082","DOIUrl":"https://doi.org/10.1142/s0217595923500082","url":null,"abstract":"In this paper, we study the well-known resource availability cost problem with stochastic resource availability. The objective is to determine the initial levels of all renewable resources and establish a schedule corresponding to each scenario such that the expected resource availability cost is minimized. We assume that resource shortfalls can be compensated externally but at a noticeable higher cost. We formulate the problem as a two-stage stochastic programming model (TSSPM). We also develop an exact decomposition-based algorithm (DBA) for the particular case of the problem with at most two resources, which also functions as a heuristic for the original problem. Since the number of scenarios influences the performance of the developed solution approaches, we utilize a fast scenario reduction method to reduce the number of scenarios. Computational results indicate that the DBA outperforms the TSSPM formulation in solution quality and CPU runtime.","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46618454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：