Pub Date : 2022-07-20DOI: 10.1142/s0217595922500269
Song Pu, Chang Xia
{"title":"Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels","authors":"Song Pu, Chang Xia","doi":"10.1142/s0217595922500269","DOIUrl":"https://doi.org/10.1142/s0217595922500269","url":null,"abstract":"","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":"1 1","pages":"2250026:1-2250026:23"},"PeriodicalIF":0.0,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79318081","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}
Pub Date : 2022-07-20DOI: 10.1142/s0217595922500257
Ke-Ju Chen, Songqiao Han, Hailiang Huang, Min Ji
{"title":"A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect","authors":"Ke-Ju Chen, Songqiao Han, Hailiang Huang, Min Ji","doi":"10.1142/s0217595922500257","DOIUrl":"https://doi.org/10.1142/s0217595922500257","url":null,"abstract":"","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":"248 1","pages":"2250025:1-2250025:25"},"PeriodicalIF":0.0,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88968440","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}
Pub Date : 2022-04-26DOI: 10.1142/s0217595922500154
Hongjun Peng, Wenting Sun, Tao Pang
In this paper, we consider a dual-channel farming supply chain with two farmers and one distributor, where agriculture products produced by farmers have different quality levels. Farmers sell high-quality products to supermarkets and normal-quality products to small retail markets, respectively. Three scenarios are investigated: decentralized selling through the distributor to supermarkets (the DD mode); centralized selling through the distributor to supermarkets (the CD mode); centralized selling directly to supermarkets (the CS mode). Under the CS mode, farmers need to bear some extra sale cost such as inventory and transportation cost. We derive farmers’ optimal strategies of production effort and quality investment. It turns out that as farming scale expands, farmers’ production effort decreases, while quality investment increases. Moreover, two farmers’ quality investments are the highest under the CS mode and the least under the DD mode. Further analysis indicates that farmers’ total profits are generally the highest under the CS mode, but farmers obtain the highest profits under the CD mode if farmers’ extra sale cost under the CS mode exceeds a certain level. Therefore, to improve farmers’ welfare and agriculture products’ quality simultaneously, the CS mode may be the best choice in most cases, and it leads to a “win–win” situation for farmers and consumers.
{"title":"Optimal Strategies for A Dual-Channel Farming Supply Chain with Horizontal Competition and Cooperation","authors":"Hongjun Peng, Wenting Sun, Tao Pang","doi":"10.1142/s0217595922500154","DOIUrl":"https://doi.org/10.1142/s0217595922500154","url":null,"abstract":"In this paper, we consider a dual-channel farming supply chain with two farmers and one distributor, where agriculture products produced by farmers have different quality levels. Farmers sell high-quality products to supermarkets and normal-quality products to small retail markets, respectively. Three scenarios are investigated: decentralized selling through the distributor to supermarkets (the DD mode); centralized selling through the distributor to supermarkets (the CD mode); centralized selling directly to supermarkets (the CS mode). Under the CS mode, farmers need to bear some extra sale cost such as inventory and transportation cost. We derive farmers’ optimal strategies of production effort and quality investment. It turns out that as farming scale expands, farmers’ production effort decreases, while quality investment increases. Moreover, two farmers’ quality investments are the highest under the CS mode and the least under the DD mode. Further analysis indicates that farmers’ total profits are generally the highest under the CS mode, but farmers obtain the highest profits under the CD mode if farmers’ extra sale cost under the CS mode exceeds a certain level. Therefore, to improve farmers’ welfare and agriculture products’ quality simultaneously, the CS mode may be the best choice in most cases, and it leads to a “win–win” situation for farmers and consumers.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":"23 1","pages":"2250015:1-2250015:40"},"PeriodicalIF":0.0,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86935844","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}
Pub Date : 2022-04-18DOI: 10.1142/s0217595922500130
Dung K. T. Ha, Canh V. Pham, Huan X. Hoang
The field of Submodular Maximization subject to a Knapsack constraint has recently expanded to a variety of application domains, which is facing some challenges such as data explosions or additional conditions. There exist plenty of objective functions that cannot be evaluated exactly in many real cases unless they are estimated with errors. It leads to solving the problem under noise models. Somewhat surprisingly, Submodular Maximization subject to a Knapsack constraint under Noise models ([Formula: see text]) has never been discussed a lot before. Hence, in this paper, we consider the problem with two kinds of noise models which are addition and multiplication. Inspired by the traditional Greedy algorithm, we first propose a Greedy algorithm under Noises with provable theoretical bounds. In order to find the solution when input data are extremely large, we then devise an efficient streaming algorithm that scans only a single pass over the data and guarantees theoretical approximations. Finally, we conduct some experiments on Influence Maximization problem under knapsack constraint, an instance of [Formula: see text] to show the performances of the proposed algorithms.
{"title":"Submodular Maximization Subject to a Knapsack Constraint Under Noise Models","authors":"Dung K. T. Ha, Canh V. Pham, Huan X. Hoang","doi":"10.1142/s0217595922500130","DOIUrl":"https://doi.org/10.1142/s0217595922500130","url":null,"abstract":"The field of Submodular Maximization subject to a Knapsack constraint has recently expanded to a variety of application domains, which is facing some challenges such as data explosions or additional conditions. There exist plenty of objective functions that cannot be evaluated exactly in many real cases unless they are estimated with errors. It leads to solving the problem under noise models. Somewhat surprisingly, Submodular Maximization subject to a Knapsack constraint under Noise models ([Formula: see text]) has never been discussed a lot before. Hence, in this paper, we consider the problem with two kinds of noise models which are addition and multiplication. Inspired by the traditional Greedy algorithm, we first propose a Greedy algorithm under Noises with provable theoretical bounds. In order to find the solution when input data are extremely large, we then devise an efficient streaming algorithm that scans only a single pass over the data and guarantees theoretical approximations. Finally, we conduct some experiments on Influence Maximization problem under knapsack constraint, an instance of [Formula: see text] to show the performances of the proposed algorithms.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":"292 1","pages":"2250013:1-2250013:26"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76880231","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}
Pub Date : 2022-04-18DOI: 10.1142/s0217595922400139
Juan Zou, Yu-Kang Sui, Jie Gao, Xianzhao Zhang
We consider parallel identical machines scheduling problems with deteriorating maintenance activities and the option of job rejection. Each machine has at most one deteriorating maintenance activity. The length of each maintenance activity increases linearly with its starting time. The location of the maintenance activity on each machine needs to be determined. The goal is to find the sequence of jobs to minimize scheduling cost; we further the model by allowing job rejection. A job is either accepted and processed on one of machines, or rejected. The goal is to determine the sequence of the accepted jobs to minimize scheduling cost of the accepted jobs plus total rejection penalty of the rejected jobs. When the scheduling cost is the makespan, we design a pseudo-polynomial time algorithm, a 2-approximation algorithm and a fully polynomial time approximation scheme. When the scheduling cost is the total completion time, we provide a polynomial time algorithm for the problem. When the scheduling costs are the total weighted completion time under the agreeable ratio assumption and the maximum lateness, we present pseudo-polynomial time algorithms to solve these problems, respectively.
{"title":"Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection","authors":"Juan Zou, Yu-Kang Sui, Jie Gao, Xianzhao Zhang","doi":"10.1142/s0217595922400139","DOIUrl":"https://doi.org/10.1142/s0217595922400139","url":null,"abstract":"We consider parallel identical machines scheduling problems with deteriorating maintenance activities and the option of job rejection. Each machine has at most one deteriorating maintenance activity. The length of each maintenance activity increases linearly with its starting time. The location of the maintenance activity on each machine needs to be determined. The goal is to find the sequence of jobs to minimize scheduling cost; we further the model by allowing job rejection. A job is either accepted and processed on one of machines, or rejected. The goal is to determine the sequence of the accepted jobs to minimize scheduling cost of the accepted jobs plus total rejection penalty of the rejected jobs. When the scheduling cost is the makespan, we design a pseudo-polynomial time algorithm, a 2-approximation algorithm and a fully polynomial time approximation scheme. When the scheduling cost is the total completion time, we provide a polynomial time algorithm for the problem. When the scheduling costs are the total weighted completion time under the agreeable ratio assumption and the maximum lateness, we present pseudo-polynomial time algorithms to solve these problems, respectively.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":"22 1","pages":"2240013:1-2240013:23"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75411648","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}
Pub Date : 2022-04-17DOI: 10.1142/s0217595922500178
Henanbei Huang, Nuo Qi, Xin He Miao
{"title":"A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones","authors":"Henanbei Huang, Nuo Qi, Xin He Miao","doi":"10.1142/s0217595922500178","DOIUrl":"https://doi.org/10.1142/s0217595922500178","url":null,"abstract":"","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":"7 1","pages":"2250017:1-2250017:18"},"PeriodicalIF":0.0,"publicationDate":"2022-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73128117","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：