Assembly line balancing (ALB) aims at distributing those work required to assemble a product in mass or series production among a set of workstations in an assembly line. Heuristics approaches, in corporation with computer simulation, have demonstrated a number of advantages in practice. In this paper a technique has been presented for the hybridization of the heuristic for the assembly line ba...

This study develops inter-temporal dynamic asset allocation with stochastic volatility (DAASV) models. The DAASV models integrate the stochastic volatility feature inherent in asset returns into the allocation procedure. By applying the DAASV, an investor can more efficiently diversify the unsystematic risks, so as to achieve better performance. We demonstrate that the DAASV models dominate the...

We give, for any reasonable function f, a scheme for rebalancing a binary search tree with amortized O(f(n)) work per update while guaranteeing a height bounded by dlog(n+1)+1=f(n)e for all n. As a corollary, in the semi-dynamic case, height dlog(n+1)e can be guaranteed with amortized O(log n) work per insertion. Both results match existing lower bounds, and hence provide an exact characterizat...

Monte Carlo simulations are used to demonstrate that a very attractive tax-based trading strategy is to realize all capital losses, using excess losses to offset realized gains to rebalance the portfolio. This strategy increases the mean and median return by taking advantage of the tax-deductibility of losses, and mitigates risk by allowing low-cost portfolio rebalancing. This portfolio rebalan...

When search trees are made relaxed, balance constraints are weakened such that updates can be made without immediate rebalancing. This can lead to a speed-up in some circumstances. However, the weakened balance constraints also make it more challenging to prove complexity results for relaxed structures. In our opinion, one of the simplest and most intuitive presentations of balanced search tree...