When using linguistic approaches to solve decision problems, we need linguistic representation models. The symbolic model, the 2-tuple fuzzy linguistic representation model and the continuous linguistic model are three existing linguistic representation models based on position indexes. Together...

Inspired by the concept of deviation measure between two linguistic preference relations, this paper further defines the deviation measure of a linguistic preference relation to the set of consistent linguistic preference relations. Based on this, we present a consistency index of linguistic...

In many customer-intensive services, the perceived quality of service decreases in the speed of service. Usually, an increase in service speed induces different marginal reductions in quality for heterogeneous customers. To bring insight into the managerial implications of this difference, we...

Because individual interpretations of the analytic hierarchy process (AHP) linguistic scale vary for each user, this study proposes a novel framework that AHP decision makers can use to generate numerical scales individually, based on the 2-tuple linguistic modeling of AHP scale problems. By...

Recently, the single-period, single-item newsboy problem for the case where demand distribution is limited (e.g., range, mean, mode, variance, symmetry) has been widely studied. However, the existing newsboy models with partial information are fit to risk-neutral inventory managers, and there...

Any reputable discussion of the proper form of public order in China requires that we first establish a fundamental principle of social justice. This is especially true during our country's current transition whereby old norms and conventions are rapidly disappearing and new institutional forms...

We consider the online Steiner Traveling Salesman Problem. In this problem, we are given an edge-weighted graph G = (V, E) and a subset D⊆V of destination vertices, with the optimization goal to find a minimum weight closed tour that traverses every destination vertex of D at least once....

In this paper, we propose a stochastic programming model for the well-known single-period newsvendor problem by adopting the conditional Value-at-Risk (CVaR) as the risk metric in the objective function. The demand uncertainty is modeled in terms of discrete scenarios that reflect the empirical...

This work studies a variant of the online generalized assignment problem, where there are m⩾2 heterogeneous servers to process n requests which arrive one by one over time. Each request must either be assigned to one of the servers or be rejected upon its arrival, before knowing any...