After a characterization of the cost-oriented assembly line balancing problem it will be shown that by loading the stations maximally the cost-oriented optimum can be missed. Instead of loading the stations maximally the criterion two-stations-rule a has to be used. For generating optimal...

The present paper develops a basic framework for evaluating and optimizing profits in a business operation. In developing a business we are often faced with an infinity of choices ranging from what products or services to sell and what customers to target to how to structure and manage the...

This paper is focused on the solution quality and computing time requirements of heuristic methods for cost-oriented assembly line balancing. It is based on a recent paper (Amen, International Journal of Production Economics 68 (2000), which describes in detail the solution process of existent...

This paper is concerned with cost-oriented assembly line balancing. This problem occurs especially in the final assembly of automotives, consumer durables or personal computers, where production is still very labour- intensive, and where the wage rates depend on the requirements and...

The goal of the paper is to study how a menu of options affects decisions of a rational agent facing uncertainty over future payoff streams. Using the real options approach, we demonstrate that multiple options not only increase the barrier which the underlying stochastic variable has to reach...

This paper focuses on Stochastic Dominance (SD) efficiency in a finite empirical panel data. We analytically characterize the sets of unsorted time series that dominate a given evaluated distribution by the First, Second, and Third order SD. Using these insights, we develop simple Linear...

This paper extends Svensson and Woodford’s (2003) partial information framework by allowing the private agents to achieve robustness against incomplete information about the structure of the economy by distorting their expectations in a particular direction. It shows how a linear rational...

We propose a decomposition method for the solution of a dynamic portfolio optimization problem which fits the formulation of a multistage stochastic programming problem. The method allows to obtain time and nodal decomposition of the problem in its arborescent formulation applying a discrete...

This paper presents a simple discrete time model for valuing real options. A short proof of optimal exercise rules for the standard problems in the real options theory is given in the binomial and trinomial models, and more generally, when the underlying uncertainty is modelled as a random walk...

A general framework for pricing of real options in continuous time for wide classes of payoff streams that are monotone functions of a Levy process is provided. Exercise rules are formulated in terms of statistics of record-setting low payoffs and can be viewed as an extension of Bernanke's bad...