منابع مشابه
The interval ordering problem
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by earlier intervals in the ordering). This problem is motivated by an application in molecular biology that concerns the determination of the structure of the back...
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملOn an Interval Splitting Problem
Let X,, X,, ,be i.i.d. random variables, which are uniformly distributed on [O,l]. Further let Z,(O) = [0, l] and let Z,(n) denote the k th largest interval generated by the points 0, X,, X,, . , X,_ 1, 1 (or equivalently, the interval corresponding to the kth largest spacing at the nth stage). This note studies the question for which classes of sequences k = k(n), will the interval Z,(,,(n) be...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملThe Capacitated Location-Allocation Problem with Interval Parameters
In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kongunadu Research Journal
سال: 2021
ISSN: 2349-2694
DOI: 10.26524/krj.2021.3