نتایج جستجو برای: machine reliability branch and bound
تعداد نتایج: 16899046 فیلتر نتایج به سال:
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
according to webster and wind (1972) and anderson et al (1987), “organizational buying is a complex process and involves many people from different functional areas, multiple goals and potentially conflicting decision criteria. moreover, the customers of today are also more knowledgeable and selective when making their purchasing decisions. since a key to organizational survival is the retentio...
we show that when both sources ( lepton flavor violation sources and cp-violating phases) are present, the electric dipole moment of the electron, $d_e$, receives a contribution from the phase of the trilinear $a$-term of staus, $phi_{a_ au}$. for $phi_{a_ au}=pi/2$, the value of $d_e$, depending on the ratios of the lfv mass elements, can range between zero and three orders of magnitude a...
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
The problem tackled in this paper deals with products of a finite number of triangular matrices in Max-Plus algebra, and more precisely with an optimization problem related to the product order. We propose a polynomial time optimization algorithm for 2 × 2 matrices products. We show that the problem under consideration generalizes numerous scheduling problems, like single machine problems or tw...
Christopher James Coakley University of California, Santa Barbara 41.
The cost effectiveness of various search methods used in experimental and practical discrete utterance speech recognition systems is a very critical factor for the usefulness of such systems. The advantages of some cost effective search techniques, e.g. branch and bound search, branch and bound search with pruning and beam search, have been previoulsy reported. In this paper we analyze the prop...
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید