Subjects -> MATHEMATICS (Total: 1013 journals)
    - APPLIED MATHEMATICS (92 journals)
    - GEOMETRY AND TOPOLOGY (23 journals)
    - MATHEMATICS (714 journals)
    - MATHEMATICS (GENERAL) (45 journals)
    - NUMERICAL ANALYSIS (26 journals)
    - PROBABILITIES AND MATH STATISTICS (113 journals)

MATHEMATICS (714 journals)                  1 2 3 4 | Last

Showing 1 - 200 of 538 Journals sorted alphabetically
Abakós     Open Access   (Followers: 4)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 2)
Accounting Perspectives     Full-text available via subscription   (Followers: 4)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 13)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 5)
ACM Transactions on Mathematical Software (TOMS)     Hybrid Journal   (Followers: 6)
ACS Applied Materials & Interfaces     Hybrid Journal   (Followers: 43)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 2)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 3)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 5)
Acta Mathematica Vietnamica     Hybrid Journal  
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal  
Advanced Science Letters     Full-text available via subscription   (Followers: 9)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 6)
Advances in Catalysis     Full-text available via subscription   (Followers: 7)
Advances in Complex Systems     Hybrid Journal   (Followers: 10)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 16)
Advances in Decision Sciences     Open Access   (Followers: 4)
Advances in Difference Equations     Open Access   (Followers: 3)
Advances in Fixed Point Theory     Open Access  
Advances in Geosciences (ADGEO)     Open Access   (Followers: 20)
Advances in Linear Algebra & Matrix Theory     Open Access   (Followers: 6)
Advances in Materials Science     Open Access   (Followers: 21)
Advances in Mathematical Physics     Open Access   (Followers: 6)
Advances in Mathematics     Full-text available via subscription   (Followers: 18)
Advances in Numerical Analysis     Open Access   (Followers: 4)
Advances in Operations Research     Open Access   (Followers: 13)
Advances in Operator Theory     Hybrid Journal  
Advances in Pure Mathematics     Open Access   (Followers: 10)
Advances in Science and Research (ASR)     Open Access   (Followers: 9)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2)
African Journal of Educational Studies in Mathematics and Sciences     Full-text available via subscription   (Followers: 8)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 5)
Afrika Matematika     Hybrid Journal   (Followers: 2)
Air, Soil & Water Research     Open Access   (Followers: 6)
AKSIOMATIK : Jurnal Penelitian Pendidikan dan Pembelajaran Matematika     Open Access  
Al-Jabar : Jurnal Pendidikan Matematika     Open Access  
Al-Qadisiyah Journal for Computer Science and Mathematics     Open Access   (Followers: 3)
AL-Rafidain Journal of Computer Sciences and Mathematics     Open Access   (Followers: 4)
Algebra and Logic     Hybrid Journal   (Followers: 9)
Algebra Colloquium     Hybrid Journal   (Followers: 3)
Algebra Universalis     Hybrid Journal   (Followers: 3)
Algorithmic Operations Research     Open Access   (Followers: 6)
Algorithms     Open Access   (Followers: 14)
Algorithms Research     Open Access   (Followers: 1)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 4)
American Journal of Mathematical Analysis     Open Access   (Followers: 1)
American Journal of Mathematical and Management Sciences     Hybrid Journal  
American Journal of Mathematics     Full-text available via subscription   (Followers: 7)
American Journal of Operations Research     Open Access   (Followers: 6)
American Mathematical Monthly     Full-text available via subscription   (Followers: 3)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 12)
Analele Universitatii Ovidius Constanta - Seria Matematica     Open Access  
Analysis and Applications     Hybrid Journal   (Followers: 2)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 7)
Anargya : Jurnal Ilmiah Pendidikan Matematika     Open Access  
Annales Mathematicae Silesianae     Open Access  
Annales mathématiques du Québec     Hybrid Journal   (Followers: 3)
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica     Open Access   (Followers: 1)
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica     Open Access  
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 15)
Annals of Functional Analysis     Hybrid Journal   (Followers: 2)
Annals of Mathematics     Full-text available via subscription   (Followers: 5)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 13)
Annals of PDE     Hybrid Journal  
Annals of Pure and Applied Logic     Open Access   (Followers: 5)
Annals of the Alexandru Ioan Cuza University - Mathematics     Open Access   (Followers: 1)
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1)
Annals of West University of Timisoara - Mathematics     Open Access   (Followers: 1)
Annals of West University of Timisoara - Mathematics and Computer Science     Open Access   (Followers: 2)
Annuaire du Collège de France     Open Access   (Followers: 6)
ANZIAM Journal     Open Access   (Followers: 1)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 3)
Applications of Mathematics     Hybrid Journal   (Followers: 3)
Applied Categorical Structures     Hybrid Journal   (Followers: 5)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 16)
Applied Mathematics     Open Access   (Followers: 6)
Applied Mathematics     Open Access   (Followers: 6)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 7)
Applied Mathematics - A Journal of Chinese Universities     Hybrid Journal   (Followers: 1)
Applied Mathematics and Nonlinear Sciences     Open Access   (Followers: 1)
Applied Mathematics Letters     Full-text available via subscription   (Followers: 3)
Applied Mathematics Research eXpress     Hybrid Journal   (Followers: 1)
Applied Network Science     Open Access   (Followers: 3)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 4)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 5)
Arab Journal of Mathematical Sciences     Open Access   (Followers: 3)
Arabian Journal of Mathematics     Open Access   (Followers: 1)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
Armenian Journal of Mathematics     Open Access  
Arnold Mathematical Journal     Hybrid Journal   (Followers: 1)
Artificial Satellites     Open Access   (Followers: 21)
Asia-Pacific Journal of Operational Research     Hybrid Journal   (Followers: 3)
Asian Journal of Algebra     Open Access   (Followers: 1)
Asian Research Journal of Mathematics     Open Access  
Asian-European Journal of Mathematics     Hybrid Journal   (Followers: 2)
Australian Mathematics Teacher, The     Full-text available via subscription   (Followers: 7)
Australian Primary Mathematics Classroom     Full-text available via subscription   (Followers: 5)
Australian Senior Mathematics Journal     Full-text available via subscription   (Followers: 1)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Axioms     Open Access   (Followers: 1)
Baltic International Yearbook of Cognition, Logic and Communication     Open Access   (Followers: 2)
Banach Journal of Mathematical Analysis     Hybrid Journal  
Basin Research     Hybrid Journal   (Followers: 6)
BIBECHANA     Open Access  
Biomath     Open Access  
BIT Numerical Mathematics     Hybrid Journal  
Boletim Cearense de Educação e História da Matemática     Open Access  
Boletim de Educação Matemática     Open Access  
Boletín de la Sociedad Matemática Mexicana     Hybrid Journal  
Bollettino dell'Unione Matematica Italiana     Full-text available via subscription  
British Journal for the History of Mathematics     Hybrid Journal   (Followers: 2)
British Journal of Mathematical and Statistical Psychology     Full-text available via subscription   (Followers: 18)
British Journal of Mathematics & Computer Science     Full-text available via subscription   (Followers: 1)
Buletinul Academiei de Stiinte a Republicii Moldova. Matematica     Open Access   (Followers: 2)
Bulletin des Sciences Mathamatiques     Full-text available via subscription   (Followers: 3)
Bulletin of Dnipropetrovsk University. Series : Communications in Mathematical Modeling and Differential Equations Theory     Open Access   (Followers: 3)
Bulletin of Mathematical Sciences     Open Access   (Followers: 1)
Bulletin of Symbolic Logic     Full-text available via subscription   (Followers: 4)
Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics     Open Access  
Bulletin of the Australian Mathematical Society     Full-text available via subscription   (Followers: 2)
Bulletin of the Brazilian Mathematical Society, New Series     Hybrid Journal  
Bulletin of the Iranian Mathematical Society     Hybrid Journal  
Bulletin of the London Mathematical Society     Hybrid Journal   (Followers: 3)
Bulletin of the Malaysian Mathematical Sciences Society     Hybrid Journal  
Cadernos do IME : Série Matemática     Open Access  
Calculus of Variations and Partial Differential Equations     Hybrid Journal   (Followers: 1)
Canadian Journal of Mathematics / Journal canadien de mathématiques     Hybrid Journal  
Canadian Journal of Science, Mathematics and Technology Education     Hybrid Journal   (Followers: 20)
Canadian Mathematical Bulletin     Hybrid Journal  
Carpathian Mathematical Publications     Open Access  
Catalysis in Industry     Hybrid Journal  
CAUCHY     Open Access   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 5)
CHANCE     Hybrid Journal   (Followers: 5)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 1)
Chaos, Solitons & Fractals : X     Open Access   (Followers: 1)
ChemSusChem     Hybrid Journal   (Followers: 8)
Chinese Annals of Mathematics, Series B     Hybrid Journal  
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Mathematics     Open Access  
Ciencia     Open Access  
CODEE Journal     Open Access  
Cogent Mathematics     Open Access   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 3)
Collectanea Mathematica     Hybrid Journal  
College Mathematics Journal     Hybrid Journal   (Followers: 3)
COMBINATORICA     Hybrid Journal  
Combinatorics, Probability and Computing     Hybrid Journal   (Followers: 5)
Combustion Theory and Modelling     Hybrid Journal   (Followers: 20)
Commentarii Mathematici Helvetici     Hybrid Journal   (Followers: 1)
Communications in Combinatorics and Optimization     Open Access  
Communications in Contemporary Mathematics     Hybrid Journal  
Communications in Mathematical Physics     Hybrid Journal   (Followers: 3)
Communications On Pure & Applied Mathematics     Hybrid Journal   (Followers: 6)
Complex Analysis and its Synergies     Open Access   (Followers: 1)
Complex Variables and Elliptic Equations: An International Journal     Hybrid Journal  
Compositio Mathematica     Full-text available via subscription   (Followers: 2)
Comptes Rendus : Mathematique     Open Access  
Computational and Applied Mathematics     Hybrid Journal   (Followers: 3)
Computational and Mathematical Methods     Hybrid Journal  
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 5)
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 11)
Computational Methods and Function Theory     Hybrid Journal  
Computational Optimization and Applications     Hybrid Journal   (Followers: 9)
Computers & Mathematics with Applications     Full-text available via subscription   (Followers: 10)
Confluentes Mathematici     Hybrid Journal  
Constructive Mathematical Analysis     Open Access  
Contributions to Discrete Mathematics     Open Access  
Contributions to Game Theory and Management     Open Access  
COSMOS     Hybrid Journal   (Followers: 1)
Cross Section     Full-text available via subscription   (Followers: 1)
Cryptography and Communications     Hybrid Journal   (Followers: 11)
Cuadernos de Investigación y Formación en Educación Matemática     Open Access  
Cubo. A Mathematical Journal     Open Access  
Current Research in Biostatistics     Open Access   (Followers: 8)
Czechoslovak Mathematical Journal     Hybrid Journal  
Daya Matematis : Jurnal Inovasi Pendidikan Matematika     Open Access  
Demographic Research     Open Access   (Followers: 14)
Design Journal : An International Journal for All Aspects of Design     Hybrid Journal   (Followers: 35)
Desimal : Jurnal Matematika     Open Access  
Dhaka University Journal of Science     Open Access  
Differential Equations and Dynamical Systems     Hybrid Journal   (Followers: 2)
Differentsial'nye Uravneniya     Open Access  
Digital Experiences in Mathematics Education     Hybrid Journal   (Followers: 3)
Discrete Mathematics     Hybrid Journal   (Followers: 7)
Discrete Mathematics & Theoretical Computer Science     Open Access   (Followers: 1)
Discrete Mathematics, Algorithms and Applications     Hybrid Journal   (Followers: 2)
Discussiones Mathematicae - General Algebra and Applications     Open Access  
Discussiones Mathematicae Graph Theory     Open Access   (Followers: 1)
Diskretnaya Matematika     Full-text available via subscription  
Doklady Akademii Nauk     Open Access  

        1 2 3 4 | Last

