This paper considers an assembly system where a firm produces a single product which is assembled using two types of components (component 1 and component 2). The components are provided by individual suppliers (supplier 1 and supplier 2). We assume that the firm makes different procurement...

The quasi-equilibrium problems with constraints are formulated and some sufficient conditions on the existence of their solutions are shown. As special cases, we obtain several results on the existence of solutions of some vector quasivariational inequality and vector optimization problems. An...

This paper introduces and studies the compromise value for cooperative games with random payoffs, that is, for cooperative games where the payoff to a coalition of players is a random variable. This value is a compromise between utopia payoffs and minimal rights and its definition is based on...

The paper formulates an extended model of Weber problem in which the customers are represented by convex demand regions. The objective is to generate a site in R <Superscript>2</Superscript> that minimizes the sum of weighted Euclidean distances between the new facility and the farthest points of demand regions. This...</superscript>

Several multi-criteria-decision-making methodologies assume the existence of weights associated with the different criteria, reflecting their relative importance.One of the most popular ways to infer such weights is the analytic hierarchy process, which constructs first a matrix of pairwise...

A a set-valued optimization problem min<Subscript> C </Subscript> F(x), x ∈X <Subscript>0</Subscript>, is considered, where X <Subscript>0</Subscript> ⊂ X, X and Y are normed spaces, F: X <Subscript>0</Subscript> ⊂ Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x <Superscript>0</Superscript>,y <Superscript>0</Superscript>), y <Superscript>0</Superscript> ∈F(x <Superscript>0</Superscript>), and are called...</superscript></superscript></superscript></superscript></subscript></subscript></subscript></subscript>

We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop problem with multiple identical machines in each stage. The objective is to schedule a set of jobs so as to minimize the makespan. This is the first exact procedure which has been specifically designed for this...

This paper studies maximum likelihood estimates as well as confidence intervals of an M/M/R queue with heterogeneous servers under steady-state conditions. We derive the maximum likelihood estimates of the mean arrival rate and the three unequal mean service rates for an M/M/3 queue with...

In this paper, we consider constrained noncooperative N-person stochastic games with discounted cost criteria. The state space is assumed to be countable and the action sets are compact metric spaces. We present three main results. The first concerns the sensitivity or approximation of...

A game option is an American option with the added feature that not only the option holder, but also the option writer, can exercise the option at any time. We characterize the value of a perpetual game option in terms of excessive functions, and we use the connection between excessive functions...