The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

The clp scheme uses Horn clauses and sld resolution to generate multiple constraint satisfaction problems (csps). The possible csps include rational trees (giving Prolog) and numerical algorithms for solving linear equations and linear programs (giving clp(r)). In this paper we develop a form of csp for interval constraints. In this way one obtains a logic semantics for the efficient floating-p...

To address the hesitancy, inconsistency and uncertainty of decision makers’ cognitions, linguistic interval hesitant fuzzy sets (LIHFSs) are efficient tools. This paper focuses on studying the application of LIHFSs. To do this, two correlation coefficients of LIHFSs are defined, which needn't consider the length of elements in LIHFSs or the arrangement of their possible interval values. To addr...

The aim of our paper is to obtain efficient solutions the interval multi-objective linear programming (IMOLP) models. In this paper, we propose a new method determine in IMOLP models by using expected value and variance operators (EVV operators). First, define concepts value, variance, uncertainty distributions, present some properties EVV operators. Then, introduce model under these An consist...

State estimation (SE) of distribution networks heavily relies on pseudo measurements that introduce significant errors, since real-time are insufficient. Interval SE models regularly used, where true values system states supposed to be within the estimated intervals. However, conventional interval algorithms cannot consider correlations same variables in different terms constraints, which resul...

We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems. We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems. By introducing new arithmetic operations between interval numbers, we prove the weak...