Service rebalancing is a method for designing programs that adhere to the cli-ent/server model. Decisions about the division of labor between client and server are made dynamically at runtime rather than at design time. Service rebalancing may improve performance, because the division of eeort is based upon an evaluation of the current environment. Other beneets of service rebalancing include o...

In this paper, we present the process of rebalancing the line at motorcycle-assembly plant. The company found it necessary to rebalance its line, since it needs to increase production in the spring and summer months. The main characteristics of the problem are as follows: (i) the company hires temporary staff, who need more time to carry out their tasks than permanent workers; (ii) there must a...

Defect prediction models that are trained on class imbalanced datasets (i.e., the proportion of defective and clean modules is not equally represented) are highly susceptible to produce inaccurate prediction models. Prior research compares the impact of class rebalancing techniques on the performance of defect prediction models. Prior research efforts arrive at contradictory conclusions due to ...

This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...

B-trees with relaxed balance have been deened to facilitate fast updating in a concurrent database environment. In that structure, updating and rebalancing are uncoupled such that extensive locking can be avoided in connection with updates. Constraints, weaker than the usual ones, are maintained such that the tree can still be balanced independent of the updating processes. We nd the idea of re...

The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. In this paper, we describe a relaxed version of AVL trees. We prove that each update gives rise to at most a logarithmic number of rebalancing operations and that the number of rebalancing operations in the semidynamic case is amortized c...

This paper presents a multi-objective simulated annealing algorithm for the mixed-model assembly line balancing with stochastic processing times. Since, the stochastic task times may have effects on the bottlenecks of a system, maximizing the weighted line efficiency (equivalent to the minimizing the number of station), minimizing the weighted smoothness index and maximizing the system reliabil...

This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer ...

In PODS’91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to be postponed completely or partially until after peak working hours. The adva...