Asia Pac. J. Oper. Res.最新文献_第2页

Due-Window Assignment Methods and Scheduling with Generalized Positional-Dependent Weights 具有广义位置相关权值的准窗口分配方法和调度

Asia Pac. J. Oper. Res. Pub Date : 2022-07-29 DOI: 10.1142/s0217595922500282

Ji-Bo Wang, Si-han Wang, Kaipeng Cao, Mengqi Liu, Xue Jia

引用次数: 2

Sufficient Optimality Conditions for a Robust Multiobjective Problem 鲁棒多目标问题的充分最优性条件

Asia Pac. J. Oper. Res. Pub Date : 2022-07-29 DOI: 10.1142/s0217595922500270

N. Gadhi, Mohamed Ohda

引用次数: 0

Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels 电子商务与线上到线下包裹整合配送优化的精确方法

Asia Pac. J. Oper. Res. Pub Date : 2022-07-20 DOI: 10.1142/s0217595922500269

Song Pu, Chang Xia

引用次数: 0

A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect 具有可控学习效果的组相关到期窗口分配调度问题

Asia Pac. J. Oper. Res. Pub Date : 2022-07-20 DOI: 10.1142/s0217595922500257

Ke-Ju Chen, Songqiao Han, Hailiang Huang, Min Ji

引用次数: 1

Improved Kemeny Median Indicator Ranks Accordance Method 改进的Kemeny指标中位数排序法

Asia Pac. J. Oper. Res. Pub Date : 2022-07-08 DOI: 10.1142/s0217595922500245

M. Soltanifar

引用次数: 1

Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects 具有时滞窗分配和劣化效应的调度问题求解方法

Asia Pac. J. Oper. Res. Pub Date : 2022-06-24 DOI: 10.1142/s0217595922500221

Fei Teng, Simei Luo, Dan-Yang Lv, Ji-Bo Wang

引用次数: 1

Optimal Strategies for A Dual-Channel Farming Supply Chain with Horizontal Competition and Cooperation 横向竞争与合作的双渠道农业供应链优化策略

Asia Pac. J. Oper. Res. Pub Date : 2022-04-26 DOI: 10.1142/s0217595922500154

Hongjun Peng, Wenting Sun, Tao Pang

{"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":null,"pages":null},"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}

引用次数: 0

Submodular Maximization Subject to a Knapsack Constraint Under Noise Models 噪声模型下背包约束下的子模最大化

Asia Pac. J. Oper. Res. Pub Date : 2022-04-18 DOI: 10.1142/s0217595922500130

Dung K. T. Ha, Canh V. Pham, Huan X. Hoang

{"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":null,"pages":null},"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}

引用次数: 1

Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection 具有退化维护活动和作业拒绝的并行机器调度

Asia Pac. J. Oper. Res. Pub Date : 2022-04-18 DOI: 10.1142/s0217595922400139

Juan Zou, Yu-Kang Sui, Jie Gao, Xianzhao Zhang

{"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":null,"pages":null},"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}

引用次数: 1

A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones 一类带圆锥体的不等式系统的非单调光滑型算法

Asia Pac. J. Oper. Res. Pub Date : 2022-04-17 DOI: 10.1142/s0217595922500178

Henanbei Huang, Nuo Qi, Xin He Miao

引用次数: 0