The problem of optimal design of the assembly lines is considered. The paper is especially focused on the line balancing and resource planning step for the preliminary design stage. A survey of existing methods and software tools are given. Copyright © 2002 IFAC

Assembly line balancing (ALB) and sequencing is an active area of optimization research in operations management. The concept of an assembly line (AL) came to the fact when the finished product is inclined to the perception of product modularity. Usually interchangeable parts of the final product are assembled in sequence using best possibly designed logistics in an AL. The initial stage of con...

1 We consider the operation of automated mobility-on-demand systems, whereby users share access to a fleet 2 of self-driving vehicles. In these systems, rebalancing, the process by which the supply of empty vehicles is 3 periodically realigned with the demand for transport, is carried out by a fleet operator. Where much of the 4 rebalancing literature skews to the theoretical or simulation-base...

The traditional Markowitz MVO approach is based on a single-period model. Single period models do not utilize any data or decisions beyond the rebalancing time horizon with the result that their policies are myopic in nature. For long-term investors, multi-period optimization offers the opportunity to make wait-and-see policy decisions by including approximate forecasts and long-term policy dec...

The aim of this paper is to justify the use of constant mix investment strategies as an approximation for periodically rebalanced investment strategies. In Dhaene et al. (2005), general optimization problems are solved in a lognormal framework by deriving convex order bounds based on comonotonicity. The multi-period optimal portfolio selection problems discussed in Dhaene et al. (2005) are solv...

Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the design space of balanced trees has not been fully explored. We continue the exploration. Our contributions are three. We systematically study the...