Similar Journals
Journal Cover
Asia-Pacific Journal of Operational Research
Journal Prestige (SJR): 0.477
Citation Impact (citeScore): 1
Number of Followers: 3  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0217-5959 - ISSN (Online) 1793-7019
Published by World Scientific Homepage  [121 journals]
  • Copositivity of Three-Dimensional Symmetric Tensors

    • Free pre-print version: Loading...

      Authors: Liqun Qi, Yisheng Song, Xinzhen Zhang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we seek analytically checkable necessary and sufficient condition for copositivity of a three-dimensional symmetric tensor. We first show that for a general third-order three-dimensional symmetric tensor, checking copositivity is equivalent to solving a quartic equation and some quadratic equations. All of them can be solved analytically. Thus, we present an analytical way to check copositivity of a third-order three-dimensional symmetric tensor. Then, we consider a model of vacuum stability for [math] scalar dark matter. This is a special fourth-order three-dimensional symmetric tensor. We show that an analytically expressed necessary and sufficient condition for this model bounded from below can be given, by using a result given by Ulrich and Watson in 1994.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-11-28T08:00:00Z
      DOI: 10.1142/S0217595922500324
       
  • A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities
           Associated with Circular Cones

    • Free pre-print version: Loading...

      Authors: He Huang, Nuo Qi, Xin-He Miao
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we consider a system of inequalities associated with circular cones. By constructing a new smoothing function, the problem is reformulated as a system of parameterized smooth equations. In addition, we suggest a Newton-type algorithm for solving the smooth equations so that a solution of the problem concerned is found. In particular, the algorithm is proved to be globally and locally quadratically convergent under suitable conditions. The preliminary numerical results demonstrate that the algorithm is effective.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-11-22T08:00:00Z
      DOI: 10.1142/S0217595922500178
       
  • Exact Approach for Integrated Delivery Optimization of E-Commerce and
           Online-to-Offline Parcels

    • Free pre-print version: Loading...

      Authors: Song Pu, Chang Xia
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This paper studies a novel form of last-mile delivery that combines delivery optimization of E-commerce and Online-to-Offline (O2O) parcels. While O2O parcels must first be picked up from O2O shops before being delivered to the appropriate customers, E-commerce parcels are delivered to customers from a predetermined number of depots. The goal is to use the same fleet of vehicles to provide integrated delivery services for various merchant types. We propose a branch-and-price algorithm based on the set partitioning formulation, where the pricing problem is solved by a label-setting algorithm. Several acceleration techniques including elementary path relaxation, ng-path relaxation and decremental space search are designed to speed up the price problem. Both the conventional dataset used in the literature and a real-world database with up to 75 clients are utilized to test the performance of the suggested method, demonstrating its efficacy.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-11-22T08:00:00Z
      DOI: 10.1142/S0217595922500269
       
  • Effects of Accrual Rates in Cooperative Advertising Programs for Channel
           Members with Risk Preferences

    • Free pre-print version: Loading...

      Authors: Bin Liu, Dong Liang, Feimin Zhong, Jinxing Xie
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Cooperative advertising (coop-ad) programs with both accrual rates and participation rates are popularly adopted in practice by manufacturers and retailers to share advertising expenditures. However, results from extant literature show that the accrual rates always negatively impact the manufacturers’ performances, indicating a gap between theory and practice. In this paper, we study a coop-ad program in a distribution channel consisting of a manufacturer and a retailer with risk preferences under demand uncertainty. When both the channel members are risk-neutral, we show that an elaborately specified accrual rate can help reach channel coordination, although the accrual rate always negatively impacts the manufacturer’s performance. When the manufacturer is risk-averse and the retailer is risk-neutral, the accrual rate may positively impact the manufacturer’s performance, and in particular, the manufacturer does prefer a coop-ad program with an accrual rate if his risk-averse level is high and/or the demand volatility is high. When both the channel members are risk-averse, numerical examples illustrate that an accrual rate may benefit both members when the retailer has high profitability and low risk-averse level. These findings, seemingly never reported in the literature, provide plausible explanations for the fact that accrual rates are usually included in coop-ad programs in real-world practice.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-26T07:00:00Z
      DOI: 10.1142/S0217595922500385
       
  • Inventory Management with Advance Supply Contracts Across Multiple
           Replenishment Periods

    • Free pre-print version: Loading...

      Authors: Mazhar Arikan, Sercan Demir, Murat Erkoc
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we study optimal procurement policies with advance contracting option over a finite multi-period horizon for a seasonal product. In this setting, each period is defined by the time between two consecutive inventory replenishment stages where demand is not stationary across periods. Demand for the product in each period is stochastic whose probabilistic distribution is a function of the market signal received right before the beginning of the selling season. The firm receives price discounts by making quantity contracts in advance of the selling season and thus, before the realization of the market signal. Replenishment costs vary across periods during the selling season. We investigate optimal combination of advance contracting and expedited replenishment policies using stochastic dynamic programming. Our research is primarily motivated by applications in the cruise line industry where contracts are made before the final number of bookings is realized and additional purchases can be made at ports of call with varying local prices. Our results show that optimal replenishment policies follow order-up-to policies and there is a unique advance contract amount that minimizes the expected costs over the planning horizon. We provide a numerical sensitivity analysis to investigate the effects of replenishment prices, demand volatility, and disparity between periods in terms of demand on the advance contract amount, replenishments from the spot markets, service levels, and the overall expected cost.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-17T07:00:00Z
      DOI: 10.1142/S0217595922500312
       
  • Efficiency Evaluation of Two-Stage Supply Chains with Loss Aversion using
           the Dea-Based Cooperative Approach

    • Free pre-print version: Loading...

      Authors: Yuanyuan Zhao, Lei Fang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Most supply chains in reality are composed of multiple enterprises which are independent individuals in terms of organizational structures and operating modes. From the perspective of performance evaluation, optimizing each enterprise’s efficiency independently will probably result in undesired inventory of intermediate products in the supply chain. Taking the two-stage supply chain where the outputs from the upstream supplier are taken as the inputs for the downstream manufacturer as an example, this paper introduces enterprises’ relative dominance into allocating the responsibility of inventory management between two decentralized enterprises. To motivate these enterprises to adopt the allocation strategy, this paper takes the loss aversion of enterprises into account to reveal the utility subjectively perceived by each decentralized enterprise insisting on independence instead of cooperation. Subsequently, a DEA-based cooperative model is developed to readjust the production processes of two decentralized enterprises. We find that adjusting the relevant parameters is able to explore the relationship between the proposed model and the non-cooperative model and the relationship between the proposed model and the centralized model. Finally, a practical example of coordinating sustainable supply chains is applied to illustrate the effectiveness of the proposed model.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-17T07:00:00Z
      DOI: 10.1142/S0217595922500397
       
  • Improved Kemeny Median Indicator Ranks Accordance Method

    • Free pre-print version: Loading...

      Authors: Mehdi Soltanifar
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Multi-attribute decision-making (MADM) methods are widely used by decision makers as decision support tools. Most MADM methods have shortcomings in the solution process that combined with other decision making methods can eliminate these shortcomings or improve the performance of the method. One of the methods that can be used to improve MADM methods is preferential voting, which is actually a linear programming (LP) model with weight restrictions. The Kemeny Median Indicator Ranks Accordance (KEMIRA) is one of the most modern MADM methods; in this paper, we provide an improved version in this relative, by utilizing the concept of preferential voting. The new model, in being implemented on a real-world problem, will be compared to the previous method and ultimately some of its advantages will be rendered.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-13T07:00:00Z
      DOI: 10.1142/S0217595922500245
       
  • A Group-Dependent Due Window Assignment Scheduling Problem with
           Controllable Learning Effect

    • Free pre-print version: Loading...

      Authors: Ke Chen, Songqiao Han, Hailiang Huang, Min Ji
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we study a single machine scheduling problem with group-dependent due window assignment and further incorporate autonomous and induced learning effects. Here, autonomous learning refers to learning by doing, while induced learning denotes that proactive investments can promote the learning effect, i.e., the learning effect is controllable. The proactive spending could include any management efforts like professional training programs, among others. The objective is to find optimal strategies of due window assignments, sequence of groups and jobs, and level of induced learning that optimize the total cost comprising the due window-related penalty costs and the investment cost. We present a polynomial-time algorithm capable of solving this problem and an improved idea to further reduce the time complexity. In addition, a detailed numerical example is conducted. Our study shows that the learning effect can be tuned to fit the demand of the manufacturing system better and lead to a more flexible operating system.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-13T07:00:00Z
      DOI: 10.1142/S0217595922500257
       
  • Multicriteria ABC Inventory Classification Using a Group Decision Making
           Method with Individual Preferences

    • Free pre-print version: Loading...

      Authors: Yang Xu, Yelin Fu, Yu Chen, Kin Keung Lai
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This paper proposes a group decision making model with individual preferences to investigate the multicriteria ABC inventory classification problem. We first propose a preliminary group decision matrix by means of identifying the individual preference among the classification criteria as a typical decision maker; then analyze the endogenous individual preference structure in terms of exploring the preferential difference and preferential priority, a revised group decision matrix is therefore presented; thirdly, make the use of SMAA-2 to derive the holistic acceptability index for classifying the SKUs. A satisfaction index is developed to manifest the merits of proposed method. A numerical illustration using the data drawn from previous studies is performed to indicate the applicability and feasibility of our method.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-13T07:00:00Z
      DOI: 10.1142/S0217595922500361
       
  • Sufficient Optimality Conditions for a Robust Multiobjective Problem

    • Free pre-print version: Loading...

      Authors: Nazih Abderrazzak Gadhi, Mohamed Ohda
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this note, we establish sufficient optimality conditions in terms of upper convexificators for a robust multiobjective optimization problem (UCP) involving nonsmooth/nonconvex real-valued functions. For this purpose, two kinds of generalized convex functions are defined in terms of upper convexificators.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-03T07:00:00Z
      DOI: 10.1142/S0217595922500270
       
  • The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex
           Weights

    • Free pre-print version: Loading...

      Authors: Tran Hoai Ngoc Nhan, Kien Trung Nguyen, Huong Nguyen-Thu
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      The classical reverse 1-median problem on trees is to adjust the edge lengths within a budget so as to reduce the 1-median function at a predetermined vertex as much as possible. This paper concerns the corresponding problem with uncertain vertex weights presented by linear functions. Moreover, we use the minmax regret criterion to measure the maximum loss of a feasible solution with respect to the worst-case scenario. The regarding problem is called the minmax regret reverse 1-median problem on trees. We first partition the set of scenarios into parts such that the optimal solution of the corresponding reverse 1-median problem does not change in each part. Then the problem can be reformulated as the minimization of a quadratic number of affine linear functions. We finally develop a greedy algorithm that solves the problem in [math] time where [math] is the number of vertices in the underlying tree.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-03T07:00:00Z
      DOI: 10.1142/S0217595922500336
       
  • A Composite Indicator Methodology to Rank National Olympic Committees

    • Free pre-print version: Loading...

      Authors: Yang Xu, Yelin Fu, Kin Keung Lai
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This paper proposes a composite indicator methodology to rank National Olympic Committees (NOCs) by considering only the medals won at both Summer and Winter Olympic games. The lexicographic and sum ranking systems at both Summer and Winter Olympics are comprehensively investigated to create the preliminary decision matrix for constructing composite indicators. Then we investigate the preferential difference and preferential priority for better reflecting the preference structures of the sub-indicators, and thereby obtain a revised decision matrix. The SMAA-2 is employed to implement the composite indicator construction based upon the revised decision matrix. An empirical study is performed to demonstrate the applicability of our methodology, using the data set that is composed of 28 NOCs who have participated in both the Rio 2016 Summer Olympic Games and the PyeongChang 2018 Winter Olympics. The Spearman’s rank correlation coefficient and the satisfaction index are calculated to justify the merits of the proposed methodology.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-10-03T07:00:00Z
      DOI: 10.1142/S021759592250035X
       
  • Due-Window Assignment Methods and Scheduling with Generalized
           Positional-Dependent Weights

    • Free pre-print version: Loading...

      Authors: Ji-Bo Wang, Si-Han Wang, Kaipeng Cao, Mengqi Liu, Xue Jia
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      We focus on a single-machine scheduling problem with common and slack due-window assignment methods. Both the job sequence and due-windows are decision variables to be determined by the decision maker. We consider the following performance criterion: the total weighted number of early and late jobs plus the total weighted of earliness, tardiness and due-window assignment cost, where the weights depend on the position in which a job is scheduled. Some properties are established, and it is shown that the problem can be solved in [math] time, where [math] is the number of jobs. The extensions of the model are to cases of general position-dependent processing times and time-dependent processing times.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-09-28T07:00:00Z
      DOI: 10.1142/S0217595922500282
       
  • Joint Optimization of Multiple Supply Chains Under Cap-And-Trade
           Regulation: A Bi-Level Programming Model and Solution Algorithm

    • Free pre-print version: Loading...

      Authors: Akram Esmaeili Avval, Farzad Dehghanian, Mohammadali Pirayesh
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Among the carbon regulation policy schemes, the cap-and-trade has received more attention because of its efficiency and flexibility. Two primary challenges with the cap-and-trade scheme are determining the correct cap and carbon trading price in the carbon market. This paper presents a bi-level model to investigate these two challenges in the cap-and-trade scheme formed between multiple supply chains and the government. At the first level, the government minimizes the cap in such a way that the costs of the supply chains do not rise too much. At the second level, the supply chains minimize their costs according to their cap and trade the dedicated allowances. An exact and a heuristic method are developed to solve the bi-level model. The computational results on a set of randomly generated instances show the effectiveness of the presented heuristic. Sensitivity analysis demonstrates that the government should choose proper amounts of caps to balance costs and environmental benefits.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-09-05T07:00:00Z
      DOI: 10.1142/S0217595922500191
       
  • An Implementable Augmented Lagrangian Method for Solving Second-Order Cone
           Constrained Variational Inequalities

    • Free pre-print version: Loading...

      Authors: Yining Sun, Li Wang, Juhe Sun, Bin Wang, Yanhong Yuan
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we construct an implementable augmented Lagrangian method to solve second-order cone constrained variational inequalities (SOCCVI) problem. By considering a special optimization problem that has the same solution as the SOCCVI problem, we obtain different equivalent transformation forms of the SOCCVI problem. Using the equivalent transformation forms and the properties of the projection operators, the augmented Lagrangian method can be established and its global convergence is proved. The inexact Newton method is used to solve the inner problems which arise from the augmented Lagrangian method for solving the numerical examples. Numerical results for three examples are reported to verify the effectiveness of the augmented Lagrangian method for obtaining approximate solutions.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-09-05T07:00:00Z
      DOI: 10.1142/S0217595922500300
       
  • Replenishment Policy with Limited Price Information

    • Free pre-print version: Loading...

      Authors: Xiaoyue Zhang, Wenqiang Dai, Xiaoqiang Cai, Xiaoyu Zhou
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we seek to provide real-time replenishment policy for a capacitated company that faces an exogenous demand and has to procure and store sufficient quantities of certain items with uncertain procurement prices. The objective is to minimize the total cost of the procuring cost and inventory holding cost without stock out. Motivated by the fact that a large variability in the price process often makes forecasting difficult, in contrast to the traditional approaches of the stochastic inventory theory, we study this problem from the perspective of competitive analysis who is free of any price distribution assumption. We propose an online replenishment model, which generalizes several previous online models. We give a real-time replenishment policy whose decisions are made based entirely on the past and present prices and the current inventory level. We prove that our policy achieves superior performance, and outperforms all of the previous theoretical results. Furthermore, we present the numerical studies to show that our replenishment policy achieves an even better empirical performance.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-08-26T07:00:00Z
      DOI: 10.1142/S0217595922500294
       
  • Optimality Conditions for E-Convex Interval-Valued Programming Problem
           Using gH-Symmetrical Derivative

    • Free pre-print version: Loading...

      Authors: Sachin Rastogi, Akhlad Iqbal, Sanjeev Rajan
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Taking into consideration gH-symmetrical derivative, we discuss Fritz John type optimality conditions for E-convex functions in interval-valued optimization problems. By a suitable example, we show that gH-symmetrical derivative is an extension of gH-derivative. We use LU type of order relation in this context.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-07-29T07:00:00Z
      DOI: 10.1142/S0217595922500117
       
  • Approaches to Solving Scheduling with Due-Window Assignment and
           Deterioration Effects

    • Free pre-print version: Loading...

      Authors: Fei Teng, Si-Wen Luo, Dan-Yang Lv, Ji-Bo Wang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we consider scheduling problems with slack (different) due-window assignment and time-dependent processing times. The processing time functions are all a proportional linear increasing function of time. On a single-machine setting, the goal is to minimize a cost function that includes earliness, tardiness, due-window starting time and size, and the number of early and tardy jobs. Some relevant optimality properties and polynomial time solution algorithms are proposed to solve these two problems.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-07-29T07:00:00Z
      DOI: 10.1142/S0217595922500221
       
  • Online Finance in a Dual-Channel Supply Chain with a Capital-Constrained
           Manufacturer

    • Free pre-print version: Loading...

      Authors: Lei Fang, Yi Gao
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This paper investigates a dual-channel supply chain which consists of a capital-constrained manufacturer and an e-commerce platform. The manufacturer sells its products through an offline direct channel and an online platform. The platform can serve as a marketplace or a reseller for the manufacturer, while the platform provides online finance to the manufacturer. We discuss the equilibrium decisions of the manufacturer and the platform when the platform serves as two different roles. We find that when the total production quantity of the manufacturer who with an online marketplace channel exceeds a threshold, the manufacturer tends to choose the platform’s marketplace role for the online channel, unless the wholesale price and the upper limit of demand are high. When production quantity is below this threshold, unless the wholesale price and the upper limit of demand are low, the manufacturer tends to choose the platform’s reseller role for the online channel. The platform tends to choose the role whose production quantity exceeds the threshold. If both are exceeded, the platform chooses the marketplace role when the wholesale price is low, and if both are not exceeded, the marketplace role is better when the wholesale price is high.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-07-25T07:00:00Z
      DOI: 10.1142/S0217595922500208
       
  • Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time,
           Learning Effect, Processing Cost and Machine Eligibility

    • Free pre-print version: Loading...

      Authors: Feifeng Zheng, Kaiyuan Jin, Yinfeng Xu, Ming Liu
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This work investigates an unrelated parallel machine scheduling problem in the shared manufacturing environment. Based on practical production complexity, five job and machine-related factors, including job splitting, setup time, learning effect, processing cost and machine eligibility constraint, are integrated into the considered problem. Parallel machines with uniform speed but non-identical processing capabilities are shared on a sharing service platform, and jobs with different types can only be processed by the machines with matching eligibilities. The platform pays an amount of processing cost for using any machine to process the jobs. To balance the processing cost paid and the satisfaction of customers, we aim to minimize the weighted sum of total processing cost and total completion time of jobs in the considered problem. We establish a mixed integer linear programming model, and provide a lower bound by relaxing the machine eligibility constraint. The CPLEX solver is employed to generate optimal solutions for small-scale instances. For large-scale instances, we propose an efficient heuristic algorithm. Experimental results demonstrate that for various instance settings, the proposed algorithm can always produce near optimal solutions. We further present several managerial insights for the shared manufacturing platform.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-07-25T07:00:00Z
      DOI: 10.1142/S0217595922500233
       
  • Integrating Customer Order Decoupling Point with Operation Planning in
           Deteriorating Supply Chain: General Dynamic Model and Applications

    • Free pre-print version: Loading...

      Authors: Ermei Wang, Lin Li, Kuan Yang, Yinggao Zhou
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Considering the real dilemma of deteriorating items, we explore how to find a balance between the conflicting achievements of enhancing flexibility and reducing costs. We propose a general dynamic model to penetrate customer orders by decoupling point with objective to minimize the cost. The closed forms of optimal solutions are obtained for companies to deal with the integrated problem of customer order decoupling point (CODP) decision and production–inventory plan simultaneously. Applications and numerical experiments are performed to illustrate practical insights for managers. The results show that the truth of zero-inventory policy is to avoid unnecessary inventory instead of absolutely no inventory. The CODP will shift forward with the increasing of customer demand rate and shift backward with the increasing of deterioration rate under the production smoothing policy. However, although it encounters the same changes of demand, the CODP moves with a smaller extent in high deterioration rate than in low. In addition, we find that during the growth phase of product life cycle, the increase of time-sensitive degree of demand is coupled with forward shifting of CODP; while during the decline phase, it is coupled with CODP backward shifting.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-07-11T07:00:00Z
      DOI: 10.1142/S021759592250021X
       
  • A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine
           with Position-Dependent Weights

    • Free pre-print version: Loading...

      Authors: Xinyu Sun, Xin-Na Geng, Jiayin Wang, Tao Liu
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      We study single-machine bicriteria scheduling problems with position-dependent weights. Due date costs and penalty costs can affect the decision-maker’s profit. Therefore, how to optimize the benefits and balance of these costs for decision-makers is the focus of this research. This paper discusses three models: weighted-sum scheduling problem, constrained scheduling problem, Pareto scheduling problem. It analyzes the properties of bicriteria schedule, determines the optimal due dates (usually referred to as different due dates: DIF), and gives the corresponding polynomial solvable algorithms.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-05-25T07:00:00Z
      DOI: 10.1142/S021759592250018X
       
  • Consequences of Trade Regulations on International Trade in
           Remanufacturing

    • Free pre-print version: Loading...

      Authors: Feng Fu, Shuangying Chen, Wei Yan
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      The remanufacturing industry is experiencing a gradual increase in international trade. Accordingly, manufacturers are encountering a multitude of regulations in this cross-border trade of remanufactured products, such as import prohibitions/bans, environmental regulations, and tariff barriers. In this paper, we investigated the implications of exporting remanufactured products to the international market with or without trade regulations. Our analysis reveals that, although the international market for remanufacturing invariably benefits the manufacturer, trade regulations are a disadvantage to remanufactured exports. Thus, while the quality of remanufactured products increases, the adverse effect of trade regulations could be weakened. Additionally, we reveal that trade regulations may be detrimental to the environment with a higher rate of used core collection and disposal impact. Thus, policymakers should take care to regulate the international market for remanufactured goods rather than implementing a one-size-fits-all solution.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-05-04T07:00:00Z
      DOI: 10.1142/S0217595922500166
       
  • Optimal Strategies for A Dual-Channel Farming Supply Chain with Horizontal
           Competition and Cooperation

    • Free pre-print version: Loading...

      Authors: Hongjun Peng, Wenting Sun, Tao Pang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      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.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-04-26T07:00:00Z
      DOI: 10.1142/S0217595922500154
       
  • Parallel Machines Scheduling with Deteriorating Maintenance Activities and
           Job Rejection

    • Free pre-print version: Loading...

      Authors: Juan Zou, Yu-Kang Sui, Jie Gao, Xian-Zhao Zhang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      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.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-04-18T07:00:00Z
      DOI: 10.1142/S0217595922400139
       
  • Submodular Maximization Subject to a Knapsack Constraint Under Noise
           Models

    • Free pre-print version: Loading...

      Authors: Dung T. K. Ha, Canh V. Pham, Huan X. Hoang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      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 ([math]) 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 [math] to show the performances of the proposed algorithms.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-04-18T07:00:00Z
      DOI: 10.1142/S0217595922500130
       
  • Maximum Entropy Bi-Objective Model and its Evolutionary Algorithm for
           Portfolio Optimization

    • Free pre-print version: Loading...

      Authors: Chun-An Liu, Qian Lei, Huamin Jia
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Diversification of investment is a well-established practice for reducing the total risk of investing. Portfolio optimization is an effective way for investors to disperse investment risk and increase portfolio return. Under the assumption of no short selling, a bi-objective minimizing portfolio optimization model, in which the first objective is a semi-absolute deviation mean function used to measure the portfolio risk, and the second objective is a maximum entropy smooth function used to measure the portfolio return, is given in this paper. Also, a maximum entropy multi-objective evolutionary algorithm is designed to solve the bi-objective portfolio optimization model. In order to obtain a sufficient number of uniformly distributed portfolio Pareto optimal solutions located on the true Pareto frontier and fully exploit the useful asset combination modes which can lead the search process toward the frontier direction quickly in the objective space, a subspace multi-parent uniform crossover operator and a subspace decomposition mutation operator are given. Furthermore, a normalization method to deal with the tight constraint and the convergence analysis of the proposed algorithm are also discussed. Finally, the performance of the proposed algorithm is verified by five benchmark investment optimization problems. The performance evaluations and results analyses illustrate that the proposed algorithm is capable of identifying good Pareto solutions and maintaining adequate diversity of the evolution population. Also, the proposed algorithm can obtain faster and better convergence to the true portfolio Pareto frontier compared with the three state-of-the-art multi-objective evolutionary algorithms. The result can also provide optimal portfolio plan and investment strategy for investors to allocate and manage asset effectively.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-04-11T07:00:00Z
      DOI: 10.1142/S0217595922500142
       
  • Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with
           Setup Times and Machine Available Times

    • Free pre-print version: Loading...

      Authors: Caixia Jing, Wanzhen Huang, Lei Zhang, Heng Zhang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we consider the scheduling of high multiplicity jobs on parallel multi-purpose machines with setup times and machine available times, with the objective of minimizing makespan. High multiplicity means that jobs are partitioned into several groups and in each group all jobs are identical. Whenever there is a switch from processing a job of one group to a job of another group, a setup time is needed. Multi-purpose machine implies that each job can only be processed by a specific subset of all the machines, called processing set. A mixed integer programming is formulated for this NP-hard problem. A heuristic is proposed to solve the problem. Lower bounds are developed to evaluate the heuristic algorithm. Extensive numerical computations are performed and the results show that the heuristic generates solutions with makespan within 2% above the lower bounds in average, and outperforms CPLEX 12.6 for large scale and complex problems.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-04-05T07:00:00Z
      DOI: 10.1142/S0217595922500129
       
  • An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios
           Problem

    • Free pre-print version: Loading...

      Authors: Bo Zhang, Yuelin Gao
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Founded on the idea of subdividing the [math]-dimensional output space, a branch-and-bound algorithm for solving the sum-of-linear-ratios(SLR) problem is proposed. First, a two-stage equivalent transformation method is adopted to obtain an equivalent problem(EP) for the problem SLR. Second, by dealing with all nonlinear constraints and bilinear terms in EP and its sub-problems, a corresponding convex relaxation subproblem is obtained. Third, all redundant constraints in each convex relaxation subproblem are eliminated, which leads to a linear programming problem with smaller scale and fewer constraints. Finally, the theoretical convergence and computational complexity of the algorithm are demonstrated, and a series of numerical experiments illustrate the effectiveness and feasibility of the proposed algorithm.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-03-24T07:00:00Z
      DOI: 10.1142/S0217595922500105
       
  • Multiobjective Symmetric Duality in Higher-Order Fractional Variational
           Programming

    • Free pre-print version: Loading...

      Authors: Arshpreet Kaur, Mahesh Kumar Sharma, Izhar Ahmad
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      We introduce new classes of higher-order functional, termed higher-order [math]convex and higher-order [math]convex functionals. These classes are illustrated by nontrivial examples. A pair of higher-order multiobjective symmetric fractional variational programs with cone constraints and fixed boundary conditions is formulated. Appropriate duality results are discussed utilizing the aforementioned assumptions. The results in this paper are generalizations of the results already existing in literature.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-03-10T08:00:00Z
      DOI: 10.1142/S0217595922500087
       
  • Online Batch Scheduling of Incompatible Job Families with Variable
           Lookahead Interval

    • Free pre-print version: Loading...

      Authors: Wenhua Li, Libo Wang, Hang Yuan
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      We consider online parallel-batch scheduling of [math] incompatible unit-length job families with variable lookahead interval to minimize the maximum completion time, where [math] is the number of job families which is known in advance. Incompatible job family means that a batch only contains the jobs from the same job family. At any time [math], an online algorithm can foresee the information of the jobs arriving in the time interval [math], where [math] is variable. When the batch capacity [math] and [math], we provide a best possible online algorithm with competitive ratio [math] for [math] and [math], where [math] is a positive root of [math]. When the batch capacity [math] and [math], we give an online algorithm with competitive ratio [math] for [math] and [math], and prove that it is the best possible for [math] and [math].
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-03-08T08:00:00Z
      DOI: 10.1142/S0217595922400127
       
  • Critical Interactive Risks in Project Portfolios from the Life Cycle
           Perspective

    • Free pre-print version: Loading...

      Authors: Libiao Bai, Jiale Liu, Ning Huang, Kanyin Zheng, Tingting Hao
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      The need for enterprises to manage project portfolio risks over the life cycle has become increasingly prominent. It is essential to evaluate and manage them to achieve project portfolios and organizations’ success. Unlike project risk, project portfolio risk is more complex and uncertain due to risk interactions. Risk management is unsatisfactory in project portfolios due to the lack of awareness of risk interactions and the life cycle. The purpose of this paper is to identify the critical risks of project portfolios over the life cycle considering risk interactions. We primarily verified 20 identified risks through a questionnaire survey and an expert interview method and evaluated the interactions among them using the Delphi method. Furthermore, risk interactions were analyzed using the social network analysis (SNA) methodology to determine the important risks. Finally, a comprehensive evaluation of important risks was carried out to identify critical risks according to the evaluation principles. The results identified six critical portfolio risks, two key risk contagion paths and revealed risk characteristics of different life cycle phases. This research considerably contributes to the body of knowledge pertaining to project portfolio management that will enable organizations that implement project portfolios and similar multi projects to emphasize critical risks.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-03-08T08:00:00Z
      DOI: 10.1142/S0217595922500075
       
  • Scalarization and Optimality Conditions of [math]-Globally Proper
           Efficient Solution for Set-Valued Equilibrium Problems

    • Free pre-print version: Loading...

      Authors: Zhi-Ang Zhou, Min Kuang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, our purpose is to use the improvement set to investigate the scalarization and optimality conditions of [math]-globally proper efficient solution for the set-valued equilibrium problems with constraints. First, the notion of [math]-globally proper efficient solution for set-valued equilibrium problems with constraints is introduced in locally convex Hausdorff topological spaces. Second, the linear scalarization theorems of [math]-globally proper efficient solution are derived. Finally, under the assumption of nearly [math]-subconvexlikeness, the Kuhn–Tucker and Lagrange optimality conditions for set-valued equilibrium problems with constraints are obtained in the sense of [math]-globally proper efficiency. Meanwhile, we give some examples to illustrate our results. The results obtained in this paper improve and generalize some known results in the literature.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-02-28T08:00:00Z
      DOI: 10.1142/S0217595922500099
       
  • Least-Distance Range Adjusted Measure in DEA: Efficiency Evaluation and
           Benchmarking for Japanese Banks

    • Free pre-print version: Loading...

      Authors: Xu Wang, Takashi Hasuike
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This study aims to formulate the least-distance range adjusted measure (LRAM) in data envelopment analysis (DEA) and apply it to evaluate the relative efficiency and provide the benchmarking information for Japanese banks. In DEA, the conventional range adjusted measure (RAM) acts as a well-defined model that satisfies a set of desirable properties. However, because of the practicality of the least-distance measure, we formulate the LRAM and propose the use of an effective mixed integer programming (MIP) approach to compute it in this study. The formulated LRAM (1) satisfies the same desirable properties as the conventional RAM, (2) provides the least-distance benchmarking information for inefficient decision-making units (DMUs), and (3) can be computed easily by using the proposed MIP approach. Here, we apply the LRAM to a Japanese banking data set corresponding to the period 2017–2019. Based on the results, the LRAM generates higher efficiency scores and allows inefficient banks to improve their efficiency with a smaller extent of input–output modification than that required by the RAM, thereby indicating that the LRAM can provide more easy-to-achieve benchmarking information for inefficient banks. Therefore, from the perspective of the managers of DMUs, this study provides a valuable LRAM for efficiency evaluation and benchmarking analysis.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-02-22T08:00:00Z
      DOI: 10.1142/S0217595922500063
       
  • Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the
           Total (Weighted) Completion Time

    • Free pre-print version: Loading...

      Authors: Cuixia Miao, Fanyu Kong, Juan Zou, Ran Ma, Yujia Huo
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we consider the parallel-machine scheduling with step-deteriorating jobs. The actual processing time of each job deteriorates as a step function if its starting time is beyond a given deteriorating date. We focus on the case of the common job deteriorating date. For the minimization problem of total completion time, we first show that the problem is NP-hard in the strong sense. Then we propose one property of any optimal schedule. Furthermore, we prove that two special cases of common normal processing time or common penalty are polynomially solvable. For the minimization problem of total weighted completion time, we analyze the NP-hardness and present a polynomial time optimal algorithm for the case of common normal processing time and common penalty.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-02-14T08:00:00Z
      DOI: 10.1142/S0217595922400115
       
  • Effective Heuristic Techniques for Combined Robust Clustering Problem

    • Free pre-print version: Loading...

      Authors: Yunhe Xu, Chenchen Wu, Ling Gai, Lu Han
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Clustering is one of the most important problems in the fields of data mining, machine learning, and biological population division, etc. Moreover, robust variant for [math]-means problem, which includes [math]-means with penalties and [math]-means with outliers, is also an active research branch. Most of these problems are NP-hard even the most classical problem, [math]-means problem. For the NP-hard problems, the heuristic algorithm is a powerful method. When the quality of the output can be guaranteed, the algorithm is called an approximation algorithm. In this paper, combining two types of robust settings, we consider [math]-means problem with penalties and outliers ([math]-MPO). In the [math]-MPO, we are given an [math]-point set [math], a penalty cost [math] for each [math], an integer [math], and an integer [math]. The target is to find a center subset [math] with [math], a penalty subset [math] and an outlier subset [math] with [math], such that the sum of the total costs, including the connection cost and the penalty cost, is minimized. We offer an approximation algorithm using a heuristic local search scheme. Based on a single-swap manipulation, we obtain [math]-approximation algorithm.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-02-07T08:00:00Z
      DOI: 10.1142/S0217595922400097
       
  • Approximation Algorithms for Matroid and Knapsack Means Problems

    • Free pre-print version: Loading...

      Authors: Ao Zhao, Qian Liu, Yang Zhou, Min Li
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we concentrate on studying the [math]-means problem with a matroid or a knapsack constraint. In the matroid means problem, given an observation set and a matroid, the goal is to find a center set from the independent sets to minimize the cost. By using the linear programming [math]-rounding technology, we obtain a constant approximation guarantee. For the knapsack means problem, we adopt a similar strategy to that of matroid means problem, whereas the difference is that we add a knapsack covering inequality to the relaxed LP in order to decrease the unbounded integrality gap.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-01-28T08:00:00Z
      DOI: 10.1142/S0217595922400073
       
  • A Variational Inequality-Based Location-Allocation Algorithm for Locating
           Multiple Interactive Facilities

    • Free pre-print version: Loading...

      Authors: Yan Gu, Jianlin Jiang, Liyun Ling, Yibing Lv, Su Zhang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Multi-source Weber problem (MWP) is an important model in facility location, which has wide applications in various areas such as health service management, transportation system management, urban planning, etc. The location-allocation algorithm is a well-known method for solving MWP, which consists of a location phase and an allocation phase at each iteration. In this paper, we consider more general and practical case of MWP–the constrained multi-source location problem (CMSLP), i.e., the location of multiple facilities with considering interactive transportation between facilities, locational constraints on facilities and the gauge for measuring distances. A variational inequality approach is contributed to solving the location subproblem called the constrained multi-facility location problem (CMFLP) in location phase, which leads to an efficient projection-type method. Then a new location-allocation algorithm is developed for CMSLP. Global convergence of the projection-type method as well as local convergence of new location-allocation algorithm are proved. The efficiency of proposed methods is verified by some preliminary numerical results.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-01-15T08:00:00Z
      DOI: 10.1142/S0217595922400103
       
  • Workload Balancing Among Heathcare Workers Under Uncertain Service Time
           Using Distributionally Robust Optimization

    • Free pre-print version: Loading...

      Authors: Nguyen Duy Anh
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      Healthcare systems are facing serious challenges in balancing their human resources to cope with volatile service demand, while at the same time providing necessary job satisfaction to the healthcare workers. In this paper, we propose a distributionally robust optimization formulation to generate a task assignment plan that promotes the fairness in allocation, attained by reducing the difference in the total working time among workers, under uncertain service time. The proposed joint chance constraint model is conservatively approximated by a worst-case Conditional Value-at-Risk, and we devise a sequential algorithm to solve the finite-dimensional reformulations which are linear (mixed-binary) optimization problems. We also provide explicit formula in the situation where the support set of the random vectors is a hyperrectangle. The experiment with both synthetic and real data indicates promising results for our distributionally robust optimization approach.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-01-12T08:00:00Z
      DOI: 10.1142/S0217595921500457
       
  • Approximation Algorithms for the Capacitated Min–Max Correlation
           Clustering Problem

    • Free pre-print version: Loading...

      Authors: Sai Ji, Jun Li, Zijun Wu, Yicheng Xu
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      In this paper, we propose a so-called capacitated min–max correlation clustering model, a natural variant of the min–max correlation clustering problem. As our main contribution, we present an integer programming and its integrality gap analysis for the proposed model. Furthermore, we provide two approximation algorithms for the model, one of which is a bi-criteria approximation algorithm and the other is based on LP-rounding technique.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-01-04T08:00:00Z
      DOI: 10.1142/S0217595922400085
       
  • Slack Due-Window Assignment Scheduling Problem with Deterioration Effects
           and a Deteriorating Maintenance Activity

    • Free pre-print version: Loading...

      Authors: Xue Jia, Dan-Yang Lv, Yang Hu, Ji-Bo Wang, Zhi Wang, Ershen Wang
      Abstract: Asia-Pacific Journal of Operational Research, Ahead of Print.
      This paper studies the slack due-window assignment scheduling problem with deterioration effects and a deterioration maintenance activity on a single-machine. The machine deteriorates during the machining process, and at a certain moment performs a deterioration maintenance activity, that is, the duration time of the maintenance activity is a linear function of the maintenance starting time. It is needed to make a decision on when to schedule the deteriorating maintenance activity, the optimal common flow allowances and the sequence of jobs to minimize the weighted penalties for the sum of earliness and tardiness, weighted number of early and delayed, and weighted due-window starting time and size. This paper proposes a polynomial time algorithm to solve this problem.
      Citation: Asia-Pacific Journal of Operational Research
      PubDate: 2022-01-04T08:00:00Z
      DOI: 10.1142/S0217595922500051
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 3.225.221.130
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-