نتایج جستجو برای: weighted flow time
تعداد نتایج: 2357750 فیلتر نتایج به سال:
in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern that these algorithms may be insufficiently fair to individual jobs. The standard method for balancing average QoS and fairness is optimize the lp norm, 1 < p < ∞. Thus we consider server scheduling strategies to optimize the lp norms of the standard QoS measures, flow ...
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
BACKGROUND AND PURPOSE A challenge with the T1-weighted postcontrast Cartesian spin-echo and turbo spin-echo brain MR imaging is the presence of flow artifacts. Our aim was to develop a rapid 2D spiral spin-echo sequence for T1-weighted MR imaging with minimal flow artifacts and to compare it with a conventional Cartesian 2D turbo spin-echo sequence. MATERIALS AND METHODS T1-weighted brain im...
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
This paper provides a heuristic procedure for solving the constrained flow-shop scheduling problems of n-jobs on m-machines. We obtained a schedule with a set of n-jobs to minimize the mean weighted flow-time. This method is very easy to understand and to apply. It will also help managers in the scheduling related issues by aiding them in the decision making process and providing an optimal or ...
This study has been done in a raajor brake-shoe factor.'. Air samples were taken and dustlevels determined according to OSHA code, revealing a dust load in weighting and shootingsaloons ranging from 2 to 16.88 mg/nr Measurement and counting of asbestos fibers weredone using OSHA ID 160/ code and permissible exposure levels. Asbestos fiber counts in sampled areas were higher than the time weigh...
This thesis is divided into two parts. The first part of the thesis deals with the study of heuristic based approaches for approximating Pareto fronts. We propose a new Double Archive Pareto local search algorithm for solving multi-objective combinatorial optimization problems. We embed our technique into a genetic framework where our algorithm restarts with the set of new solutions formed by t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید