نتایج جستجو برای: allocation problem bi level programming branch and bound full enumeration clustering
تعداد نتایج: 17074859 فیلتر نتایج به سال:
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...
1. Decision making and operations research. (a) The need for optimization. (b) Typical models of industry and finance. 2. Advanced linear programming (LP) (a) Need for linear models. (b) General form of LP problems. (c) The sparse simplex method; primal and dual algorithms; computational implications. (d) Economic interpretation of the optimality conditions: Sensitivity analysis. (e) Interior p...
Providing efficient workload management is an important issue for a large-scale heterogeneous distributed computing environment where a set of periodic applications is executed. The considered shipboard distributed system is expected to operate in an environment where the input workload is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial ...
For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity. The problem can be interpreted as the set-partitioning problem, which reminds us of its integer linear programming (ILP) formulation. We provide a branch-and-price framework for solving this ILP...
the present study set out (a) to examine the categories of pedagogical knowledge related to the act of teaching of novice and experienced teachers as gleaned from their verbal report of what they were thinking about while teaching and (b) to compare the categories of pedagogical knowledge of novice and experienced teachers. the aim of comparing these two groups of teachers was to see whether di...
This paper presents a competitive supply chain network design problem in which one, two, or three supply chains are planning to enter the price-dependent markets simultaneously in uncertain environments and decide to set the prices and shape their networks. The chains produce competitive products either identical or highly substitutable. Fuzzy multi-level mixed integer programming is used to mo...
In this paper, we consider an allocation problem in multivariate surveys with non-linear costs of enumeration as a problem of non-linear stochastic programming with multiple objective functions. The solution is obtained through Chance Constrained programming. A different formulation of the problem is also presented in which the non-linear cost function is minimised under the precision constrain...
cellular manufacturing system (cms) is highly important in modern manufacturing methods. given the ever increasing market competition in terms of time and cost of manufacturing, we need models to decrease the cost and time of manufacturing. in this study, cms is considered in condition of dynamic demand in each period. the model is developed for facing dynamic demand that increases the cost of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید